1 (* Title: "Interpret/lucas-interpreter.sml"
3 (c) due to copyright terms
6 "-----------------------------------------------------------------------------------------------";
7 "table of contents -----------------------------------------------------------------------------";
8 "-----------------------------------------------------------------------------------------------";
9 "----------- Take as 1st stac in program -------------------------------------------------------";
10 "----------- re-build: fun locate_input_tactic -------------------------------------------------";
11 "----------- fun locate_input_tactic Helpless, NOT applicable ----------------------------------";
12 "----------- re-build: fun find_next_step, mini ------------------------------------------------";
13 "----------- re-build: fun locate_input_term ---------------------------------------------------";
14 "-----------------------------------------------------------------------------------------------";
15 "-----------------------------------------------------------------------------------------------";
16 "-----------------------------------------------------------------------------------------------";
18 "----------- Take as 1st stac in program -------------------------------------------------------";
19 "----------- Take as 1st stac in program -------------------------------------------------------";
20 "----------- Take as 1st stac in program -------------------------------------------------------";
21 "compare --- Apply_Method with initial Take by Step.do_next --- in test/../step-solve ----------";
22 val p = e_pos'; val c = [];
23 val (p,_,f,nxt,_,pt) =
25 [(["functionTerm (x \<up> 2 + 1)", "integrateBy x", "antiDerivative FF"],
26 ("Integrate", ["integrate", "function"], ["diff", "integration"]))];
27 val (p,_,f,nxt,_,pt) = me nxt p c pt; (*nxt = ("Tac ", ...) --> Add_Given...*)
28 val (p,_,f,nxt,_,pt) = me nxt p c pt;
29 val (p,_,f,nxt,_,pt) = me nxt p c pt;
30 val (p,_,f,nxt,_,pt) = me nxt p c pt;
31 val (p,_,f,nxt,_,pt) = me nxt p c pt;
32 val (p,_,f,nxt,_,pt) = me nxt p c pt;
33 val (p,_,f,nxt,_,pt) = me nxt p c pt;
34 case nxt of (Apply_Method ["diff", "integration"]) => ()
35 | _ => error "integrate.sml -- me method [diff,integration] -- spec";
36 "----- step 8: returns nxt = Rewrite_Set_Inst ([\"(''bdv'', x)\"],\"integration\")";
38 "~~~~~ fun me, args:"; val (tac, (p:pos'), _, (pt:ctree)) = (nxt, p, c, pt);
39 "~~~~~ fun Step.by_tactic, args:"; val (tac, (ptp as (pt, p))) = (tac, (pt,p));
40 val Applicable.Yes m = Step.check tac (pt, p);
41 (*if*) Tactic.for_specify' m; (*false*)
42 "~~~~~ fun loc_solve_ , args:"; val (m, (pt,pos)) = (m, ptp);
44 "~~~~~ fun Step_Solve.by_tactic , args:"; val (m as Apply_Method' (mI, _, _, ctxt), (pt, (pos as (p,_))))
46 val {srls, ...} = MethodC.from_store mI;
47 val itms = case get_obj I pt p of
48 PblObj {meth=itms, ...} => itms
49 | _ => error "solve Apply_Method: uncovered case get_obj"
50 val thy' = get_obj g_domID pt p;
51 val thy = ThyC.get_theory thy';
52 val srls = LItool.get_simplifier (pt, pos)
53 val (is, env, ctxt, sc) = case LItool.init_pstate srls ctxt itms mI of
54 (is as Istate.Pstate {env, ...}, ctxt, sc) => (is, env, ctxt, sc)
55 | _ => error "solve Apply_Method: uncovered case init_pstate";
56 (*+*)pstate2str (the_pstate is) = "([\"\n(f_f, x \<up> 2 + 1)\",\"\n(v_v, x)\"], [], empty, NONE, \n??.empty, ORundef, false, true)";
57 val ini = LItool.implicit_take sc env;
60 val NONE = (*case*) ini (*of*);
61 val Next_Step (is', ctxt', m') =
62 LI.find_next_step sc (pt, (p, Res)) is ctxt;
63 (*+*)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)";
64 val Safe_Step (_, _, Take' _) = (*case*)
65 locate_input_tactic sc (pt, (p, Res)) is' ctxt' m' (*of*);
66 "~~~~~ fun locate_input_tactic , args:"; val ((Prog prog), cstate, istate, ctxt, tac)
67 = (sc, (pt, (p, Res)), is', ctxt', m');
69 (*case*) scan_to_tactic1 (prog, (cstate, ctxt, tac)) istate (*of*);
70 "~~~~~ fun scan_to_tactic1 , args:"; val ((prog, (cctt as ((_, p), _, _))), (Istate.Pstate (ist as {path, ...})))
71 = ((prog, (cstate, ctxt, tac)), istate);
72 (*if*) path = [] orelse ((last_elem o fst) p = 0 andalso snd p = Res) (*then*);
74 val Accept_Tac1 (_, _, Take' _) =
75 scan_dn1 cctt (ist |> set_path [R] |> set_or ORundef) (Program.body_of prog);
76 "~~~~~ fun scan_dn1 , args:"; val (xxx, ist, (Const (\<^const_name>\<open>Let\<close>, _) $ e $ (Abs (id, T, b))))
77 = (cctt, (ist |> set_path [R] |> set_or ORundef), (Program.body_of prog));
79 (*+*) if UnparseC.term e = "Take (Integral f_f D v_v)" then () else error "scan_dn1 Integral changed";
82 scan_dn1 xxx (ist |> path_down [L, R]) e (*of*);
83 (*======= end of scanning tacticals, a leaf =======*)
84 "~~~~~ fun scan_dn1 , args:"; val (((pt, p), ctxt, tac), (ist as {eval, or, ...}), t)
85 = (xxx, (ist |> path_down [L, R]), e);
86 val (Program.Tac stac, a') = check_leaf "locate" ctxt eval (get_subst ist) t;
90 "----------- re-build: fun locate_input_tactic -------------------------------------------------";
91 "----------- re-build: fun locate_input_tactic -------------------------------------------------";
92 "----------- re-build: fun locate_input_tactic -------------------------------------------------";
93 val fmz = ["equality (x+1=(2::real))", "solveFor x", "solutions L"];
94 val (dI',pI',mI') = ("Test", ["sqroot-test", "univariate", "equation", "test"],
95 ["Test", "squ-equ-test-subpbl1"]);
96 val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
97 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
98 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
99 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
100 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
101 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
102 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
103 (*[], Met*)val (p,_,f,nxt,_,pt) = me nxt p [] pt; (*nxt = (_, Apply_Method ["Test", "squ-equ-test-subpbl1"])*);
104 (*[1], Frm*)val (p,_,f,nxt,_,pt) = me nxt p [] pt; (*nxt = ("Rewrite_Set", Rewrite_Set "norm_equation")*)
106 (*//------------------ begin step into ------------------------------------------------------\\*)
107 (*[1], Res*)val (p'''''_''',_,f,nxt'''''_''',_,pt'''''_''') = me nxt p [] pt; (*nxt = Rewrite_Set "Test_simplify"*)
109 "~~~~~ fun me , args:"; val (tac, p, _(*NEW remove*), pt) = (nxt, p, [], pt);
111 (** )val (***)xxxx(***) ( *("ok", (_, _, (pt, p))) =( **) (*case*)
112 Step.by_tactic tac (pt,p) (*of*);
113 "~~~~~ fun by_tactic , args:"; val (tac, (ptp as (pt, p))) = (tac, (pt,p));
114 val Applicable.Yes m = (*case*) Solve_Step.check tac (pt, p) (*of*);
115 (*if*) Tactic.for_specify' m; (*false*)
117 (** )val (***)xxxxx_x(***) ( *(msg, cs') =( **)
118 Step_Solve.by_tactic m ptp;
119 "~~~~~ fun by_tactic , args:"; val (m, (pt, po as (p, p_))) = (m, ptp);
120 (*+*)val (pt'''''_', (p'''''_', p_'''''_')) = (pt, (p, p_));
121 (*if*) MethodC.id_empty = get_obj g_metID pt (par_pblobj pt p); (*else*)
122 val thy' = get_obj g_domID pt (par_pblobj pt p);
123 val (is, sc) = LItool.resume_prog thy' (p,p_) pt;
125 locate_input_tactic sc (pt, po) (fst is) (snd is) m;
126 "~~~~~ fun locate_input_tactic , args:"; val (Prog prog, cstate, istate, ctxt, tac)
127 = (sc, (pt, po), (fst is), (snd is), m);
128 val srls = get_simplifier cstate;
130 (** )val Accept_Tac1 ((is as (_,_,_,_,_,strong_ass), ctxt, ss as((tac', _, ctree, pos', _) :: _))) =( **)
131 (*case*) scan_to_tactic1 (prog, (cstate, ctxt, tac)) istate (*of*);
132 "~~~~~ fun scan_to_tactic1 , args:"; val ((prog, (cctt as ((_, p), _, _))), (Istate.Pstate (ist as {path, ...})))
133 = ((prog, (cstate, ctxt, tac)), istate);
134 (*if*) path = [] orelse ((last_elem o fst) p = 0 andalso snd p = Res) (*then*);
136 (** )val xxxxx_xx = ( **)
137 scan_dn1 cctt (ist |> set_path [R] |> set_or ORundef) (Program.body_of prog);
138 "~~~~~ fun scan_dn1 , args:"; val (xxx, ist, (Const (\<^const_name>\<open>Let\<close>, _) $ e $ (Abs (id, T, b))))
139 = (cctt, (ist |> set_path [R] |> set_or ORundef), (Program.body_of prog));
141 (*case*) scan_dn1 xxx (ist |> path_down [L, R]) e (*of*);
142 "~~~~~ fun scan_dn1 , args:"; val ((xxx as (cstate, _, _)), ist, (Const (\<^const_name>\<open>Chain\<close>(*1*), _) $ e1 $ e2 $ a))
143 = (xxx, (ist |> path_down [L, R]), e);
145 (*case*) scan_dn1 xxx (ist |> path_down_form ([L, L, R], a)) e1 (*of*);
146 "~~~~~ fun scan_dn1 , args:"; val (xxx, ist, (Const (\<^const_name>\<open>Try\<close>(*2*), _) $ e))
147 = (xxx, (ist |> path_down_form ([L, L, R], a)), e1);
149 (*case*) scan_dn1 xxx (ist |> path_down [R]) e (*of*);
150 (*======= end of scanning tacticals, a leaf =======*)
151 "~~~~~ fun scan_dn1 , args:"; val (((pt, p), ctxt, tac), (ist as {env, eval, or, ...}), t)
152 = (xxx, (ist |> path_down [R]), e);
153 val (Program.Tac stac, a') =
154 (*case*) check_leaf "locate" ctxt eval (get_subst ist) t (*of*);
155 val LItool.Associated (m, v', ctxt) =
156 (*case*) associate pt ctxt (m, stac) (*of*);
158 Accept_Tac1 (ist |> set_subst_true (a', v'), ctxt, m) (*return value*);
159 "~~~~~ from scan_dn1 to scan_to_tactic1 return val:"; val (xxxxx_xx)
160 = (Accept_Tac1 (ist |> set_subst_true (a', v'), ctxt, m));
162 "~~~~~ from scan_to_tactic1 to fun locate_input_tactic return val:"; val Accept_Tac1 ((ist as {assoc, ...}), ctxt, tac')
163 = (Accept_Tac1 (ist |> set_subst_true (a', v'), ctxt, m));
164 (*if*) LibraryC.assoc (*then*);
166 Safe_Step (Istate.Pstate ist, ctxt, tac') (*return value*);
167 "~~~~~ from locate_input_tactic to fun Step_Solve.by_tactic return:"; val Safe_Step (istate, ctxt, tac)
168 = (*xxxxx_xx*)(**)Safe_Step (Istate.Pstate ist, ctxt, tac')(**);
170 (*+*)val (pt, po as (p, p_)) = (pt'''''_', (p'''''_', p_'''''_')); (* from begin of by_tactic *)
171 val (p'', _, _,pt') =
172 Step.add tac (istate, ctxt) (pt, (lev_on p, Pbl));
175 ("ok", ([(Tactic.input_from_T tac, tac, (p'', (istate, ctxt)))],
176 [(*ctree NOT cut*)], (pt', p''))) (*return value*);
177 "~~~~~ from Step_Solve.by_tactic \<longrightarrow> Step.by_tactic return:"; val ((msg, cs' : Calc.state_post))
178 = ("ok", ([(Tactic.input_from_T tac, tac, (p'', (istate, ctxt)) )],
179 [(*ctree NOT cut*)], (pt', p'')));
181 "~~~~~ from Step.by_tactic to me return:"; val (("ok", (_, _, (pt, p)))) = (*** )xxxx( ***) ("ok", cs');
183 (case Step.do_next p ((pt, Pos.e_pos'), []) of
184 ("ok", (ts as (_, _, _) :: _, _, _)) => ("", ts)
185 | ("helpless", _) => ("helpless: cannot propose tac", [])
186 | ("no-fmz-spec", _) => error "no-fmz-spec"
187 | ("end-of-calculation", (ts, _, _)) => ("", ts)
188 | _ => error "me: uncovered case")
189 handle ERROR msg => raise ERROR msg
192 tacis as (_::_) => let val (tac, _, _) = last_elem tacis in tac end
193 | _ => if p = ([], Pos.Res) then Tactic.End_Proof' else Tactic.Empty_Tac;
195 (p, [] : NEW, TESTg_form (pt, p), (Tactic.tac2IDstr tac, tac), Celem.Sundef, pt);
196 "~~~~~ from me to TOOPLEVEL return:"; val (p,_,f,nxt,_,pt)
197 = (*** )xxx( ***) (p, [] : NEW, TESTg_form (pt, p), (Tactic.tac2IDstr tac, tac), Celem.Sundef, pt);
199 (*//--------------------- check results from modified me ----------------------------------\\*)
200 if p = ([2], Res) andalso
201 pr_ctree pr_short pt = ". ----- pblobj -----\n1. x + 1 = 2\n2. x + 1 = 2\n"
203 (case nxt of ("Rewrite_Set", Rewrite_Set "Test_simplify") => ()
205 else error "check results from modified me CHANGED";
206 (*\\--------------------- check results from modified me ----------------------------------//*)
208 "~~~~~ from me to TOPLEVEL return:"; val (p,_,f,nxt,_,pt) = (*** )xxx( ***) (**)(p, 000, f, nxt, 000, pt)(**);
209 (*\\------------------ end step into --------------------------------------------------------//*)
211 (*[3], Res*)val (p,_,f,nxt,_,pt) = me nxt'''''_''' p'''''_''' [] pt'''''_'''; (*nxt = Subproblem ("Test", ["LINEAR", "univariate", "equation", "test"])*)
212 (*[3], Pbl*)val (p,_,f,nxt,_,pt) = me nxt p [] pt; (*nxt = Model_Problem*)
213 (*[3], Pbl*)val (p,_,f,nxt,_,pt) = me nxt p [] pt; (*nxt = Add_Given "equality (- 1 + x = 0)"*)
214 (*[3], Pbl*)val (p,_,f,nxt,_,pt) = me nxt p [] pt; (*nxt = Add_Given "solveFor x"*)
215 (*[3], Pbl*)val (p,_,f,nxt,_,pt) = me nxt p [] pt; (*nxt = Add_Find "solutions x_i"*)
216 (*[3], Pbl*)val (p,_,f,nxt,_,pt) = me nxt p [] pt; (*nxt = Specify_Theory "Test"*)
217 (*[3], Pbl*)val (p,_,f,nxt,_,pt) = me nxt p [] pt; (*nxt = Specify_Problem ["LINEAR", "univariate", "equation", "test"]*)
218 (*[3], Pbl*)val (p,_,f,nxt,_,pt) = me nxt p [] pt; (*nxt = Specify_Method ["Test", "solve_linear"]*)
219 (*[3], Met*)val (p,_,f,nxt,_,pt) = me nxt p [] pt; (*nxt = Apply_Method ["Test", "solve_linear"]*)
220 (*[3, 1], Frm*)val (p,_,f,nxt,_,pt) = me nxt p [] pt; (*nxt = Rewrite_Set_Inst (["(''bdv'', x)"], "isolate_bdv")*)
221 (*[3, 1], Res*)val (p,_,f,nxt,_,pt) = me nxt p [] pt; (*nxt = Rewrite_Set "Test_simplify"*)
222 (*[3, 2], Res*)val (p,_,f,nxt,_,pt) = me nxt p [] pt; (*nxt = Check_Postcond ["LINEAR", "univariate", "equation", "test"]*)
223 (*[3], Res*)val (p,_,f,nxt,_,pt) = me nxt p [] pt; (*nxt = Check_elementwise "Assumptions"*)
224 (*[4], Res*)val (p,_,f,nxt,_,pt) = me nxt p [] pt; (*nxt = Check_Postcond ["sqroot-test", "univariate", "equation", "test"]*)
225 (*[], Res*)val (p,_,f,nxt,_,pt) = me nxt p [] pt; (*nxt = End_Proof'*)
227 (*/--------------------- final test ----------------------------------\\*)
228 if p = ([], Res) andalso f2str f = "[x = 1]" andalso pr_ctree pr_short pt =
229 ". ----- pblobj -----\n" ^
231 "2. x + 1 + - 1 * 2 = 0\n" ^
232 "3. ----- pblobj -----\n" ^
233 "3.1. - 1 + x = 0\n" ^
234 "3.2. x = 0 + - 1 * - 1\n" ^
236 then case nxt of End_Proof' => () | _ => error "re-build: fun locate_input_tactic changed 1"
237 else error "re-build: fun locate_input_tactic changed 2";
240 "----------- fun locate_input_tactic Helpless, NOT applicable ----------------------------------";
241 "----------- fun locate_input_tactic Helpless, NOT applicable ----------------------------------";
242 "----------- fun locate_input_tactic Helpless, NOT applicable ----------------------------------";
243 (*cp from -- try fun applyTactics ------- *)
244 val (p,_,f,nxt,_,pt) = CalcTreeTEST [(["Term (5*e + 6*f - 8*g - 9 - 7*e - 4*f + 10*g + 12)",
246 ("PolyMinus",["plus_minus", "polynom", "vereinfachen"],
247 ["simplification", "for_polynomials", "with_minus"]))];
248 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
249 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
250 val (p,_,f,nxt,_,pt) = me nxt p [] pt; val (p,_,f,nxt,_,pt) = me nxt p [] pt;
251 (*[1], Frm*)val (p,_,f,nxt,_,pt) = me nxt p [] pt; (*nxt = Rewrite_Set "ordne_alphabetisch"*)
253 (*+*)val Test_Out.FormKF "5 * e + 6 * f - 8 * g - 9 - 7 * e - 4 * f + 10 * g + 12" = f
255 (*[1], Res*)val (p,_,f,nxt,_,pt) = me nxt p [] pt; (*nxt = Rewrite_Set "fasse_zusammen"*)
257 (*+*)if map Tactic.input_to_string (specific_from_prog pt p) =
258 ["Rewrite (\"subtrahiere_x_plus_minus\", \"\<lbrakk>?l is_num; ?m is_num\<rbrakk>\n\<Longrightarrow> ?x + ?m * ?v - ?l * ?v = ?x + (?m - ?l) * ?v\")",
259 "Rewrite (\"subtrahiere_x_minus_plus\", \"\<lbrakk>?l is_num; ?m is_num\<rbrakk>\n\<Longrightarrow> ?x - ?m * ?v + ?l * ?v = ?x + (- ?m + ?l) * ?v\")",
260 (*this is new since ThmC.numerals_to_Free.-----\\*)
262 then () else error "specific_from_prog ([1], Res) 1 CHANGED";
263 (*[2], Res*)val ("ok", (_, _, ptp as (pt, p))) = Step.by_tactic (hd (specific_from_prog pt p)) (pt, p);
265 (*+*)if map Tactic.input_to_string (specific_from_prog pt p) = [
266 "Rewrite (\"tausche_minus\", \"\<lbrakk>?b ist_monom; ?a kleiner ?b\<rbrakk>\n\<Longrightarrow> ?b - ?a = - ?a + ?b\")",
267 "Rewrite (\"subtrahiere_x_plus_minus\", \"\<lbrakk>?l is_num; ?m is_num\<rbrakk>\n\<Longrightarrow> ?x + ?m * ?v - ?l * ?v = ?x + (?m - ?l) * ?v\")",
268 "Rewrite (\"subtrahiere_x_minus_plus\", \"\<lbrakk>?l is_num; ?m is_num\<rbrakk>\n\<Longrightarrow> ?x - ?m * ?v + ?l * ?v = ?x + (- ?m + ?l) * ?v\")",
269 (*this is new since ThmC.numerals_to_Free.-----\\*)
271 (*this is new since ThmC.numerals_to_Free.-----//*)
273 then () else error "specific_from_prog ([1], Res) 2 CHANGED";
274 (* = ([3], Res)*)val ("ok", (_, _, ptp as (pt, p))) = Step.by_tactic (hd (specific_from_prog pt p)) (pt, p);
276 (*//----------------- exception PTREE "get_obj f EmptyPtree" raised --------------------------\\*)
277 (**)val ("ok", ([(Rewrite ("tausche_minus", _), _, _)], _, _)) = (*isa*)
278 Step.by_tactic (hd (specific_from_prog pt p)) (pt, p);
279 "~~~~~ fun by_tactic , args:"; val (tac, (ptp as (pt, p))) = (hd (specific_from_prog pt p), (pt, p));
280 val Applicable.Yes m = (*case*) Solve_Step.check tac (pt, p) (*of*);
281 (*if*) Tactic.for_specify' m; (*false*)
283 (**) val ("ok", ([(Rewrite ("tausche_minus", _), _, _)], _, _)) = (*isa*)
284 Step_Solve.by_tactic m (pt, p);
285 "~~~~~ fun by_tactic , args:"; val (m, (pt, po as (p, p_))) = (m, (pt, p));
286 (*if*) MethodC.id_empty = get_obj g_metID pt (par_pblobj pt p) (*else*);
287 val thy' = get_obj g_domID pt (par_pblobj pt p);
288 val (is, sc) = LItool.resume_prog thy' (p,p_) pt;
290 (*case*) locate_input_tactic sc (pt, po) (fst is) (snd is) m (*of*);
291 "~~~~~ fun locate_input_tactic , args:"; val ((Rule.Prog prog), (cstate as (pt, (*?*)pos(*?*))), istate, ctxt, tac)
292 = (sc, (pt, po), (fst is), (snd is), m);
293 val srls = LItool.get_simplifier cstate (*TODO: shift into Istate.T*);
295 (*case*) scan_to_tactic1 (prog, (cstate, ctxt, tac)) istate (*of*);
296 "~~~~~ fun scan_to_tactic1 , args:"; val ((prog, (cctt as ((_, p), _, _))), (Istate.Pstate (ist as {path, ...})))
297 = ((prog, (cstate, ctxt, tac)), istate);
298 (*if*) path = [] orelse ((last_elem o fst) p = 0 andalso snd p = Res) (*else*);
300 go_scan_up1 (prog, cctt) ist;
301 "~~~~~ fun go_scan_up1 , args:"; val ((pcct as (prog, _)), (ist as {path, ...}))
302 = ((prog, cctt), ist);
303 (*if*) 1 < length path (*then*);
305 scan_up1 pcct (ist |> path_up) (TermC.sub_at (path_up' path) prog);
306 "~~~~~ and scan_up1 , args:"; val (pcct, ist, (Const (\<^const_name>\<open>Try\<close>(*2*), _) $ _))
307 = (pcct, (ist |> path_up), (TermC.sub_at (path_up' path) prog));
309 go_scan_up1 pcct ist;
310 "~~~~~ and go_scan_up1 , args:"; val ((pcct as (prog, _)), (ist as {path, ...}))
312 (*if*) 1 < length path (*then*);
314 scan_up1 pcct (ist |> path_up) (TermC.sub_at (path_up' path) prog);
315 "~~~~~ and scan_up1 , args:"; val ((pcct as (prog, cct as (cstate, _, _))), ist,
316 (Const (\<^const_name>\<open>Chain\<close>(*3*), _) $ _ ))
317 = (pcct, (ist |> path_up), (TermC.sub_at (path_up' path) prog));
318 val e2 = check_Seq_up ist prog
320 (*case*) scan_dn1 cct (ist |> path_up_down [R] |> set_or ORundef) e2 (*of*);
321 "~~~~~ fun scan_dn1 , args:"; val (yyy, ist, (Const (\<^const_name>\<open>Chain\<close>(*2*), _) $ e1 $ e2))
322 = (cct, (ist |> path_up_down [R] |> set_or ORundef), e2);
324 (*case*) scan_dn1 cct (ist |> path_down [L, R]) e1 (*of*);
325 "~~~~~ fun scan_dn1 , args:"; val (xxx, ist, (Const (\<^const_name>\<open>Try\<close>(*2*), _) $ e))
326 = (cct, (ist |> path_down [L, R]), e1);
328 (*case*) scan_dn1 cct (ist |> path_down [R]) e (*of*);
329 (*======= end of scanning tacticals, a leaf =======*)
330 "~~~~~ fun scan_dn1 , args:"; val ((cct as (_, ctxt, _)), (ist as {eval, ...}), t)
331 = (cct, (ist |> path_down [R]), e);
332 (*if*) Tactical.contained_in t (*else*);
333 val (Program.Tac prog_tac, form_arg) = (*case*)
334 LItool.check_leaf "locate" ctxt eval (get_subst ist) t (*of*);
336 check_tac1 cct ist (prog_tac, form_arg);
337 "~~~~~ fun check_tac1 , args:"; val (((pt, p), ctxt, tac), (ist as {act_arg, or, ...}), (prog_tac, form_arg)) =
338 (cct, ist, (prog_tac, form_arg));
339 val LItool.Not_Associated = (*case*)
340 LItool.associate pt ctxt (tac, prog_tac) (*of*);
341 val _(*ORundef*) = (*case*) or (*of*);
343 (*+*)Solve_Step.check (LItool.tac_from_prog pt (ThyC.get_theory "Isac_Knowledge") prog_tac) (pt, p);
345 val Applicable.Yes m' =
346 (*case*) Solve_Step.check (LItool.tac_from_prog pt (ThyC.get_theory "Isac_Knowledge") prog_tac) (pt, p) (*of*);
348 Reject_Tac1 (ist |> set_subst_false (form_arg, Tactic.result m'), ctxt, tac)
349 (*return from check_tac1*);
350 "~~~~~ from fun check_tac1 \<longrightarrow>fun scan_dn1 \<longrightarrow>fun scan_dn1 \<longrightarrow>fun locate_input_tactic , return:"; val (Reject_Tac1 _) =
351 (Reject_Tac1 (ist |> set_subst_false (form_arg, Tactic.result m'), ctxt, tac));
353 val Test_Out.FormKF "- 9 + 12 + 5 * e - 7 * e + 6 * f - 4 * f - 8 * g + 10 * g" = f;
357 "----------- re-build: fun find_next_step, mini ------------------------------------------------";
358 "----------- re-build: fun find_next_step, mini ------------------------------------------------";
359 "----------- re-build: fun find_next_step, mini ------------------------------------------------";
360 val fmz = ["Term (a + a ::real)", "normalform n_n"];
361 val (dI',pI',mI') = ("Poly",["polynomial", "simplification"],["simplification", "for_polynomials"]);
362 val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
363 (*[], Pbl*)val (_, ([(tac, _, _)], _, (pt, p))) = Step.do_next p ((pt, Pos.e_pos'), []);(*Model_Problem*)
364 (*[], Pbl*)val (_, ([(tac, _, _)], _, (pt, p))) = Step.do_next p ((pt, Pos.e_pos'), []);(*Specify_Theory "Poly"*)
365 (*[], Pbl*)val (_, ([(tac, _, _)], _, (pt, p))) = Step.do_next p ((pt, Pos.e_pos'), []);(*Specify_Problem ["polynomial", "simplification"]*)
366 (*[], Met*)val (_, ([(tac, _, _)], _, (pt, p))) = Step.do_next p ((pt, e_pos'), []);(*Specify_Method ["simplification", "for_polynomials"]*)
367 (*1], Frm*)val (_, ([(tac, _, _)], _, (pt, p))) = Step.do_next p ((pt, e_pos'), []);(*Apply_Method ["simplification", "for_polynomials"]*)
368 (*[1], Res*)val (_, ([(tac'''''_', _, _)], _, (pt'''''_', p'''''_'))) =
370 Step.do_next p ((pt, e_pos'), []);(*Rewrite_Set "norm_Poly"*)
371 (*//------------------ go into 1 ------------------------------------------------------------\\*)
372 "~~~~~ fun do_next , args:"; val ((ip as (_, p_)), (ptp as (pt, p), tacis))
373 = (p, ((pt, e_pos'), []));
374 val pIopt = Ctree.get_pblID (pt, ip);
375 (*if*) ip = ([], Res) (*else*);
376 val _ = (*case*) tacis (*of*);
377 val SOME _ = (*case*) pIopt (*of*);
378 (*if*) member op = [Pos.Pbl, Pos.Met] p_ (*else*);
380 val ("ok", ([(Rewrite_Set "norm_Poly", _, _)], _, (_, ([1], Res)))) =
381 Step_Solve.do_next (pt, ip);
382 "~~~~~ and do_next , args:"; val (ptp as (pt, pos as (p, p_))) = (pt, ip);
383 (*if*) MethodC.id_empty = get_obj g_metID pt (par_pblobj pt p) (*else*);
384 val thy' = get_obj g_domID pt (par_pblobj pt p);
385 val ((ist, ctxt), sc) = LItool.resume_prog thy' (p,p_) pt;
387 val Next_Step (_, _, Rewrite_Set' ("Poly", _, Rule_Set.Sequence {id = "norm_Poly", ...}, _, _)) =
388 LI.find_next_step sc (pt, pos) ist ctxt (*of*);
389 "~~~~~ fun find_next_step , args:"; val ((Rule.Prog prog), (ptp as(pt, (p, _))), (Pstate ist), ctxt)
390 = (sc, (pt, pos), ist, ctxt);
392 val Accept_Tac (Rewrite_Set' ("Poly", _, Rule_Set.Sequence {id = "norm_Poly", ...}, _, _), _, _) =
393 (*case*) scan_to_tactic (prog, (ptp, ctxt)) (Pstate ist) (*of*);
394 "~~~~~ fun scan_to_tactic , args:"; val ((prog, cc), (Pstate (ist as {path, ...})))
395 = ((prog, (ptp, ctxt)), (Pstate ist));
396 (*if*) path = [] (*then*);
398 val Accept_Tac (Rewrite_Set' ("Poly", _, Rule_Set.Sequence {id = "norm_Poly", ...}, _, _), _, _) =
399 scan_dn cc (trans_scan_dn ist) (Program.body_of prog);
400 "~~~~~ fun scan_dn , args:"; val ((cc as (_, ctxt)), (ist as {eval, ...}), t)
401 = (cc, (trans_scan_dn ist), (Program.body_of prog));
402 (*if*) Tactical.contained_in t (*else*);
403 val (Program.Tac prog_tac, form_arg) = (*case*) LItool.check_leaf "next " ctxt eval (get_subst ist) t (*of*);
405 val Accept_Tac (Rewrite_Set' ("Poly", _, Rule_Set.Sequence {id = "norm_Poly", ...}, _, _), _, _) =
406 check_tac cc ist (prog_tac, form_arg) (*return from xxx*);
407 "~~~~~ from fun scan_dn\<longrightarrow>fun scan_to_tactic\<longrightarrow>fun find_next_step, return:"; val (Accept_Tac (tac, ist, ctxt))
408 = (check_tac cc ist (prog_tac, form_arg));
410 Next_Step (Pstate ist, Tactic.insert_assumptions tac ctxt, tac) (*return from find_next_step*);
411 "~~~~~ from fun find_next_step\<longrightarrow>and do_next\<longrightarrow>fun zzz, return:"; val (Next_Step (ist, ctxt, tac))
412 = (Next_Step (Pstate ist, Tactic.insert_assumptions tac ctxt, tac));
414 LI.by_tactic tac (ist, Tactic.insert_assumptions tac ctxt) ptp (*return from and do_next*);
415 "~~~~~ from and do_next\<longrightarrow>fun do_next\<longrightarrow>toplevel, return:"; val (_, ([(tac''''', _, _)], _, (pt''''', p''''')))
416 = (LI.by_tactic tac (ist, Tactic.insert_assumptions tac ctxt) ptp);
417 (*\\------------------ end of go into 1 -----------------------------------------------------//*)
419 (*[], Res*)val (_, ([(tac''''', _, _)], _, (pt''''', p'''''))) =
421 Step.do_next p'''''_' ((pt'''''_', Pos.e_pos'), []);(* Check_Postcond ["polynomial", "simplification"]*)
422 (*//------------------ go into 2 ------------------------------------------------------------\\*)
423 "~~~~~ fun do_next , args:"; val ((ip as (_, p_)), (ptp as (pt, p), tacis))
424 = (p''''', ((pt''''', e_pos'), []));
425 val pIopt = Ctree.get_pblID (pt, ip);
426 (*if*) ip = ([], Res) (*else*);
427 val _ = (*case*) tacis (*of*);
428 val SOME _ = (*case*) pIopt (*of*);
429 (*if*) member op = [Pos.Pbl, Pos.Met] p_ (*else*);
431 val ("ok", ([(Check_Postcond ["polynomial", "simplification"], _, _)], _, (_, ([], Res)))) =
432 Step_Solve.do_next (pt, ip);
433 "~~~~~ and do_next , args:"; val (ptp as (pt, pos as (p, p_))) = (pt, ip);
434 (*if*) MethodC.id_empty = get_obj g_metID pt (par_pblobj pt p) (*else*);
435 val thy' = get_obj g_domID pt (par_pblobj pt p);
436 val ((ist, ctxt), sc) = LItool.resume_prog thy' (p,p_) pt;
438 (** )val End_Program (ist, tac) =
439 ( *case*) LI.find_next_step sc (pt, pos) ist ctxt (*of*);
440 "~~~~~ fun find_next_step , args:"; val ((Rule.Prog prog), (ptp as(pt, (p, _))), (Pstate ist), ctxt)
441 = (sc, (pt, pos), ist, ctxt);
443 (* val Term_Val (Const (\<^const_name>\<open>times\<close>, _) $ Free ("2", _) $ Free ("a", _))*)
444 (** )val Term_Val prog_result =
445 ( *case*) scan_to_tactic (prog, (ptp, ctxt)) (Pstate ist) (*of*);
446 "~~~~~ fun scan_to_tactic , args:"; val ((prog, cc), (Pstate (ist as {path, ...})))
447 = ((prog, (ptp, ctxt)), (Pstate ist));
448 (*if*) path = [] (*else*);
450 go_scan_up (prog, cc) (trans_scan_up ist |> set_found);
451 "~~~~~ fun go_scan_up , args:"; val ((pcc as (sc, _)), (ist as {path, act_arg, found_accept, ...}))
452 = ((prog, cc), (trans_scan_up ist(*|> set_found !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! *)));
453 (*if*) path = [R] (*then*);
454 (*if*) found_accept = true (*then*);
456 Term_Val act_arg (*return from go_scan_up*);
457 "~~~~~ from fun go_scan_up\<longrightarrow>fun scan_to_tactic, return:"; val (Term_Val prog_result) = (Term_Val act_arg);
459 Term_Val prog_result (*return from scan_to_tactic*);
460 "~~~~~ from fun scan_to_tactic\<longrightarrow>fun find_next_step, return:"; val (Term_Val prog_result) = (Term_Val prog_result);
461 val (true, p', _) = (*case*) parent_node pt p (*of*);
462 val (_, pblID, _) = get_obj g_spec pt p';
464 End_Program (Pstate ist, Tactic.Check_Postcond' (pblID, prog_result))
465 (*return from find_next_step*);
466 "~~~~~ from fun find_next_step\<longrightarrow>and do_next\<longrightarrow>fun zzz, return:"; val (End_Program (ist, tac))
467 = (End_Program (Pstate ist, Tactic.Check_Postcond' (pblID,prog_result)));
468 val _ = (*case*) tac (*of*);
470 val ("ok", ([(Check_Postcond ["polynomial", "simplification"], _, _)], _, (_, ([], Res))))
471 = LI.by_tactic tac (ist, ctxt) ptp (*return from and do_next*);
472 "~~~~~ from and do_next\<longrightarrow>top level, return:"; val (_, ([(tac''''', _, _)], _, (pt''''', p''''')))
473 = (LI.by_tactic tac (ist, ctxt) ptp);
474 (*\\------------------ end of go into 2 -----------------------------------------------------//*)
476 (*[], Und*)val (msg, ([], _, (pt, p))) = Step.do_next p''''' ((pt''''', Pos.e_pos'), []);(**)
478 Test_Tool.show_pt_tac pt; (*[
479 ([], Frm), Simplify (a + a)
480 . . . . . . . . . . Apply_Method ["simplification", "for_polynomials"],
482 . . . . . . . . . . Rewrite_Set "norm_Poly",
484 . . . . . . . . . . Check_Postcond ["polynomial", "simplification"],
487 (*/--- final test ---------------------------------------------------------------------------\\*)
488 val (res, asm) = (get_obj g_result pt (fst p));
489 if UnparseC.term res = "2 * a" andalso map UnparseC.term asm = []
490 andalso p = ([], Und) andalso msg = "end-of-calculation"
491 andalso pr_ctree pr_short pt = ". ----- pblobj -----\n1. a + a\n"
493 case tac''''' of Check_Postcond ["polynomial", "simplification"] => ()
494 | _ => error "re-build: fun find_next_step, mini 1"
495 else error "re-build: fun find_next_step, mini 2"
498 "----------- re-build: fun locate_input_term ---------------------------------------------------";
499 "----------- re-build: fun locate_input_term ---------------------------------------------------";
500 "----------- re-build: fun locate_input_term ---------------------------------------------------";
502 ----------- appendFormula: on Res + late deriv ------------------------------------------------*)
503 val fmz = ["equality (x+1=(2::real))", "solveFor x", "solutions L"];
504 val (dI',pI',mI') = ("Test", ["sqroot-test", "univariate", "equation", "test"],
505 ["Test", "squ-equ-test-subpbl1"]);
506 val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
507 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
508 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
509 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
510 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
511 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
512 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
513 (*[], Met*)val (p,_,f,nxt,_,pt) = me nxt p [] pt; (*Apply_Method ["Test", "squ-equ-test-subpbl1"]*);
515 (*[1], Frm*)val (p,_,f,nxt,_,pt) = me nxt p [] pt;(*Rewrite_Set "norm_equation"*)
516 (*+*)if f2str f = "x + 1 = 2" then () else error "locate_input_term at ([1], Frm) CHANGED";
518 (*[1], Res*)val (p,_,f,nxt,_,pt) = me nxt p [] pt;(*Rewrite_Set "Test_simplify"*)
519 (*+*)if f2str f = "x + 1 + - 1 * 2 = 0" then () else error "locate_input_term at ([1], Frm) CHANGED";
521 Test_Tool.show_pt_tac pt; (*[
522 ([], Frm), solve (x + 1 = 2, x)
523 . . . . . . . . . . Apply_Method ["Test", "squ-equ-test-subpbl1"],
524 ([1], Frm), x + 1 = 2
525 . . . . . . . . . . Rewrite_Set "norm_equation",
526 ([1], Res), x + 1 + - 1 * 2 = 0 ///Check_Postcond..ERROR*)
528 (*//---------- appendFormula 1 "x = 1" \<longrightarrow> Step_Solve.inform \<longrightarrow> LI.locate_input_term ----------\\*)
529 "~~~~~ fun appendFormula , args:"; val ((*cI, *) ifo: TermC.as_string) = ((**) "x = 1");
530 val cs = (*get_calc cI*) ((pt, p), [(*nxt, nxt_, (pos, (ist, ctxt))*)])
531 val pos = (*get_pos cI 1*) p
533 (*+*)val ptp''''' = (pt, p);
534 (*+*)if snd ptp''''' = ([1], Res) then () else error "old_cs changed";
535 (*+*)Test_Tool.show_pt_tac pt; (*[
536 (*+*)([], Frm), solve (x + 1 = 2, x)
537 (*+*). . . . . . . . . . Apply_Method ["Test", "squ-equ-test-subpbl1"],
538 (*+*)([1], Frm), x + 1 = 2
539 (*+*). . . . . . . . . . Rewrite_Set "norm_equation",
540 (*+*)([1], Res), x + 1 + - 1 * 2 = 0 ///Check_Postcond*)
542 val ("ok", cs' as (_, _, ptp')) =
543 (*case*) Step.do_next pos cs (*of*);
545 val ("ok", (_(*use in DG !!!*), [], ptp''''' as (pt''''', p'''''))) = (*case*)
546 Step_Solve.by_term ptp' (encode ifo) (*of*);
547 "~~~~~ fun Step_Solve.by_term , args:"; val ((pt, pos as (p, _)), istr)
548 = (ptp', (encode ifo));
550 (*case*) TermC.parseNEW (get_ctxt pt pos) istr (*of*);
551 val pos_pred = lev_back(*'*) pos
552 val f_pred = Ctree.get_curr_formula (pt, pos_pred);
553 val f_succ = Ctree.get_curr_formula (pt, pos);
554 (*if*) f_succ = f_in (*else*);
556 (*case*) CAS_Cmd.input f_in (*of*);
558 (*NEW*) LI.locate_input_term (pt, pos) f_in (*of*);
559 "~~~~~ fun locate_input_term , args:"; val ((pt, pos), tm) = ((pt, pos), f_in);
560 val pos_pred = Pos.lev_back' pos (*f_pred ---"step pos cs"---> f_succ in appendFormula*)
562 val ("ok", (_, _, cstate as (pt', pos'))) =
563 (*case*) compare_step ([], [], (pt, pos_pred)) tm (*of*);
566 Found_Step (cstate, get_istate_LI pt' pos', get_ctxt pt' pos') (*return from locate_input_term*);
568 (*NEW*) Found_Step cstate (*return from locate_input_term*);
569 (*LI.Found_Step ( *)cstate(*, _(*istate*), _)( *return from locate_input_term*);
570 "~~~~~ from fun locate_input_term\<longrightarrow>fun Step_Solve.by_term, return:"; val ("ok", (_(*use in DG !!!*), c, ptp as (_, p)))
571 = (("ok" , ([], [], cstate (* already contains istate, ctxt *))));
573 ("ok", ((*_ use in DG !!!,*) c, ptp(* as (_*), p))(*)*)(*return from Step_Solve.by_term*);
574 "~~~~~ from fun Step_Solve.by_term\<longrightarrow>(fun appendFormula)!toplevel, return:"; val ("ok", (_(*use in DG !!!*), [], ptp''''' as (pt''''', p''''')))
575 = ("ok", ([], [], ptp));
577 (*fun me requires nxt...*)
578 Step.do_next p''''' (ptp''''', []);
579 val ("ok", ([(nxt'''''_' as Check_Postcond ["LINEAR", "univariate", "equation", "test"], _, _)], _,
580 (pt'''''_', p'''''_'))) = Step.do_next p''''' (ptp''''', [])
581 (*\\---------- appendFormula 1 "x = 1" \<longrightarrow> Step_Solve.inform \<longrightarrow> LI.locate_input_term ----------//*)
583 (*//----- REPLACED BY appendFormula 1 "x = 1" \<longrightarrow> Step_Solve.inform \<longrightarrow> LI.locate_input_term -----\\* )
584 (*[2], Res*)val (p,_,f,nxt,_,pt) = me nxt p [] pt; (*nxt = Subproblem ("Test", ["LINEAR", "univariate", "equation", "test"])*)
585 (*[3], Pbl*)val (p,_,f,nxt,_,pt) = me nxt p [] pt; (*nxt = Model_Problem*)
586 (*[3], Pbl*)val (p,_,f,nxt,_,pt) = me nxt p [] pt; (*nxt = Add_Given "equality (- 1 + x = 0)"*)
587 (*[3], Pbl*)val (p,_,f,nxt,_,pt) = me nxt p [] pt; (*nxt = Add_Given "solveFor x"*)
588 (*[3], Pbl*)val (p,_,f,nxt,_,pt) = me nxt p [] pt; (*nxt = Add_Find "solutions x_i"*)
589 (*[3], Pbl*)val (p,_,f,nxt,_,pt) = me nxt p [] pt; (*nxt = Specify_Theory "Test"*)
590 (*[3], Pbl*)val (p,_,f,nxt,_,pt) = me nxt p [] pt; (*nxt = Specify_Problem ["LINEAR", "univariate", "equation", "test"]*)
591 (*[3], Pbl*)val (p,_,f,nxt,_,pt) = me nxt p [] pt; (*nxt = Specify_Method ["Test", "solve_linear"]*)
592 (*[3], Met*)val (p,_,f,nxt,_,pt) = me nxt p [] pt; (*nxt = Apply_Method ["Test", "solve_linear"]*)
593 (*[3, 1], Frm*)val (p,_,f,nxt,_,pt) = me nxt p [] pt; (*nxt = Rewrite_Set_Inst (["(''bdv'', x)"], "isolate_bdv")*)
594 (*[3, 1], Res*)val (p,_,f,nxt,_,pt) = me nxt p [] pt; (*nxt = Rewrite_Set "Test_simplify"*)
595 (*[3, 2], Res*)val (p,_,f,nxt,_,pt) = me nxt p [] pt; (*nxt = Check_Postcond ["LINEAR", "univariate", "equation", "test"]*)
596 ( *\\----- REPLACED BY appendFormula 1 "x = 1" \<longrightarrow> Step_Solve.inform \<longrightarrow> LI.locate_input_term -----//*)
598 (*[3], Res*)val (p,_,f,nxt,_,pt) = me nxt'''''_' p'''''_' [] pt'''''_'; (*nxt = Check_elementwise "Assumptions"*)
599 (*[4], Res*)val (p,_,f,nxt,_,pt) = me nxt p [] pt; (*nxt = Check_Postcond ["sqroot-test", "univariate", "equation", "test"]*)
600 (*[], Res*)val (p,_,f,nxt,_,pt) = me nxt p [] pt; (*nxt = End_Proof'*)
602 (*/--- final test ---------------------------------------------------------------------------\\*)
603 if p = ([], Res) andalso f2str f = "[x = 1]" andalso pr_ctree pr_short pt =
604 ". ----- pblobj -----\n" ^
606 "2. x + 1 + - 1 * 2 = 0\n" ^
607 "3. ----- pblobj -----\n" ^
608 "3.1. - 1 + x = 0\n" ^
609 "3.2. x = 0 + - 1 * - 1\n" ^
610 "3.2.1. x = 0 + - 1 * - 1\n" ^
611 "3.2.2. x = 0 + 1\n" (*ATTENTION: see complete Calc below*)
612 then case nxt of End_Proof' => () | _ => error "re-build: fun locate_input_term CHANGED 1"
613 else error "re-build: fun locate_input_term CHANGED 2";
615 Test_Tool.show_pt_tac pt; (*[
616 ([], Frm), solve (x + 1 = 2, x)
617 . . . . . . . . . . Apply_Method ["Test", "squ-equ-test-subpbl1"],
618 ([1], Frm), x + 1 = 2
619 . . . . . . . . . . Rewrite_Set "norm_equation",
620 ([1], Res), x + 1 + - 1 * 2 = 0
621 . . . . . . . . . . Rewrite_Set "Test_simplify",
622 ([2], Res), - 1 + x = 0
623 . . . . . . . . . . Subproblem (Test, ["LINEAR", "univariate", "equation", "test"]),
624 ([3], Pbl), solve (- 1 + x = 0, x)
625 . . . . . . . . . . Apply_Method ["Test", "solve_linear"],
626 ([3,1], Frm), - 1 + x = 0
627 . . . . . . . . . . Rewrite_Set_Inst ([(''bdv'', x)], "isolate_bdv"),
628 ([3,1], Res), x = 0 + - 1 * - 1
629 . . . . . . . . . . Derive Test_simplify,
630 ([3,2,1], Frm), x = 0 + - 1 * - 1
631 . . . . . . . . . . Rewrite ("#: - 1 * - 1 = 1", "- 1 * - 1 = 1"),
632 ([3,2,1], Res), x = 0 + 1
633 . . . . . . . . . . Rewrite ("radd_0", "0 + ?k = ?k"),
634 ([3,2,2], Res), x = 1
635 . . . . . . . . . . Tactic.input_to_string not impl. for ?!,
637 . . . . . . . . . . Check_Postcond ["LINEAR", "univariate", "equation", "test"],
639 . . . . . . . . . . Check_Postcond ["sqroot-test", "univariate", "equation", "test"],
640 ([], Res), [x = 1]]*)