1 (* Title: tests on inform.sml
2 Author: Walther Neuper 060225,
3 (c) due to copyright terms
5 use"../smltest/ME/inform.sml";
9 "-----------------------------------------------------------------";
10 "table of contents -----------------------------------------------";
11 "-----------------------------------------------------------------";
12 "appendForm with miniscript with mini-subpbl:";
13 "--------- appendFormula: on Res + equ_nrls ----------------------";
14 "--------- appendFormula: on Frm + equ_nrls ----------------------";
15 "--------- appendFormula: on Res + NO deriv ----------------------";
16 "--------- appendFormula: on Res + late deriv --------------------";
17 "--------- appendFormula: on Res + late deriv [x = 3 + -2]---///--";
18 "replaceForm with miniscript with mini-subpbl:";
19 "--------- replaceFormula: on Res + = ----------------------------";
20 "--------- replaceFormula: on Res + = 1st Nd ---------------------";
21 "--------- replaceFormula: on Frm + = 1st Nd ---------------------";
22 "--------- replaceFormula: cut calculation -----------------------";
23 "--------- replaceFormula: cut calculation -----------------------";
24 (* 040307 copied from informtest.sml ... old versions
25 "--------- maximum-example, UC: Modeling / modifyCalcHead --------";*)
26 "--------- syntax error ------------------------------------------";
28 "--------- CAS-command on ([],Pbl) -------------------------------";
29 "--------- CAS-command on ([],Pbl) FE-interface ------------------";
30 "--------- inform [rational,simplification] ----------------------";
31 "--------- Take as 1st tac, start with <NEW> (CAS input) ---------";
32 "--------- Take as 1st tac, start from exp -----------------------";
33 "--------- init_form, start with <NEW> (CAS input) ---------------";
34 "--------- build fun check_err_patt ------------------------------";
35 "--------- build fun check_err_patt ?bdv -------------------------";
36 "--------- build fun check_error_patterns ------------------------";
37 "--------- embed fun check_error_patterns ------------------------";
38 "--------- build fun get_fillpats --------------------------------";
39 "--------- embed fun find_fillpatterns ---------------------------";
40 "--------- build fun is_exactly_equal, inputFillFormula ----------";
41 "-----------------------------------------------------------------";
42 "-----------------------------------------------------------------";
43 "-----------------------------------------------------------------";
46 "--------- appendFormula: on Res + equ_nrls ----------------------";
47 "--------- appendFormula: on Res + equ_nrls ----------------------";
48 "--------- appendFormula: on Res + equ_nrls ----------------------";
49 val Prog sc = (#scr o get_met) ["Test","squ-equ-test-subpbl1"];
50 (writeln o term2str) sc;
51 val Prog sc = (#scr o get_met) ["Test","solve_linear"];
52 (writeln o term2str) sc;
55 CalcTree [(["equality (x+1=(2::real))", "solveFor x","solutions L"],
56 ("Test", ["sqroot-test","univariate","equation","test"],
57 ["Test","squ-equ-test-subpbl1"]))];
58 Iterator 1; moveActiveRoot 1;
59 autoCalculate 1 CompleteCalcHead;
60 autoCalculate 1 (Step 1); refFormula 1 (get_pos 1 1);(*x + 1 = 2*)
61 autoCalculate 1 (Step 1); refFormula 1 (get_pos 1 1);(*x + 1 + -1 * 2 = 0*);
63 appendFormula 1 "-2 * 1 + (1 + x) = 0" (*|> Future.join*); refFormula 1 (get_pos 1 1);
64 val ((pt,_),_) = get_calc 1;
65 val str = pr_ptree pr_short pt;
67 (". ----- pblobj -----\n" ^
69 "2. x + 1 + -1 * 2 = 0\n" ^
70 "2.1. x + 1 + -1 * 2 = 0\n" ^
71 "2.2. 1 + x + -1 * 2 = 0\n" ^
72 "2.3. 1 + (x + -1 * 2) = 0\n" ^
73 "2.4. 1 + (x + -2) = 0\n" ^
74 "2.5. 1 + (x + -2 * 1) = 0\n" ^
75 "2.6. 1 + x + -2 * 1 = 0\n" ) then ()
76 else error "inform.sml: diff.behav.appendFormula: on Res + equ 1";
78 moveDown 1 ([ ],Pbl); refFormula 1 ([1],Frm); (*x + 1 = 2*)
79 moveDown 1 ([1],Frm); refFormula 1 ([1],Res); (*x + 1 + -1 * 2 = 0*)
81 (*the seven steps of detailed derivation*)
82 moveDown 1 ([1 ],Res); refFormula 1 ([2,1],Frm);
83 moveDown 1 ([2,1],Frm); refFormula 1 ([2,1],Res);
84 moveDown 1 ([2,1],Res); refFormula 1 ([2,2],Res);
85 moveDown 1 ([2,2],Res); refFormula 1 ([2,3],Res);
86 moveDown 1 ([2,3],Res); refFormula 1 ([2,4],Res);
87 moveDown 1 ([2,4],Res); refFormula 1 ([2,5],Res);
88 moveDown 1 ([2,5],Res); refFormula 1 ([2,6],Res);
89 val ((pt,_),_) = get_calc 1;
90 if "-2 * 1 + (1 + x) = 0" = term2str (fst (get_obj g_result pt [2,6])) then()
91 else error "inform.sml: diff.behav.appendFormula: on Res + equ 2";
93 fetchProposedTactic 1; (*takes Iterator 1 _1_*)
94 (* <ERROR> error in kernel </ERROR> ALREADY IN 2009-2*)
95 (*========== inhibit exn WN1130701 broken at Isabelle2002 --> 2009-2 =============
96 val (_,(tac,_,_)::_) = get_calc 1;
97 if tac = Rewrite_Set "Test_simplify" then ()
98 else error "inform.sml: diff.behav.appendFormula: on Res + equ 3";
99 ============ inhibit exn WN1130701 broken at Isabelle2002 --> 2009-2 ============*)
101 autoCalculate 1 CompleteCalc;
102 val ((pt,_),_) = get_calc 1;
103 if "[x = 1]" = term2str (fst (get_obj g_result pt [])) then ()
104 else error "inform.sml: diff.behav.appendFormula: on Res + equ 4";
105 (* autoCalculate 1 CompleteCalc;
106 val ((pt,p),_) = get_calc 1;
107 (writeln o istates2str) (get_obj g_loc pt [ ]);
108 (writeln o istates2str) (get_obj g_loc pt [1]);
109 (writeln o istates2str) (get_obj g_loc pt [2]);
110 (writeln o istates2str) (get_obj g_loc pt [3]);
111 (writeln o istates2str) (get_obj g_loc pt [3,1]);
112 (writeln o istates2str) (get_obj g_loc pt [3,2]);
113 (writeln o istates2str) (get_obj g_loc pt [4]);
116 "----------------------------------------------------------";
118 val fod = make_deriv (@{theory "Isac"}) Atools_erls
119 ((#rules o rep_rls) Test_simplify)
120 (sqrt_right false (@{theory "Pure"})) NONE
121 (str2term "x + 1 + -1 * 2 = 0");
122 (writeln o trtas2str) fod;
124 val ifod = make_deriv (@{theory "Isac"}) Atools_erls
125 ((#rules o rep_rls) Test_simplify)
126 (sqrt_right false (@{theory "Pure"})) NONE
127 (str2term "-2 * 1 + (1 + x) = 0");
128 (writeln o trtas2str) ifod;
129 fun equal (_,_,(t1, _)) (_,_,(t2, _)) = t1 = t2;
130 val (fod', rifod') = dropwhile' equal (rev fod) (rev ifod);
131 val der = fod' @ (map rev_deriv' rifod');
132 (writeln o trtas2str) der;
133 "----------------------------------------------------------";
136 "--------- appendFormula: on Frm + equ_nrls ----------------------";
137 "--------- appendFormula: on Frm + equ_nrls ----------------------";
138 "--------- appendFormula: on Frm + equ_nrls ----------------------";
140 CalcTree [(["equality (x+1=(2::real))", "solveFor x","solutions L"],
141 ("Test", ["sqroot-test","univariate","equation","test"],
142 ["Test","squ-equ-test-subpbl1"]))];
143 Iterator 1; moveActiveRoot 1;
144 autoCalculate 1 CompleteCalcHead;
145 autoCalculate 1 (Step 1); refFormula 1 (get_pos 1 1) (*x + 1 = 2*);
146 appendFormula 1 "2+ -1 + x = 2" (*|> Future.join*); refFormula 1 (get_pos 1 1);
148 moveDown 1 ([],Pbl); refFormula 1 ([1],Frm) (*x + 1 = 2*);
150 moveDown 1 ([1 ],Frm); refFormula 1 ([1,1],Frm);
151 moveDown 1 ([1,1],Frm); refFormula 1 ([1,1],Res);
152 moveDown 1 ([1,1],Res); refFormula 1 ([1,2],Res);
153 moveDown 1 ([1,2],Res); refFormula 1 ([1,3],Res);
154 moveDown 1 ([1,3],Res); refFormula 1 ([1,4],Res);
155 moveDown 1 ([1,4],Res); refFormula 1 ([1,5],Res);
156 moveDown 1 ([1,5],Res); refFormula 1 ([1,6],Res);
157 val ((pt,_),_) = get_calc 1;
158 if "2 + -1 + x = 2" = term2str (fst (get_obj g_result pt [1,6])) then()
159 else error "inform.sml: diff.behav.appendFormula: on Frm + equ 1";
161 fetchProposedTactic 1; (*takes Iterator 1 _1_*)
162 val (_,(tac,_,_)::_) = get_calc 1;
163 case tac of Rewrite_Set "norm_equation" => ()
164 | _ => error "inform.sml: diff.behav.appendFormula: on Frm + equ 2";
165 autoCalculate 1 CompleteCalc;
166 val ((pt,_),_) = get_calc 1;
167 if "[x = 1]" = term2str (fst (get_obj g_result pt [])) then ()
168 else error "inform.sml: diff.behav.appendFormula: on Frm + equ 3";
171 "--------- appendFormula: on Res + NO deriv ----------------------";
172 "--------- appendFormula: on Res + NO deriv ----------------------";
173 "--------- appendFormula: on Res + NO deriv ----------------------";
175 CalcTree [(["equality (x+1=(2::real))", "solveFor x","solutions L"],
176 ("Test", ["sqroot-test","univariate","equation","test"],
177 ["Test","squ-equ-test-subpbl1"]))];
178 Iterator 1; moveActiveRoot 1;
179 autoCalculate 1 CompleteCalcHead;
180 autoCalculate 1 (Step 1); refFormula 1 (get_pos 1 1);(*x + 1 = 2*)
181 autoCalculate 1 (Step 1); refFormula 1 (get_pos 1 1);(*x + 1 + -1 * 2 = 0*);
183 appendFormula 1 "x = 2" (*|> Future.join*);
184 val ((pt,p),_) = get_calc 1;
185 val str = pr_ptree pr_short pt;
187 if str = ". ----- pblobj -----\n1. x + 1 = 2\n" andalso p = ([1], Res)
189 else error "inform.sml: diff.behav.appendFormula: Res + NOder 1";
191 fetchProposedTactic 1;
192 val (_,(tac,_,_)::_) = get_calc 1;
193 case tac of Rewrite_Set "Test_simplify" => ()
194 | _ => error "inform.sml: diff.behav.appendFormula: Res + NOder 2";
195 autoCalculate 1 CompleteCalc;
196 val ((pt,_),_) = get_calc 1;
197 if "[x = 1]" = term2str (fst (get_obj g_result pt [])) then ()
198 else error "inform.sml: diff.behav.appendFormula: on Frm + equ 3";
201 "--------- appendFormula: on Res + late deriv --------------------";
202 "--------- appendFormula: on Res + late deriv --------------------";
203 "--------- appendFormula: on Res + late deriv --------------------";
205 CalcTree [(["equality (x+1=(2::real))", "solveFor x","solutions L"],
206 ("Test", ["sqroot-test","univariate","equation","test"],
207 ["Test","squ-equ-test-subpbl1"]))];
208 Iterator 1; moveActiveRoot 1;
209 autoCalculate 1 CompleteCalcHead;
210 autoCalculate 1 (Step 1); refFormula 1 (get_pos 1 1);(*x + 1 = 2*)
211 autoCalculate 1 (Step 1); refFormula 1 (get_pos 1 1);(*x + 1 + -1 * 2 = 0*);
213 appendFormula 1 "x = 1" (*|> Future.join*);
214 val ((pt,p),_) = get_calc 1;
215 val str = pr_ptree pr_short pt;
217 if str = ". ----- pblobj -----\n1. x + 1 = 2\n2. x + 1 + -1 * 2 = 0\n3. ----- pblobj -----\n3.1. -1 + x = 0\n3.2. x = 0 + -1 * -1\n3.2.1. x = 0 + -1 * -1\n3.2.2. x = 0 + 1\n" andalso p = ([3,2], Res)
218 then () (*finds 1 step too early: ([3,2], Res) "x = 1" also by script !!!*)
219 else error "inform.sml: diff.behav.appendFormula: Res + late d 1";
221 fetchProposedTactic 1;
222 val (_,(tac,_,_)::_) = get_calc 1;
223 case tac of Check_Postcond ["LINEAR", "univariate", "equation", "test"] => ()
224 | _ => error "inform.sml: diff.behav.appendFormula: Res + late d 2";
225 autoCalculate 1 CompleteCalc;
226 val ((pt,_),_) = get_calc 1;
227 if "[x = 1]" = term2str (fst (get_obj g_result pt [])) then ()
228 else error "inform.sml: diff.behav.appendFormula: Res + late d 3";
231 "--------- appendFormula: on Res + late deriv [x = 3 + -2]---///--";
232 "--------- appendFormula: on Res + late deriv [x = 3 + -2]---///--";
233 "--------- appendFormula: on Res + late deriv [x = 3 + -2]---///--";
235 CalcTree [(["equality (x+1=(2::real))", "solveFor x","solutions L"],
236 ("Test", ["sqroot-test","univariate","equation","test"],
237 ["Test","squ-equ-test-subpbl1"]))];
238 Iterator 1; moveActiveRoot 1;
239 autoCalculate 1 CompleteCalcHead;
240 autoCalculate 1 (Step 1); refFormula 1 (get_pos 1 1);(*x + 1 = 2*)
241 autoCalculate 1 (Step 1); refFormula 1 (get_pos 1 1);(*x + 1 + -1 * 2 = 0*);
242 appendFormula 1 "[x = 3 + -2*1]" (*|> Future.join*);
243 val ((pt,p),_) = get_calc 1;
244 val str = pr_ptree pr_short pt;
246 if str=". ----- pblobj -----\n1. x + 1 = 2\n2. x + 1 + -1 * 2 = 0\n3. ----- pblobj -----\n3.1. -1 + x = 0\n3.2. x = 0 + -1 * -1\n4. [x = 1]\n4.1. [x = 1]\n4.2. [x = -2 + 3]\n4.3. [x = 3 + -2]\n" then ()
247 else error "inform.sml: diff.behav.appendFormula: Res + latEE 1";
248 autoCalculate 1 CompleteCalc;
249 val ((pt,p),_) = get_calc 1;
250 if "[x = 3 + -2 * 1]" = term2str (fst (get_obj g_result pt [])) then ()
251 (* ~~~~~~~~~~ simplify as last step in any script ?!*)
252 else error "inform.sml: diff.behav.appendFormula: Res + latEE 2";
255 "--------- replaceFormula: on Res + = ----------------------------";
256 "--------- replaceFormula: on Res + = ----------------------------";
257 "--------- replaceFormula: on Res + = ----------------------------";
259 CalcTree [(["equality (x+1=(2::real))", "solveFor x","solutions L"],
260 ("Test", ["sqroot-test","univariate","equation","test"],
261 ["Test","squ-equ-test-subpbl1"]))];
262 Iterator 1; moveActiveRoot 1;
263 autoCalculate 1 CompleteCalcHead;
264 autoCalculate 1 (Step 1); refFormula 1 (get_pos 1 1);(*x + 1 = 2*)
265 autoCalculate 1 (Step 1); refFormula 1 (get_pos 1 1);(*x + 1 + -1 * 2 = 0*);
266 autoCalculate 1 (Step 1); refFormula 1 (get_pos 1 1);(*-1 + x*);
268 replaceFormula 1 "-2 * 1 + (1 + x) = 0"; refFormula 1 (get_pos 1 1);
269 val ((pt,_),_) = get_calc 1;
270 val str = pr_ptree pr_short pt;
272 (* before AK110725 this was
273 ". ----- pblobj -----\n
275 2. x + 1 + -1 * 2 = 0\n
276 2.1. x + 1 + -1 * 2 = 0\n
277 2.2. 1 + x + -1 * 2 = 0\n
278 2.3. 1 + (x + -1 * 2) = 0\n
279 2.4. 1 + (x + -2) = 0\n
280 2.5. 1 + (x + -2 * 1) = 0\n
281 2.6. 1 + x + -2 * 1 = 0\n";
284 ". ----- pblobj -----\n"^
286 "2. x + 1 + -1 * 2 = 0\n"^
287 "2.1. x + 1 + -1 * 2 = 0\n"^
288 "2.2. 1 + x + -1 * 2 = 0\n"^
289 "2.3. 1 + (x + -1 * 2) = 0\n"^
290 "2.4. 1 + (x + -2) = 0\n"^
291 "2.5. 1 + (x + -2 * 1) = 0\n"^
292 "2.6. 1 + x + -2 * 1 = 0\n" then()
293 else error "inform.sml: diff.behav.replaceFormula: on Res += 1";
295 autoCalculate 1 CompleteCalc;
296 val ((pt,pos as (p,_)),_) = get_calc 1;
297 if pos = ([],Res) andalso "[x = 1]" = (term2str o fst) (get_obj g_result pt p) then()
298 else error "inform.sml: diff.behav.replaceFormula: on Res + = 2";
301 "--------- replaceFormula: on Res + = 1st Nd ---------------------";
302 "--------- replaceFormula: on Res + = 1st Nd ---------------------";
303 "--------- replaceFormula: on Res + = 1st Nd ---------------------";
305 CalcTree [(["equality (x+1=(2::real))", "solveFor x","solutions L"],
306 ("Test", ["sqroot-test","univariate","equation","test"],
307 ["Test","squ-equ-test-subpbl1"]))];
308 Iterator 1; moveActiveRoot 1;
309 autoCalculate 1 CompleteCalcHead;
310 autoCalculate 1 (Step 1); refFormula 1 (get_pos 1 1);(*x + 1 = 2*)
311 autoCalculate 1 (Step 1); refFormula 1 (get_pos 1 1);(*x + 1 + -1 * 2 = 0*);
313 replaceFormula 1 "x + 1 = 4 + -2"; refFormula 1 (get_pos 1 1);
314 val ((pt,_),_) = get_calc 1;
315 val str = pr_ptree pr_short pt;
317 if str= ". ----- pblobj -----\n1. x + 1 = 2\n1.1. x + 1 = 2\n1.2. 1 + x = 2\n1.3. 1 + x = -2 + 4\n1.4. x + 1 = -2 + 4\n" then ()
318 else error "inform.sml: diff.behav.replaceFormula: on Res 1 + = 1";
319 autoCalculate 1 CompleteCalc;
320 val ((pt,pos as (p,_)),_) = get_calc 1;
321 if pos = ([],Res) andalso "[x = 1]" = (term2str o fst)(get_obj g_result pt p) then()
322 else error "inform.sml: diff.behav.replaceFormula: on Res + = 2";
325 "--------- replaceFormula: on Frm + = 1st Nd ---------------------";
326 "--------- replaceFormula: on Frm + = 1st Nd ---------------------";
327 "--------- replaceFormula: on Frm + = 1st Nd ---------------------";
329 CalcTree [(["equality (x+1=(2::real))", "solveFor x","solutions L"],
330 ("Test", ["sqroot-test","univariate","equation","test"],
331 ["Test","squ-equ-test-subpbl1"]))];
332 Iterator 1; moveActiveRoot 1;
333 autoCalculate 1 CompleteCalcHead;
334 autoCalculate 1 (Step 1); refFormula 1 (get_pos 1 1);(*x + 1 = 2*)
336 replaceFormula 1 "x + 1 = 4 + -2"; refFormula 1 (get_pos 1 1);
337 val ((pt,_),_) = get_calc 1;
338 val str = pr_ptree pr_short pt;
340 if str= ". ----- pblobj -----\n1. x + 1 = 2\n1.1. x + 1 = 2\n1.2. 1 + x = 2\n1.3. 1 + x = -2 + 4\n1.4. x + 1 = -2 + 4\n" then ()
341 else error "inform.sml: diff.behav.replaceFormula: on Frm 1 + = 1";
342 autoCalculate 1 CompleteCalc;
343 val ((pt,pos as (p,_)),_) = get_calc 1;
344 if pos = ([],Res) andalso "[x = 1]" = (term2str o fst)(get_obj g_result pt p) then()
345 else error "inform.sml: diff.behav.replaceFormula: on Frm 1 + = 2";
348 "--------- replaceFormula: cut calculation -----------------------";
349 "--------- replaceFormula: cut calculation -----------------------";
350 "--------- replaceFormula: cut calculation -----------------------";
352 CalcTree [(["equality (x+1=(2::real))", "solveFor x","solutions L"],
353 ("Test", ["sqroot-test","univariate","equation","test"],
354 ["Test","squ-equ-test-subpbl1"]))];
355 Iterator 1; moveActiveRoot 1;
356 autoCalculate 1 CompleteCalc;
357 moveActiveRoot 1; moveActiveDown 1;
358 if get_pos 1 1 = ([1], Frm) then ()
359 else error "inform.sml: diff.behav. cut calculation 1";
361 replaceFormula 1 "x + 1 = 4 + -2"; refFormula 1 (get_pos 1 1);
362 val ((pt,p),_) = get_calc 1;
363 val str = pr_ptree pr_short pt;
365 if p = ([1], Res) then ()
366 else error "inform.sml: diff.behav. cut calculation 2";
369 (* 040307 copied from informtest.sml; ... old version
370 "---------------- maximum-example, UC: Modeling / modifyCalcHead -";
371 "---------------- maximum-example, UC: Modeling / modifyCalcHead -";
372 "---------------- maximum-example, UC: Modeling / modifyCalcHead -";
375 val elems = ["fixedValues [r=Arbfix]","maximum A","valuesFor [a,b]",
376 "relations [A=a*b, (a/2)^^^2 + (b/2)^^^2 = r^^^2]",
377 "relations [A=a*b, (a/2)^^^2 + (b/2)^^^2 = r^^^2]",
378 "relations [A=a*b, a/2=r*sin alpha, b/2=r*cos alpha]",
379 (*^^^ these are the elements for the root-problem (in variants)*)
380 (*vvv these are elements required for subproblems*)
381 "boundVariable a","boundVariable b","boundVariable alpha",
382 "interval {x::real. 0 <= x & x <= 2*r}",
383 "interval {x::real. 0 <= x & x <= 2*r}",
384 "interval {x::real. 0 <= x & x <= pi}",
385 "errorBound (eps=(0::real))"]
386 (*specifying is not interesting for this example*)
387 val spec = ("DiffApp", ["maximum_of","function"],
388 ["DiffApp","max_by_calculus"]);
389 (*the empty model with descriptions for user-guidance by Model_Problem*)
390 val empty_model = [Given ["fixedValues []"],
391 Find ["maximum", "valuesFor"],
392 Relate ["relations []"]];
395 (*!!!!!!!!!!!!!!!!! DON'T USE me FOR FINDING nxt !!!!!!!!!!!!!!!!!!*)
396 val (p,_,f,nxt,_,pt) = CalcTreeTEST [(elems, spec)];
397 (*val nxt = ("Model_Problem", ...*)
398 val pbl = get_obj g_pbl pt (fst p); (writeln o (itms2str_ ctxt)) pbl;
400 val (p,_,f,nxt,_,pt) = me nxt p c pt;
401 (*nxt = Add_Given "fixedValues [r = Arbfix]"*)
402 val pbl = get_obj g_pbl pt (fst p); (writeln o (itms2str_ ctxt)) pbl;
404 (0 ,[] ,false ,#Given ,Inc fixedValues [] ,(??.empty, [])),
405 (0 ,[] ,false ,#Find ,Inc maximum ,(??.empty, [])),
406 (0 ,[] ,false ,#Find ,Inc valuesFor ,(??.empty, [])),
407 (0 ,[] ,false ,#Relate ,Inc relations [] ,(??.empty, []))]*)
409 (*the empty CalcHead is checked w.r.t the model and re-established as such*)
410 val (b,pt,ocalhd) = input_icalhd pt (p,"", empty_model, Pbl, e_spec);
411 val pbl = get_obj g_pbl pt (fst p); (writeln o (itms2str_ ctxt)) pbl;
412 if ocalhd2str ocalhd = "(Pbl, ??.empty, [\n(0 ,[] ,false ,#Given ,Inc fixedValues [] ,(??.empty, [])),\n(0 ,[] ,false ,#Find ,Inc maximum ,(??.empty, [])),\n(0 ,[] ,false ,#Find ,Inc valuesFor ,(??.empty, [])),\n(0 ,[] ,false ,#Relate ,Inc relations [] ,(??.empty, []))], [], \n(\"e_domID\", [\"e_pblID\"], [\"e_metID\"]) )" then () else error "informtest.sml: diff.behav. max 1";
414 (*there is one input to the model (could be more)*)
416 input_icalhd pt (p,"", [Given ["fixedValues [r=Arbfix]"],
417 Find ["maximum", "valuesFor"],
418 Relate ["relations"]], Pbl, e_spec);
419 val pbl = get_obj g_pbl pt (fst p); (writeln o (itms2str_ ctxt)) pbl;
420 if ocalhd2str ocalhd = "(Pbl, ??.empty, [\n(1 ,[1,2,3] ,true ,#Given ,Cor fixedValues [r = Arbfix] ,(fix_, [[r = Arbfix]])),\n(0 ,[] ,false ,#Find ,Inc maximum ,(??.empty, [])),\n(0 ,[] ,false ,#Find ,Inc valuesFor ,(??.empty, [])),\n(0 ,[] ,false ,#Relate ,Inc relations [] ,(??.empty, []))], [], \n(\"e_domID\", [\"e_pblID\"], [\"e_metID\"]) )" then ()
421 else error "informtest.sml: diff.behav. max 2";
423 (*this input is complete in variant 3, but the ME doesn't recognize FIXXXXME
424 val (b,pt''''',ocalhd) =
425 input_icalhd pt (p,"", [Given ["fixedValues [r=Arbfix]"],
426 Find ["maximum A", "valuesFor [a,b]"],
427 Relate ["relations [A=a*b, a/2=r*sin alpha, \
428 \b/2=r*cos alpha]"]], Pbl, e_spec);
429 val pbl = get_obj g_pbl pt''''' (fst p); (writeln o (itms2str_ ctxt)) pbl;
430 if ocalhd2str ocalhd = ------------^^^^^^^^^^ missing !!!*)
432 (*this input is complete in variant 1 (variant 3 does not work yet)*)
433 val (b,pt''''',ocalhd) =
434 input_icalhd pt (p,"", [Given ["fixedValues [r=Arbfix]"],
435 Find ["maximum A", "valuesFor [a,b]"],
436 Relate ["relations [A=a*b, \
437 \(a/2)^^^2 + (b/2)^^^2 = r^^^2]"]],
439 val pbl = get_obj g_pbl pt''''' (fst p); (writeln o (itms2str_ ctxt)) pbl;
441 modifycalcheadOK2xml 111 (bool2str b) ocalhd;
445 "--------- syntax error ------------------------------------------";
446 "--------- syntax error ------------------------------------------";
447 "--------- syntax error ------------------------------------------";
449 CalcTree [(["equality (x+1=(2::real))", "solveFor x","solutions L"],
450 ("Test", ["sqroot-test","univariate","equation","test"],
451 ["Test","squ-equ-test-subpbl1"]))];
452 Iterator 1; moveActiveRoot 1;
453 autoCalculate 1 CompleteCalcHead;
454 autoCalculate 1 (Step 1); refFormula 1 (get_pos 1 1);(*x + 1 = 2*)
455 autoCalculate 1 (Step 1); refFormula 1 (get_pos 1 1);(*x + 1 + -1 * 2 = 0*);
457 appendFormula 1 " x - "; (*<ERROR> syntax error in ' x - ' </ERROR>*)
458 val ((pt,_),_) = get_calc 1;
459 val str = pr_ptree pr_short pt;
461 if str = ". ----- pblobj -----\n1. x + 1 = 2\n" then ()
462 else error "inform.sml: diff.behav.appendFormula: syntax error";
465 "--------- CAS-command on ([],Pbl) -------------------------------";
466 "--------- CAS-command on ([],Pbl) -------------------------------";
467 "--------- CAS-command on ([],Pbl) -------------------------------";
468 val (p,_,f,nxt,_,pt) =
469 CalcTreeTEST [([], ("e_domID", ["e_pblID"], ["e_metID"]))];
470 val ifo = "solve(x+1=2,x)";
471 val (_,(_,c,(pt,p))) = inform ([],[],(pt,p)) "solve(x+1=2,x)";
473 val nxt = ("Apply_Method",Apply_Method ["Test","squ-equ-test-subpbl1"]);
474 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
475 if p = ([1], Frm) andalso f2str f = "x + 1 = 2" then ()
476 else error "inform.sml: diff.behav. CAScmd ([],Pbl)";
479 "--------- CAS-command on ([],Pbl) FE-interface ------------------";
480 "--------- CAS-command on ([],Pbl) FE-interface ------------------";
481 "--------- CAS-command on ([],Pbl) FE-interface ------------------";
483 CalcTree [([], ("e_domID", ["e_pblID"], ["e_metID"]))];
486 replaceFormula 1 "solve(x+1=2,x)";
487 autoCalculate 1 CompleteCalc;
488 val ((pt,p),_) = get_calc 1;
490 if p = ([], Res) then ()
491 else error "inform.sml: diff.behav. CAScmd ([],Pbl) FE-interface";
494 "--------- inform [rational,simplification] ----------------------";
495 "--------- inform [rational,simplification] ----------------------";
496 "--------- inform [rational,simplification] ----------------------";
498 CalcTree [(["Term (a * x / (b * x) + c * x / (d * x) + e / f)", "normalform N"],
499 ("Rational", ["rational", "simplification"], ["simplification", "of_rationals"]))];
500 Iterator 1; moveActiveRoot 1;
501 autoCalculate 1 CompleteCalcHead;
503 "--- (-1) give a preview on the calculation without any input";
505 autoCalculate 1 CompleteCalc;
506 val ((pt, p), _) = get_calc 1;
509 (([], Frm), Simplify (a * x / (b * x) + c * x / (d * x) + e / f)),
510 (([1], Frm), a * x / (b * x) + c * x / (d * x) + e / f),
511 (([1], Res), a / b + c / d + e / f), <--- (1) input arbitrary
512 (([2], Res), (b * d * e + b * c * f + a * d * f) / (b * d * f)),
513 (([3], Res), (a * (d * f) + b * (c * f) + b * (d * e)) / (b * (d * f))),
514 (([4], Res), (a * d * f + b * c * f + b * d * e) / (b * d * f)), <--- (2) input next
515 (([], Res), (a * d * f + b * c * f + b * d * e) / (b * d * f))] <--- (3) is also final result
518 "--- (0) user input as the *first* step does not work, thus impdo at least 1 step";
519 autoCalculate 1 (Step 1);
520 autoCalculate 1 (Step 1);
521 val ((pt, p), _) = get_calc 1;
524 (([], Frm), Simplify (a * x / (b * x) + c * x / (d * x) + e / f)),
525 (([1], Frm), a * x / (b * x) + c * x / (d * x) + e / f),
526 (([1], Res), a / b + c / d + e / f)]
528 "--- (1) input an arbitrary next formula";
529 appendFormula 1 "((a * d) + (c * b)) / (b * d) + e / f" (*|> Future.join*);
530 val ((pt, p), _) = get_calc 1;
533 (([], Frm), Simplify (a * x / (b * x) + c * x / (d * x) + e / f)),
534 (([1], Frm), a * x / (b * x) + c * x / (d * x) + e / f),
535 (([1], Res), a / b + c / d + e / f),
536 (([2,1], Frm), a / b + c / d + e / f),
537 (([2,1], Res), (b * d * e + b * c * f + a * d * f) / (b * d * f)),
538 (([2,2], Res), (a * d + c * b) / (b * d) + e / f),
539 (([2], Res), (a * d + c * b) / (b * d) + e / f)]
541 val ((pt,p),_) = get_calc 1;
542 if p = ([2], Res) andalso (length o children o (get_nd pt)) (fst p) = 2 then ()
543 else error ("inform.sml: [rational,simplification] 1");
545 "--- (2) input the next formula that would be presented by mat-engine";
546 (* generate a preview:
547 autoCalculate 1 (Step 1);
548 val ((pt, p), _) = get_calc 1;
551 (([], Frm), Simplify (a * x / (b * x) + c * x / (d * x) + e / f)),
552 (([1], Frm), a * x / (b * x) + c * x / (d * x) + e / f),
553 (([1], Res), a / b + c / d + e / f),
554 (([2,1], Frm), a / b + c / d + e / f),
555 (([2,1], Res), (b * d * e + b * c * f + a * d * f) / (b * d * f)),
556 (([2,2], Res), (a * d + c * b) / (b * d) + e / f),
557 (([2], Res), (a * d + c * b) / (b * d) + e / f),
558 (([3], Res), (b * d * e + b * c * f + a * d * f) / (b * d * f))] <--- input this
560 appendFormula 1 "(b * d * e + b * c * f + a * d * f) / (b * d * f)" (*|> Future.join*);
561 val ((pt, p), _) = get_calc 1;
564 (([], Frm), Simplify (a * x / (b * x) + c * x / (d * x) + e / f)),
565 (([1], Frm), a * x / (b * x) + c * x / (d * x) + e / f),
566 (([1], Res), a / b + c / d + e / f),
567 (([2,1], Frm), a / b + c / d + e / f),
568 (([2,1], Res), (b * d * e + b * c * f + a * d * f) / (b * d * f)),
569 (([2,2], Res), (a * d + c * b) / (b * d) + e / f),
570 (([2], Res), (a * d + c * b) / (b * d) + e / f),
571 (([3], Res), (b * d * e + b * c * f + a * d * f) / (b * d * f))]
573 if p = ([3], Res) andalso (length o children o (get_nd pt)) (fst p) = 0 then ()
574 else error ("inform.sml: [rational,simplification] 2");
576 "--- (3) input the exact final result";
577 appendFormula 1 "(b * d * e + b * c * f + a * d * f) / (b * d * f)" (*|> Future.join*);
578 val ((pt, p), _) = get_calc 1;
581 (([], Frm), Simplify (a * x / (b * x) + c * x / (d * x) + e / f)),
582 (([1], Frm), a * x / (b * x) + c * x / (d * x) + e / f),
583 (([1], Res), a / b + c / d + e / f),
584 (([2,1], Frm), a / b + c / d + e / f),
585 (([2,1], Res), (b * d * e + b * c * f + a * d * f) / (b * d * f)),
586 (([2,2], Res), (a * d + c * b) / (b * d) + e / f),
587 (([2], Res), (a * d + c * b) / (b * d) + e / f),
588 (([3], Res), (b * d * e + b * c * f + a * d * f) / (b * d * f)),
589 (([4,1], Frm), (b * d * e + b * c * f + a * d * f) / (b * d * f)),
590 (([4,1], Res), (a * (d * f) + b * (c * f) + b * (d * e)) / (b * (d * f))),
591 (([4,2], Res), (b * d * e + b * c * f + a * d * f) / (b * d * f)),
592 (([4], Res), (b * d * e + b * c * f + a * d * f) / (b * d * f))]
594 if p = ([4], Res) andalso (length o children o (get_nd pt)) (fst p) = 2 then ()
595 else error ("inform.sml: [rational,simplification] 3");
597 "--- (4) finish the calculation + check the postcondition (in the future)";
598 autoCalculate 1 CompleteCalc;
599 val ((pt, p), _) = get_calc 1;
600 val (t, asm) = get_obj g_result pt [];
601 if term2str t = "(a * d * f + b * c * f + b * d * e) / (b * d * f)" andalso
602 terms2str asm = "[\"b * d * f ~= 0\",\"d ~= 0\",\"b ~= 0\"," ^
603 "\"a * x / (b * x) + c * x / (d * x) + e / f is_ratpolyexp\"]"
604 then () else error "inform [rational,simplification] changed at end";
607 (([], Frm), Simplify (a * x / (b * x) + c * x / (d * x) + e / f)),
608 (([1], Frm), a * x / (b * x) + c * x / (d * x) + e / f),
609 (([1], Res), a / b + c / d + e / f),
610 (([2,1], Frm), a / b + c / d + e / f),
611 (([2,1], Res), (b * d * e + b * c * f + a * d * f) / (b * d * f)),
612 (([2,2], Res), (a * d + c * b) / (b * d) + e / f),
613 (([2], Res), (a * d + c * b) / (b * d) + e / f),
614 (([3], Res), (b * d * e + b * c * f + a * d * f) / (b * d * f)),
615 (([4,1], Frm), (b * d * e + b * c * f + a * d * f) / (b * d * f)),
616 (([4,1], Res), (a * (d * f) + b * (c * f) + b * (d * e)) / (b * (d * f))),
617 (([4,2], Res), (b * d * e + b * c * f + a * d * f) / (b * d * f)),
618 (([4], Res), (b * d * e + b * c * f + a * d * f) / (b * d * f)),
619 (([5], Res), (a * (d * f) + b * (c * f) + b * (d * e)) / (b * (d * f))),
620 (([6], Res), (a * d * f + b * c * f + b * d * e) / (b * d * f)),
621 (([], Res), (a * d * f + b * c * f + b * d * e) / (b * d * f))]
625 "--------- Take as 1st tac, start with <NEW> (CAS input) ---------";
626 "--------- Take as 1st tac, start with <NEW> (CAS input) ---------";
627 "--------- Take as 1st tac, start with <NEW> (CAS input) ---------";
628 val t = str2term "Diff (x^^^2 + x + 1, x)";
629 case t of Const ("Diff.Diff", _) $ _ => ()
631 error "diff.sml behav.changed for CAS Diff (..., x)";
633 "-----------------------------------------------------------------";
634 (*1>*)reset_states ();
635 (*2>*)CalcTree [([], ("e_domID", ["e_pblID"], ["e_metID"]))];
636 (*3>*)Iterator 1;moveActiveRoot 1;
637 "----- here the Headline has been finished";
638 (*4>*)moveActiveFormula 1 ([],Pbl);
639 (*5>*)replaceFormula 1 "Diff (x^2 + x + 1, x)";
640 val ((pt,_),_) = get_calc 1;
641 val PblObj {probl, meth, spec, fmz, env, loc, ...} = get_obj I pt [];
643 val (SOME istate, NONE) = loc;
644 default_print_depth 5;
645 writeln"-----------------------------------------------------------";
647 writeln (itms2str_ ctxt probl);
648 writeln (itms2str_ ctxt meth);
649 writeln (istate2str (fst istate));
651 refFormula 1 ([],Pbl) (*--> correct CalcHead*);
652 (*081016 NOT necessary (but leave it in Java):*)
653 (*6>*)(*completeCalcHead*)autoCalculate 1 CompleteCalcHead;
654 "----- here the CalcHead has been completed --- ONCE MORE ?????";
656 (***difference II***)
657 val ((pt,p),_) = get_calc 1;
658 (*val p = ([], Pbl)*)
659 val PblObj {probl, meth, spec, fmz, env, loc, ...} = get_obj I pt [];
661 val (SOME istate, NONE) = loc;
662 default_print_depth 5; writeln (istate2str (fst istate)); default_print_depth 3;
665 ??.empty, Sundef, false)*)
666 default_print_depth 5; spec; default_print_depth 3;
668 ["derivative_of", "function"],
669 ["diff", "differentiate_on_R"]) : spec*)
670 writeln (itms2str_ ctxt probl);
672 (1 ,[1] ,true ,#Given ,Cor functionTerm (x ^^^ 2 + x + 1) ,(f_, [x ^^^ 2 + x + 1])),
673 (2 ,[1] ,true ,#Given ,Cor differentiateFor x ,(v_, [x])),
674 (3 ,[1] ,true ,#Find ,Cor derivative f_'_f ,(f_'_f, [f_'_f]))]*)
675 writeln (itms2str_ ctxt meth);
677 (1 ,[1] ,true ,#Given ,Cor functionTerm (x ^^^ 2 + x + 1) ,(f_, [x ^^^ 2 + x + 1])),
678 (2 ,[1] ,true ,#Given ,Cor differentiateFor x ,(v_, [x])),
679 (3 ,[1] ,true ,#Find ,Cor derivative f_'_f ,(f_'_f, [f_'_f]))]*)
680 writeln"-----------------------------------------------------------";
681 (*7>*)fetchProposedTactic 1 (*--> Apply_Method*);
682 (*WN081028 fixed <ERROR> helpless </ERROR> by inform returning ...(.,Met)*)
683 autoCalculate 1 CompleteCalc;
684 val ((pt,p),_) = get_calc 1;
685 val Form res = (#1 o pt_extract) (pt, ([],Res));
687 if p = ([], Res) andalso term2str res = "1 + 2 * x" then ()
688 else error "diff.sml behav.changed for Diff (x^2 + x + 1, x)";
691 "--------- Take as 1st tac, start from exp -----------------------";
692 "--------- Take as 1st tac, start from exp -----------------------";
693 "--------- Take as 1st tac, start from exp -----------------------";
694 (*the following input is copied from BridgeLog Java <==> SML,
695 omitting unnecessary inputs*)
696 (*1>*)reset_states ();
697 (*2>*)CalcTree [(["functionTerm (x^2 + x + 1)", "differentiateFor x", "derivative f_'_f"],("Isac",["derivative_of","function"],["diff","differentiate_on_R"]))];
698 (*3>*)Iterator 1; moveActiveRoot 1;
700 (*6>*)(*completeCalcHead*)autoCalculate 1 CompleteCalcHead;
701 (***difference II***)
702 val ((pt,_),_) = get_calc 1;
703 val PblObj {probl, meth, spec, fmz, env, loc, ...} = get_obj I pt [];
705 val (SOME istate, NONE) = loc;
706 default_print_depth 5; writeln (istate2str (fst istate)); default_print_depth 3;
709 ??.empty, Sundef, false)*)
710 default_print_depth 5; spec; default_print_depth 3;
712 ["derivative_of", "function"],
713 ["diff", "differentiate_on_R"]) : spec*)
714 writeln (itms2str_ ctxt probl);
716 (1 ,[1] ,true ,#Given ,Cor functionTerm (x ^^^ 2 + x + 1) ,(f_, [x ^^^ 2 + x + 1])),
717 (2 ,[1] ,true ,#Given ,Cor differentiateFor x ,(v_, [x])),
718 (3 ,[1] ,true ,#Find ,Cor derivative f_'_f ,(f_'_f, [f_'_f]))]*)
719 writeln (itms2str_ ctxt meth);
721 (1 ,[1] ,true ,#Given ,Cor functionTerm (x ^^^ 2 + x + 1) ,(f_, [x ^^^ 2 + x + 1])),
722 (2 ,[1] ,true ,#Given ,Cor differentiateFor x ,(v_, [x])),
723 (3 ,[1] ,true ,#Find ,Cor derivative f_'_f ,(f_'_f, [f_'_f]))]*)
724 writeln"-----------------------------------------------------------";
725 (*7>*)fetchProposedTactic 1 (*--> Apply_Method*);
726 autoCalculate 1 (Step 1);
727 val ((pt,p),_) = get_calc 1;
728 val Form res = (#1 o pt_extract) (pt, p);
729 if term2str res = "d_d x (x ^^^ 2 + x + 1)" then ()
730 else error "diff.sml Diff (x^2 + x + 1, x) from exp";
733 "--------- init_form, start with <NEW> (CAS input) ---------------";
734 "--------- init_form, start with <NEW> (CAS input) ---------------";
735 "--------- init_form, start with <NEW> (CAS input) ---------------";
737 CalcTree [([], ("e_domID", ["e_pblID"], ["e_metID"]))];
738 (*[[from sml: > @@@@@begin@@@@@
740 [[from sml: <CALCTREE>
741 [[from sml: <CALCID> 1 </CALCID>
742 [[from sml: </CALCTREE>
743 [[from sml: @@@@@end@@@@@*)
745 (*[[from sml: > @@@@@begin@@@@@
747 [[from sml: <ADDUSER>
748 [[from sml: <CALCID> 1 </CALCID>
749 [[from sml: <USERID> 1 </USERID>
750 [[from sml: </ADDUSER>
751 [[from sml: @@@@@end@@@@@*)
753 (*[[from sml: > @@@@@begin@@@@@
755 [[from sml: <CALCITERATOR>
756 [[from sml: <CALCID> 1 </CALCID>
757 [[from sml: <POSITION>
758 [[from sml: <INTLIST>
759 [[from sml: </INTLIST>
760 [[from sml: <POS> Pbl </POS>
761 [[from sml: </POSITION>
762 [[from sml: </CALCITERATOR>
763 [[from sml: @@@@@end@@@@@*)
764 getFormulaeFromTo 1 ([],Pbl) ([],Pbl) 0 false;
765 (*[[from sml: > @@@@@begin@@@@@ STILL CORRECT
767 [[from sml: <GETELEMENTSFROMTO>
768 [[from sml: <CALCID> 1 </CALCID>
769 [[from sml: <FORMHEADS>
770 [[from sml: <CALCFORMULA>
771 [[from sml: <POSITION>
772 [[from sml: <INTLIST>
773 [[from sml: </INTLIST>
774 [[from sml: <POS> Pbl </POS>
775 [[from sml: </POSITION>
776 [[from sml: <FORMULA>
778 [[from sml: <ISA> ________________________________________________ </ISA>
779 [[from sml: </MATHML>
781 [[from sml: </FORMULA>
782 [[from sml: </CALCFORMULA>
783 [[from sml: </FORMHEADS>
784 [[from sml: </GETELEMENTSFROMTO>
785 [[from sml: @@@@@end@@@@@*)
786 refFormula 1 ([],Pbl);
787 (*[[from sml: > @@@@@begin@@@@@ STILL CORRECT
789 [[from sml: <REFFORMULA>
790 [[from sml: <CALCID> 1 </CALCID>
791 [[from sml: <CALCHEAD status = "incorrect">
792 [[from sml: <POSITION>
793 [[from sml: <INTLIST>
794 [[from sml: </INTLIST>
795 [[from sml: <POS> Pbl </POS>
796 [[from sml: </POSITION>
799 [[from sml: <ISA> Problem (e_domID, [e_pblID]) </ISA>
800 [[from sml: </MATHML>
803 [[from sml: <GIVEN> </GIVEN>
804 [[from sml: <WHERE> </WHERE>
805 [[from sml: <FIND> </FIND>
806 [[from sml: <RELATE> </RELATE>
808 [[from sml: <BELONGSTO> Pbl </BELONGSTO>
809 [[from sml: <SPECIFICATION>
810 [[from sml: <THEORYID> e_domID </THEORYID>
811 [[from sml: <PROBLEMID>
812 [[from sml: <STRINGLIST>
813 [[from sml: <STRING> e_pblID </STRING>
814 [[from sml: </STRINGLIST>
815 [[from sml: </PROBLEMID>
816 [[from sml: <METHODID>
817 [[from sml: <STRINGLIST>
818 [[from sml: <STRING> e_metID </STRING>
819 [[from sml: </STRINGLIST>
820 [[from sml: </METHODID>
821 [[from sml: </SPECIFICATION>
822 [[from sml: </CALCHEAD>
823 [[from sml: </REFFORMULA>
824 [[from sml: @@@@@end@@@@@*)
825 moveActiveFormula 1 ([],Pbl);
826 (*[[from sml: > @@@@@begin@@@@@
828 [[from sml: <CALCITERATOR>
829 [[from sml: <CALCID> 1 </CALCID>
830 [[from sml: <POSITION>
831 [[from sml: <INTLIST>
832 [[from sml: </INTLIST>
833 [[from sml: <POS> Pbl </POS>
834 [[from sml: </POSITION>
835 [[from sml: </CALCITERATOR>
836 [[from sml: @@@@@end@@@@@*)
837 replaceFormula 1 "Simplify (1+2)";
838 (*[[from sml: > @@@@@begin@@@@@
840 [[from sml: <REPLACEFORMULA>
841 [[from sml: <CALCID> 1 </CALCID>
842 [[from sml: <CALCCHANGED>
843 [[from sml: <UNCHANGED>
844 [[from sml: <INTLIST>
845 [[from sml: </INTLIST>
846 [[from sml: <POS> Pbl </POS>
847 [[from sml: </UNCHANGED>
848 [[from sml: <DELETED>
849 [[from sml: <INTLIST>
850 [[from sml: </INTLIST>
851 [[from sml: <POS> Pbl </POS>
852 [[from sml: </DELETED>
853 [[from sml: <GENERATED>
854 [[from sml: <INTLIST>
855 [[from sml: </INTLIST>
856 [[from sml: <POS> Met </POS> DIFFERENCE: Pbl
857 [[from sml: </GENERATED>
858 [[from sml: </CALCCHANGED>
859 [[from sml: </REPLACEFORMULA>
860 [[from sml: @@@@@end@@@@@*)
861 getFormulaeFromTo 1 ([],Pbl) ([],Pbl) 0 false(* DIFFERENCE: Pbl*);
875 <ISA> Simplify (1 + 2) </ISA> WORKS !!!!!
882 getFormulaeFromTo 1 ([],Pbl) ([],Met) 0 false;
883 (*[[from sml: > @@@@@begin@@@@@
885 [[from sml: <SYSERROR>
886 [[from sml: <CALCID> 1 </CALCID>
887 [[from sml: <ERROR> error in getFormulaeFromTo </ERROR>
888 [[from sml: </SYSERROR>
889 [[from sml: @@@@@end@@@@@*)
890 (*step into getFormulaeFromTo --- bug corrected...*)
892 "--------- build fun check_err_patt ------------------------------";
893 "--------- build fun check_err_patt ------------------------------";
894 "--------- build fun check_err_patt ------------------------------";
895 val subst = [(str2term "bdv", str2term "x")]: subst;
896 val rls = norm_Rational
897 val pat = parse_patt @{theory} "(?a + ?b)/(?b + ?c) = ?a / ?c";
898 val (res, inf) = (str2term "(2 + 3)/(3 + 4)", str2term "2 / 4");
899 val (res, inf) = (str2term "(2 + 3)/(3 + 4)", str2term "1 / 2");
901 val (res', _, _, rewritten) = (*rewritten: the lhs of the pattern matches in res*)
902 rew_sub thy 1 [] e_rew_ord e_rls false [] (Trueprop $ pat) res;
903 if rewritten then NONE else SOME "e_errpatID";
905 val norm_res = case rewrite_set_ (Isac()) false rls res' of
907 | SOME (norm_res, _) => norm_res
909 val norm_inf = case rewrite_set_ (Isac()) false rls inf of
911 | SOME (norm_inf, _) => norm_inf;
916 val pat = parse_patt @{theory} "(?a + ?b)/?a = ?b";
917 val (res, inf) = (str2term "(2 + 3)/2", str2term "3");
918 if check_err_patt (res, inf) subst ("errpatID", pat) rls = SOME "errpatID"
919 then () else error "error patt example1 changed";
921 val pat = parse_patt @{theory} "(?a + ?b)/(?a + ?c) = ?b / ?c";
922 val (res, inf) = (str2term "(2 + 3)/(2 + 4)", str2term "3 / 4");
923 if check_err_patt (res, inf) subst ("errpatID", pat) rls = SOME "errpatID"
924 then () else error "error patt example2 changed";
926 val pat = parse_patt @{theory} "(?a + ?b)/(?b + ?c) = ?a / ?c";
927 val (res, inf) = (str2term "(2 + 3)/(3 + 4)", str2term "2 / 4");
928 if check_err_patt (res, inf) subst ("errpatID", pat) rls = SOME "errpatID"
929 then () else error "error patt example3 changed";
931 val inf = str2term "1 / 2";
932 if check_err_patt (res, inf) subst ("errpatID", pat) rls = SOME "errpatID"
933 then () else error "error patt example3 changed";
935 "--------- build fun check_err_patt ?bdv -------------------------";
936 "--------- build fun check_err_patt ?bdv -------------------------";
937 "--------- build fun check_err_patt ?bdv -------------------------";
938 val subst = [(str2term "bdv", str2term "x")]: subst;
939 val t = str2term "d_d x (x ^^^ 2 + sin (x ^^^ 4))";
940 val SOME (t, _) = rewrite_set_inst_ thy false subst norm_diff t;
941 if term2str t = "2 * x + cos (x ^^^ 4) * 4 * x ^^^ 3" then ()
942 else error "build fun check_err_patt ?bdv changed 1";
945 val pat = parse_patt @{theory} "d_d ?bdv (sin ?u) = cos (d_d ?bdv ?u)";
946 val (res, inf) = (str2term "2 * x + d_d x (sin (x ^^^ 4))", str2term "2 * x + cos (4 * x ^^^ 3)");
948 val (res', _, _, rewritten) = (*rewritten: the lhs of the pattern matches in res*)
949 rew_sub thy 1 subst e_rew_ord e_rls false [] (Trueprop $ pat) res;
950 if term2str res' = "2 * x + cos (d_d x (x ^^^ 4))" andalso rewritten then ()
951 else error "build fun check_err_patt ?bdv changed 2";
953 val norm_res = case rewrite_set_inst_ (Isac()) false subst rls res' of
955 | SOME (norm_res, _) => norm_res;
956 if term2str norm_res = "2 * x + cos (4 * x ^^^ 3)" then ()
957 else error "build fun check_err_patt ?bdv changed 3";
959 val norm_inf = case rewrite_set_inst_ (Isac()) false subst rls inf of
961 | SOME (norm_inf, _) => norm_inf;
962 if term2str norm_inf = "2 * x + cos (4 * x ^^^ 3)" then ()
963 else error "build fun check_err_patt ?bdv changed 4";
966 if norm_res = norm_inf then ()
967 else error "build fun check_err_patt ?bdv changed 5";
969 if check_err_patt (res, inf) (subst: subst) ("errpatID": errpatID, pat) rls = SOME "errpatID"
970 then () else error "error patt example1 changed";
972 "--------- build fun check_error_patterns ------------------------";
973 "--------- build fun check_error_patterns ------------------------";
974 "--------- build fun check_error_patterns ------------------------";
976 (str2term "d_d x (x ^^^ 2) + d_d x (sin (x ^^^ 4))",
977 str2term "d_d x (x ^^^ 2) + cos (4 * x ^^^ 3)");
978 val {errpats, nrls = rls, scr = Prog prog, ...} = get_met ["diff", "differentiate_on_R"]
980 val env = [(str2term "v_v", str2term "x")];
982 [e_errpat, (*generalised for testing*)
983 ("chain-rule-diff-both",
984 [parse_patt @{theory} "d_d ?bdv (sin ?u) = cos (d_d ?bdv ?u)",
985 parse_patt @{theory} "d_d ?bdv (cos ?u) = - sin (d_d ?bdv ?u)",
986 parse_patt @{theory} "d_d ?bdv (?u ^^^ ?n) = ?n * ?u ^^^ (?n - 1)",
987 parse_patt @{theory} "d_d ?bdv (LogExp.ln ?u) = 1 / ?u",
988 parse_patt @{theory} "d_d ?bdv (LogExp.ln ?u) = 1 / d_d ?bdv ?u"],
989 [@{thm diff_sin_chain}, @{thm diff_cos_chain}, @{thm diff_pow_chain},
990 @{thm diff_ln_chain}, @{thm diff_exp_chain}])]: errpat list;
991 case check_error_patterns (res, inf) (prog, env) (errpats, rls) of SOME _ => ()
992 | NONE => error "check_error_patterns broken";
995 "--------- embed fun check_error_patterns ------------------------";
996 "--------- embed fun check_error_patterns ------------------------";
997 "--------- embed fun check_error_patterns ------------------------";
1000 [(["functionTerm (x ^ 2 + sin (x ^ 4))", "differentiateFor x", "derivative f_f'"],
1001 ("Isac", ["derivative_of","function"], ["diff","differentiate_on_R"]))];
1004 autoCalculate 1 CompleteCalcHead;
1005 autoCalculate 1 (Step 1);
1006 autoCalculate 1 (Step 1);(*([1], Res), d_d x (x ^^^ 2) + d_d x (sin (x ^^^ 4))*)
1007 (*autoCalculate 1 (Step 1);([2], Res), d_d x (x ^^^ 2) + cos (x ^^^ 4) * d_d x (x ^^^ 4)*)
1009 "~~~~~ fun appendFormula, args:"; val (cI, (ifo:cterm')) = (1, "d_d x (x ^ 2) + cos (4 * x ^ 3)");
1010 val cs = get_calc cI
1011 val pos as (_,p_) = get_pos cI 1; (*pos = ([1], Res)*)
1016 val (_, _, (pt, ([2], Res))) = cs';
1018 [(([], Frm), Diff (x ^^^ 2 + sin (x ^^^ 4), x)),
1019 (([1], Frm), d_d x (x ^^^ 2 + sin (x ^^^ 4))),
1020 (([1], Res), d_d x (x ^^^ 2) + d_d x (sin (x ^^^ 4))), <<=== input follos: "...+ cos(4.x^3)"
1021 (([2], Res), d_d x (x ^^^ 2) + cos (x ^^^ 4) * d_d x (x ^^^ 4))] *)
1023 "~~~~~ fun inform, args:"; val ((cs as (_, _, ptp as (pt, pos as (p, p_))): calcstate'), istr) =
1024 (cs', (encode ifo));
1025 val SOME f_in = parse (assoc_thy "Isac") istr
1026 val f_in = Thm.term_of f_in
1027 val pos_pred = lev_back' pos
1028 (* f_pred ---"step pos cs"---> f_succ in appendFormula
1029 TODO.WN120517: one starting point for redesign of pos' *)
1030 val (f_pred, f_succ) = (get_curr_formula (pt, pos_pred), get_curr_formula (pt, pos));
1032 term2str f_pred = "d_d x (x ^^^ 2) + d_d x (sin (x ^^^ 4))";
1033 term2str f_succ = "d_d x (x ^^^ 2) + cos (x ^^^ 4) * d_d x (x ^^^ 4)";
1035 f_succ = f_in; (* = false*)
1036 cas_input f_in; (* = NONE*)
1037 val msg_calcstate' = compare_step ([], [], (pt, pos_pred)) f_in
1038 val ("no derivation found", calcstate') = msg_calcstate';
1039 val pp = par_pblobj pt p
1040 val {errpats, nrls, scr = Prog prog, ...} = get_met (get_obj g_metID pt pp)
1041 val ScrState (env, _, _, _, _, _) = get_istate pt pos;
1042 case check_error_patterns (f_pred, f_in) (prog, env) (errpats, nrls) of
1043 SOME errpatID => ("error pattern #" ^ errpatID ^ "#", calcstate')
1044 | NONE => msg_calcstate';
1046 "~~~~~ from inform return val:"; val () = ();
1047 case check_error_patterns (f_pred, f_in) (prog, env) (errpats, nrls) of
1049 | NONE => error "check_error_patterns broken";
1052 case inform cs' (encode ifo) of
1053 ("error pattern #chain-rule-diff-both#", calcstate') => ()
1054 | _ => error "inform with (positive) check_error_patterns broken"
1056 "--------- build fun get_fillpats --------------------------------";
1057 "--------- build fun get_fillpats --------------------------------";
1058 "--------- build fun get_fillpats --------------------------------";
1059 (*cause for this test was: wrong thy in Build_Thydata.thy in
1060 insert_fillpats ["IsacKnowledge", "Diff", "Theorems", "diff_sin_chain"]*)
1061 val f_curr = str2term "d_d x (x ^^^ 2) + d_d x (sin (x ^^^ 4))"
1062 val errpatID = "chain-rule-diff-both"
1063 val {errpats, scr = Prog prog, ...} = get_met ["diff", "differentiate_on_R"]
1065 [(str2term "f_f", str2term "x ^^^ 2 + sin (x ^^^ 4)"),
1066 (str2term "v_v", str2term "x"),
1067 (str2term "f_f'", str2term "d_d x (x ^^^ 2 + sin (x ^^^ 4))")]
1068 val subst = get_bdv_subst prog env
1069 val errpatthms = errpats
1070 |> filter ((curry op = errpatID) o (#1: errpat -> errpatID))
1071 |> map (#3: errpat -> thm list)
1073 "~~~~~ fun get_fillpats, args:"; val (subst, form, errpatID, thm) =
1074 (subst, f_curr, errpatID, hd (*simulate beginning of "map"*) errpatthms);
1075 val thmDeriv = Thm.get_name_hint thm
1076 val (part, thyID) = thy_containing_thm thmDeriv
1077 val theID = [part, thyID, "Theorems", thmID_of_derivation_name thmDeriv]
1078 val Hthm {fillpats, ...} = get_the theID
1079 val some = map (get_fillform subst (thm, form) errpatID) fillpats;
1080 "~~~~~ fun get_fillform, args:";
1081 val ((subs_opt, subst), (thm, form), errpatID, (fillpatID, pat, erpaID)) =
1082 (subst, (thm, form), errpatID, hd (*simulate beginning of "map"*) fillpats);
1083 val (form', _, _, rewritten) =
1084 rew_sub (Isac()) 1 subst e_rew_ord e_rls false [] (Trueprop $ pat) form;
1085 "~~~~~ fun rew_sub, args:"; val (thy, i, bdv, tless, rls, put_asm, lrd:lrd list, r, t) =
1086 ((Isac()), 1, subst, e_rew_ord, e_rls, false, [], (Trueprop $ pat), form);
1087 val (lhs, rhs) = (HOLogic.dest_eq o HOLogic.dest_Trueprop
1088 o Logic.strip_imp_concl) r;
1089 (*/-------------catch the planned exception*)
1091 val r' = Envir.subst_term (Pattern.match thy (lhs, t)
1092 (Vartab.empty, Vartab.empty)) r;
1094 ) handle PATTERN (*because only a subterm matches*) => 111;
1095 case t of t1 $ t2 =>
1096 let val (t2', asm2, lrd, rew2) = rew_sub thy i bdv tless rls put_asm (lrd@[R]) r t2
1098 if rew2 then (t1 $ t2', asm2, lrd, true) else
1099 let val (t1', asm1, lrd, rew1) = rew_sub thy i bdv tless rls put_asm (lrd@[L]) r t1
1100 in if rew1 then (t1' $ t2, asm1, lrd, true) else (t1 $ t2,[], lrd, false) end
1102 (*catch the planned exception-------------/*)
1105 val (t2', asm2, lrd, rew2) = rew_sub thy i bdv tless rls put_asm (lrd@[R]) r t2;
1106 "~~~~~ fun rew_sub, args:"; val (thy, i, bdv, tless, rls, put_asm, lrd:lrd list, r, t) =
1107 (thy, i, bdv, tless, rls, put_asm, (lrd@[R]), r, t2);
1108 val (lhs, rhs) = (HOLogic.dest_eq o HOLogic.dest_Trueprop o Logic.strip_imp_concl) r;
1109 val r' = Envir.subst_term (Pattern.match thy (lhs, t) (Vartab.empty, Vartab.empty)) r;
1110 val p' = map HOLogic.dest_Trueprop ((fst o Logic.strip_prems) (Logic.count_prems r', [], r'));
1111 val t' = (snd o HOLogic.dest_eq o HOLogic.dest_Trueprop o Logic.strip_imp_concl) r';
1112 if term2str t' = "cos (x ^^^ 4) * d_d x ?_dummy_1" then ()
1113 else error "get_fillpats changed 1"
1116 "--------- embed fun find_fillpatterns ---------------------------";
1117 "--------- embed fun find_fillpatterns ---------------------------";
1118 "--------- embed fun find_fillpatterns ---------------------------";
1121 [(["functionTerm (x ^ 2 + sin (x ^ 4))", "differentiateFor x", "derivative f_f'"],
1122 ("Isac", ["derivative_of","function"], ["diff","differentiate_on_R"]))];
1125 autoCalculate 1 CompleteCalcHead;
1126 autoCalculate 1 (Step 1);
1127 autoCalculate 1 (Step 1);(*([1], Res), d_d x (x ^^^ 2) + d_d x (sin (x ^^^ 4))*)
1128 appendFormula 1 "d_d x (x ^ 2) + cos (4 * x ^ 3)" (*|> Future.join*);
1129 (*<CALCMESSAGE> error pattern #chain-rule-diff-both# </CALCMESSAGE>*)
1131 <CALCMESSAGE> no derivation found </CALCMESSAGE>*)
1133 "~~~~~ fun findFillpatterns, args:"; val (cI, errpatID) = (1, "chain-rule-diff-both");
1134 val ((pt, _), _) = get_calc cI
1135 val pos = get_pos cI 1;
1136 "~~~~~ fun find_fillpatterns, args:"; val ((pt, pos as (p, _)), errpatID) = ((pt, pos), errpatID);
1137 val f_curr = get_curr_formula (pt, pos); (* = "d_d x (x ^^^ 2) + d_d x (sin (x ^^^ 4))"*)
1138 val pp = par_pblobj pt p
1139 val {errpats, scr = Prog prog, ...} = get_met (get_obj g_metID pt pp)
1140 val ScrState (env, _, _, _, _, _) = get_istate pt pos
1141 val subst = get_bdv_subst prog env
1142 val errpatthms = errpats
1143 |> filter ((curry op = errpatID) o (#1: errpat -> errpatID))
1144 |> map (#3: errpat -> thm list)
1147 case map (get_fillpats subst f_curr errpatID) errpatthms |> flat of
1148 ("fill-d_d-arg", tm, thm, subs_opt) :: _ => if term2str tm =
1149 "d_d x (x ^^^ 2) + d_d x (sin (x ^^^ 4)) =\nd_d x (x ^^^ 2) + cos (x ^^^ 4) * d_d x ?_dummy_1"
1150 then () else error "find_fillpatterns changed 1a"
1151 | _ => error "find_fillpatterns changed 1b"
1153 "~~~~~ fun get_fillpats, args:"; val (subst, form, errpatID, thm) =
1154 (subst, f_curr, errpatID, hd (*simulate beginning of "map"*) errpatthms);
1155 val thmDeriv = Thm.get_name_hint thm
1156 val (part, thyID) = thy_containing_thm thmDeriv
1157 val theID = [part, thyID, "Theorems", thmID_of_derivation_name thmDeriv]
1158 val Hthm {fillpats, ...} = get_the theID
1159 val some = map (get_fillform subst (thm, form) errpatID) fillpats;
1161 case some |> filter is_some |> map the of
1162 ("fill-d_d-arg", tm, thm, subsopt) :: _ => if term2str tm =
1163 "d_d x (x ^^^ 2) + d_d x (sin (x ^^^ 4)) =\nd_d x (x ^^^ 2) + cos (x ^^^ 4) * d_d x ?_dummy_1"
1164 then () else error "find_fillpatterns changed 2a"
1165 | _ => error "find_fillpatterns changed 2b"
1167 "~~~~~ fun get_fillform, args:";
1168 val ((subs_opt, subst), (thm, form), errpatID, (fillpatID, pat, erpaID)) =
1169 (subst, (thm, form), errpatID, hd (*simulate beginning of "map"*) fillpats);
1170 val (form', _, _, rewritten) =
1171 rew_sub (Isac()) 1 subst e_rew_ord e_rls false [] (Trueprop $ pat) form;
1173 if term2str form' = "d_d x (x ^^^ 2) + cos (x ^^^ 4) * d_d x ?_dummy_1" then ()
1174 else error "find_fillpatterns changed 3";
1176 "~~~~~ to findFillpatterns return val:"; val (fillpats) =
1177 (map (get_fillpats (subs_opt, subst) f_curr errpatID) errpatthms |> flat) (*only from "hd errpatthms"*);
1179 "vvv--- dropped this code WN120730";
1180 val msg = "fill patterns " ^
1181 ((map ((apsnd term2str) o quad2pair) fillpats) |> map pair2str_ |> strs2str_);
1183 "fill patterns #fill-d_d-arg#d_d x (x ^^^ 2) + d_d x (sin (x ^^^ 4))" ^
1184 " =\nd_d x (x ^^^ 2) + cos (x ^^^ 4) * d_d x ?_dummy_1" ^
1185 "#fill-both-args#d_d x (x ^^^ 2) + d_d x (sin (x ^^^ 4))" ^
1186 " =\nd_d x (x ^^^ 2) + cos ?_dummy_2 * d_d x ?_dummy_3" ^
1187 "#fill-d_d#d_d x (x ^^^ 2) + d_d x (sin (x ^^^ 4))" ^
1188 " =\nd_d x (x ^^^ 2) + cos (x ^^^ 4) * ?_dummy_1 x (x ^^^ 4)" ^
1189 "#fill-inner-deriv#d_d x (x ^^^ 2) + d_d x (sin (x ^^^ 4))" ^
1190 " =\nd_d x (x ^^^ 2) + cos (x ^^^ 4) * ?_dummy_1" ^
1191 "#fill-all#d_d x (x ^^^ 2) + d_d x (sin (x ^^^ 4)) = d_d x (x ^^^ 2) + ?_dummy_1#";
1192 "^^^--- dropped this code WN120730";
1194 if (map #1 fillpats) =
1195 ["fill-d_d-arg", "fill-both-args", "fill-d_d", "fill-inner-deriv", "fill-all"]
1196 then () else error "find_fillpatterns changed 4b";
1199 "--------- build fun is_exactly_equal, inputFillFormula ----------";
1200 "--------- build fun is_exactly_equal, inputFillFormula ----------";
1201 "--------- build fun is_exactly_equal, inputFillFormula ----------";
1204 [(["functionTerm (x ^ 2 + sin (x ^ 4))", "differentiateFor x", "derivative f_f'"],
1205 ("Isac", ["derivative_of","function"], ["diff","differentiate_on_R"]))];
1208 autoCalculate 1 CompleteCalcHead;
1209 autoCalculate 1 (Step 1);
1210 autoCalculate 1 (Step 1);(*([1], Res), d_d x (x ^^^ 2) + d_d x (sin (x ^^^ 4))*)
1211 appendFormula 1 "d_d x (x ^ 2) + cos (4 * x ^ 3)" (*|> Future.join*); (*<<<<<<<=========================*)
1212 (* the check for errpat is maximally liberal (whole term modulo "nrls" from "type met"),
1213 would recognize "cos (4 * x ^ (4 - 1)) + 2 * x" as well.
1214 results in <CALCMESSAGE> error pattern #chain-rule-diff-both# </CALCMESSAGE>
1215 instead of <CALCMESSAGE> no derivation found </CALCMESSAGE> *)
1216 val ((pt,pos), _) = get_calc 1;
1217 val p = get_pos 1 1;
1218 val (Form f, _, asms) = pt_extract (pt, p);
1220 if p = ([1], Res) andalso term2str f = "d_d x (x ^^^ 2) + d_d x (sin (x ^^^ 4))" then
1221 case get_obj g_tac pt (fst p) of Rewrite_Inst (["(bdv, x)"],
1222 ("diff_sum", thm)) =>
1223 if (term2str o Thm.prop_of) thm = "d_d ?bdv (?u + ?v) = d_d ?bdv ?u + d_d ?bdv ?v" then ()
1224 else error "embed fun get_fillform changed 11"
1225 | _ => error "embed fun get_fillform changed 12"
1226 else error "embed fun get_fillform changed 13";
1228 findFillpatterns 1 "chain-rule-diff-both"; (*<<<<<<<=================================*)
1229 (*<CALCMESSAGE> fill patterns #fill-d_d-arg#d_d x (x ^^^ 2) + d_d x (sin (x ^^^ 4)) =
1230 d_d x (x ^^^ 2) + cos (x ^^^ 4) * d_d x ?_dummy_1#fill-both-args#...#...#... *)
1231 val ((pt,pos),_) = get_calc 1;
1232 val p = get_pos 1 1;
1234 val (Form f, _, asms) = pt_extract (pt, p);
1235 if p = ([1], Res) andalso term2str f = "d_d x (x ^^^ 2) + d_d x (sin (x ^^^ 4))" then
1236 case get_obj g_tac pt (fst p) of Rewrite_Inst (["(bdv, x)"],
1237 ("diff_sum", thm)) =>
1238 if (term2str o Thm.prop_of) thm = "d_d ?bdv (?u + ?v) = d_d ?bdv ?u + d_d ?bdv ?v" then ()
1239 else error "embed fun get_fillform changed 21"
1240 | _ => error "embed fun get_fillform changed 22"
1241 else error "embed fun get_fillform changed 23";
1243 requestFillformula 1 ("chain-rule-diff-both", "fill-both-args");(*<<<<<<<============*)
1244 (*<AUTOCALC> ([1], Res) ([2], Res) ([2], Res) </AUTOCALC>*)
1245 val ((pt,pos),_) = get_calc 1;
1246 val p = get_pos 1 1;
1247 val (Form f, _, asms) = pt_extract (pt, p);
1248 if p = ([1], Res) andalso existpt [2] pt
1249 andalso term2str f = "d_d x (x ^^^ 2) + d_d x (sin (x ^^^ 4))"
1250 then case get_obj g_tac pt (fst p) of Rewrite_Inst (["(bdv, x)"],
1251 ("diff_sum", thm)) =>
1252 if (term2str o Thm.prop_of) thm = "d_d ?bdv (?u + ?v) = d_d ?bdv ?u + d_d ?bdv ?v" then ()
1253 else error "embed fun get_fillform changed 31"
1254 | _ => error "embed fun get_fillform changed 32"
1255 else error "embed fun get_fillform changed 33";
1257 (* input a formula which exactly fills the gaps in a "fillformula"
1258 presented to the learner immediately before by "requestFillformula (errpatID, fillpatID)":
1259 errpatID: lhs of the respective thm = lhs of fillformula with fillpatID.
1260 the respective thm is in the ctree ................
1262 "~~~~~ fun inputFillFormula, args:"; val (cI, ifo) =
1263 (1, "d_d x (x ^^^ 2) + cos (x ^^^ 4) * d_d x (x ^^^ 4)");
1264 val ((pt, _), _) = get_calc cI
1265 val pos = get_pos cI 1;
1267 "~~~~~ fun is_exactly_equal, args:"; val ((pt, pos as (p, p_)), istr) = ((pt, pos), ifo);
1268 val SOME ifo = parseNEW (assoc_thy "Isac" |> thy2ctxt) istr
1270 val tac = get_obj g_tac pt p';
1271 val Rewrite_Inst ([bbb as "(bdv, x)"], ("diff_sin_chain", ttt)) = tac;
1272 if (term2str o Thm.prop_of) ttt = "d_d ?bdv (sin ?u) = cos ?u * d_d ?bdv ?u" then ()
1273 else error "inputFillFormula changed 10";
1274 val Appl rew = applicable_in pos pt tac;
1275 val Rewrite_Inst' (_, _, _, _, _, _, _, (res, _)) = rew;
1277 "~~~~~ to inputFillFormula return val:"; val ("ok", tac) = ("ok", tac);
1278 val ("ok", (_, c, ptp as (_,p'))) = locatetac tac (pt, pos);
1279 upd_calc cI (ptp, []);
1281 autocalculateOK2xml cI pos (if null c then p' else last_elem c) p';
1283 "~~~~~ final check:";
1284 val ((pt, _),_) = get_calc 1;
1285 val p = get_pos 1 1;
1286 val (Form f, _, asms) = pt_extract (pt, p);
1287 if p = ([2], Res) andalso term2str f = "d_d x (x ^^^ 2) + cos (x ^^^ 4) * d_d x (x ^^^ 4)"
1288 then case get_obj g_tac pt (fst p) of Rewrite_Inst (["(bdv, x)"],
1289 ("diff_sin_chain", thm)) =>
1290 if (term2str o Thm.prop_of) thm = "d_d ?bdv (sin ?u) = cos ?u * d_d ?bdv ?u" then ()
1291 else error "inputFillFormula changed 111"
1292 | _ => error "inputFillFormula changed 112"
1293 else error "inputFillFormula changed 113";