1 (* tests for sml/ME/ctree.sml
2 authors: Walther Neuper 060113
3 (c) due to copyright terms
5 use"../smltest/ME/ctree.sml";
9 "-----------------------------------------------------------------";
10 "table of contents -----------------------------------------------";
11 "-----------------------------------------------------------------";
12 "-----------------------------------------------------------------";
13 "-------------- fun get_ctxt -------------------------------------";
14 "-------------- fun update_ctxt, fun g_ctxt ----------------------";
15 "-------------- check positions in miniscript --------------------";
16 "-------------- get_allpos' (from ptree above)--------------------";
17 (**#####################################################################(**)
18 "-------------- cut_level (from ptree above)----------------------";
19 "-------------- cut_tree (from ptree above)-----------------------";
20 "=====new ptree 1a miniscript with mini-subpbl ===================";
21 "-------------- cut_level ( ,Frm) on Incomplete Nd ---------------";
22 (**)#####################################################################**)
23 "=====new ptree 2 miniscript with mini-subpbl ====================";
24 "-------------- cut_tree (intermedi.ptree: 3rd level)-------------";
25 "-------------- cappend (from ptree above)------------------------";
26 "-------------- cappend minisubpbl -------------------------------";
28 "=====new ptree 3 ================================================";
29 "-------------- move_dn ------------------------------------------";
30 "-------------- move_dn: Frm -> Res ------------------------------";
31 "-------------- move_up ------------------------------------------";
32 "------ move into detail -----------------------------------------";
33 "=====new ptree 3a ===============================================";
34 "-------------- move_dn in Incomplete ctree ----------------------";
36 "=====new ptree 4: crooked by cut_level_'_ =======================";
37 (*############## development stopped 0501 ########################*)
38 (******************************************************************)
39 (* val SAVE_get_trace = get_trace; *)
40 (******************************************************************)
41 "-------------- get_interval from ctree: incremental development--";
42 (******************************************************************)
43 (* val get_trace = SAVE_get_trace; *)
44 (******************************************************************)
45 (*############## development stopped 0501 ########################*)
47 "=====new ptree 4 ratequation ====================================";
48 "-------------- pt_extract form, tac, asm<>[] --------------------";
49 "=====new ptree 5 minisubpbl =====================================";
50 "-------------- pt_extract form, tac, asm ------------------------";
52 (**#####################################################################(**)
53 "=====new ptree 6 minisubpbl intersteps ==========================";
54 "-------------- get_allpos' new ----------------------------------";
55 "-------------- cut_tree new (from ptree above)-------------------";
56 (**)#####################################################################**)
58 "-----------------------------------------------------------------";
59 "-----------------------------------------------------------------";
60 "-----------------------------------------------------------------";
63 "-------------- fun get_ctxt -------------------------------------";
64 "-------------- fun get_ctxt -------------------------------------";
65 "-------------- fun get_ctxt -------------------------------------";
66 val fmz = ["equality (x+1=(2::real))", "solveFor x","solutions L"];
68 ("Test", ["sqroot-test","univariate","equation","test"],
69 ["Test","squ-equ-test-subpbl1"]);
70 val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
72 handle _ => error "--- fun get_ctxt not even some ctxt found in PblObj";
73 val (p,_,f,nxt,_,pt) = me nxt p [] pt;
75 handle _ => error "--- fun get_ctxt not even some ctxt found in PrfObj";
77 "-------------- fun update_ctxt, fun g_ctxt ----------------------";
78 "-------------- fun update_ctxt, fun g_ctxt ----------------------";
79 "-------------- fun update_ctxt, fun g_ctxt ----------------------";
81 val pt = append_problem [] (e_istate, e_ctxt) e_fmz ([(*oris*)], e_spec, e_term) pt;
82 val ctxt = get_obj g_ctxt pt [];
83 if is_e_ctxt ctxt then () else error "--- fun update_ctxt, fun g_ctxt: append_problem changed";
84 val pt = update_ctxt pt [] (ProofContext.init_global @{theory "Isac"});
85 if (get_obj g_ctxt pt [] |> ProofContext.theory_of |> Context.theory_name) = "Isac"
86 then () else error "--- fun update_ctxt, fun g_ctxt changed";
88 "-------------- check positions in miniscript --------------------";
89 "-------------- check positions in miniscript --------------------";
90 "-------------- check positions in miniscript --------------------";
91 val fmz = ["equality (x+1=(2::real))",
92 "solveFor x","solutions L"];
94 ("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 [1] pt;
98 (* nxt = Add_Given "equality (x + 1 = 2)"
99 (writeln o (itms2str_ ctxt)) (get_obj g_pbl pt (fst p));
101 val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
102 (* (writeln o (itms2str_ ctxt)) (get_obj g_pbl pt (fst p));
104 val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
105 (* (writeln o (itms2str_ ctxt)) (get_obj g_pbl pt (fst p));
107 val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
108 val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
109 val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
110 "ctree.sml-------------- get_allpos' new ------------------------\"";
111 val (PP, pp) = split_last [1];
112 val ((pt', cuts), clevup) = cut_bottom (PP, pp) (get_nd pt PP);
114 val cuts = get_allp [] ([], ([],Frm)) pt;
115 val cuts2 = get_allps [] [1] (children pt);
116 "ctree.sml-------------- cut_tree new (from ptree above)----------";
117 val (pt', cuts) = cut_tree pt ([1],Frm);
118 "ctree.sml-------------- cappend on complete ctree from above ----";
119 val (pt', cuts) = cappend_form pt [1] (e_istate, e_ctxt) (str2term "Inform[1]");
120 "----------------------------------------------------------------/";
122 val (p,_,f,nxt,_,pt) = me nxt p [1] pt(*cappend_form: pos =[1]*);
123 val (p,_,f,nxt,_,pt) = me nxt p [1] pt(*cappend_atomic: pos =[1]*);
124 val (p,_,f,nxt,_,pt) = me nxt p [1] pt(*cappend_atomic: pos =[2]*);
125 val (p,_,f,nxt,_,pt) = me nxt p [1] pt(*cappend_problem: pos =[3]*);
127 val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
128 val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
129 (*val nxt = ("Add_Given", Add_Given "equality (-1 + x = 0)").....*)
130 val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
131 val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
132 val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
133 val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
134 (*val nxt = ("Apply_Method", Apply_Method ["Test", "solve_linear"])*)
136 val (p,_,f,nxt,_,pt) = me nxt p [1] pt(*cappend_form: pos =[3,1]*);
137 val (p,_,f,nxt,_,pt) = me nxt p [1] pt(*cappend_atomic: pos =[3,1]*);
138 val (p,_,f,nxt,_,pt) = me nxt p [1] pt(*cappend_atomic: pos =[3,2]*);
139 val (p,_,f,nxt,_,pt) = me nxt p [1] pt(*.append_result: pos =[3]*);
140 val (p,_,f,nxt,_,pt) = me nxt p [1] pt(*cappend_atomic: pos =[4]*);
141 val (p,_,f,nxt,_,pt) = me nxt p [1] pt(*.append_result: pos =[]*);
142 val Form' (FormKF (~1,EdUndef,0,Nundef,res)) = f;
143 if (snd nxt)=End_Proof' andalso res="[x = 1]" then ()
144 else error "new behaviour in test: miniscript with mini-subpbl";
147 (*========== inhibit exn WN110319 ==============================================
148 ============ inhibit exn WN110319 ============================================*)
150 (*=== inhibit exn ?=============================================================
152 "-------------- get_allpos' (from ptree above)--------------------";
153 "-------------- get_allpos' (from ptree above)--------------------";
154 "-------------- get_allpos' (from ptree above)--------------------";
155 if get_allpos' ([], 1) pt =
167 then () else error "ctree.sml: diff:behav. in get_allpos' 1";
169 if get_allpos's ([], 1) (children pt) =
179 then () else error "ctree.sml: diff:behav. in get_allpos' 2";
181 if get_allpos's ([], 2) (takerest (1, children pt)) =
189 then () else error "ctree.sml: diff:behav. in get_allpos' 3";
191 if get_allpos's ([], 3) (takerest (2, children pt)) =
198 then () else error "ctree.sml: diff:behav. in get_allpos' 4";
200 if get_allpos's ([3], 1) (children (nth 3 (children pt))) =
204 then () else error "ctree.sml: diff:behav. in get_allpos' 5";
206 if get_allpos' ([3], 1) (nth 3 (children pt)) =
212 then () else error "ctree.sml: diff:behav. in get_allpos' 6";
215 (**##############################################################(**)
217 "-------------- cut_level (from ptree above)----------------------";
218 "-------------- cut_level (from ptree above)----------------------";
219 "-------------- cut_level (from ptree above)----------------------";
222 print_depth 99; cuts; print_depth 3;
224 (*if cuts = [([2], Res),
231 then () else error "ctree.sml: diff:behav. in cut_level 1a";
232 val (res,asm) = get_obj g_result pt' [2];
233 if res = e_term andalso asm = [] then () else
234 error "ctree.sml: diff:behav. in cut_level 1aa" WN050219*);
235 if not (existpt [2] pt') then () else
236 error "ctree.sml: diff:behav. in cut_level 1aa2" (*WN050220*);
238 val (res,asm) = get_obj g_result pt' [];
239 if term2str res = "[x = 1]" (*WN050219 e_term in cut_tree!!!*) then () else
240 error "ctree.sml: diff:behav. in cut_level 1ab";
241 if map fst (get_interval ([],Frm) ([],Res) 9999 pt') =
245 ([2], Res),(*, e_term in cut_tree!!!*)
246 ([], Res)] then () else
247 error "ctree.sml: diff:behav. in cut_level 1b";
250 val (pt',cuts) = cut_level [] [] pt ([2],Res);
251 if cuts = [([3], Frm),
257 then () else error "ctree.sml: diff:behav. in cut_level 2a";
259 if pr_ptree pr_short pt' = ". ----- pblobj -----\n1. x + 1 = 2\n2. x + 1 + -1 * 2 = 0\n"
260 then () else error "ctree.sml: diff:behav. in cut_level 2b";
262 val (pt',cuts) = cut_level [] [3] pt ([3,1],Frm);
263 if cuts = [([3, 1], Res), ([3, 2], Res)]
264 then () else error "ctree.sml: diff:behav. in cut_level 3a";
265 if pr_ptree pr_short pt' = ". ----- pblobj -----\n1. x + 1 = 2\n2. x + 1 + -1 * 2 = 0\n3. ----- pblobj -----\n3.1. -1 + x = 0\n4. [x = 1]\n"
266 then () else error "ctree.sml: diff:behav. in cut_level 3b";
268 val (pt',cuts) = cut_level [] [3] pt ([3,1],Res);
269 if cuts = [([3, 2], Res)]
270 then () else error "ctree.sml: diff:behav. in cut_level 4a";
271 if pr_ptree pr_short pt' = ". ----- pblobj -----\n1. x + 1 = 2\n2. x + 1 + -1 * 2 = 0\n3. ----- pblobj -----\n3.1. -1 + x = 0\n4. [x = 1]\n"
272 then () else error "ctree.sml: diff:behav. in cut_level 4b";
275 "-------------- cut_tree (from ptree above)-----------------------";
276 "-------------- cut_tree (from ptree above)-----------------------";
277 "-------------- cut_tree (from ptree above)-----------------------";
278 val (pt', cuts) = cut_tree pt ([2],Frm);(*not created by move_dn -- not on WS*)
279 if cuts = [([2], Res),
287 then () else error "ctree.sml: diff:behav. in cut_tree 1a";
289 val (res,asm) = get_obj g_result pt' [2];
290 if res = e_term (*WN050219 done by cut_level*) then () else
291 error "ctree.sml: diff:behav. in cut_tree 1aa";
293 val form = get_obj g_form pt' [2];
294 if term2str form = "x + 1 + -1 * 2 = 0" (*remained !!!*) then () else
295 error "ctree.sml: diff:behav. in cut_tree 1ab";
297 val (res,asm) = get_obj g_result pt' [];
298 if res = e_term (*WN050219 done by cut_tree*) then () else
299 error "ctree.sml: diff:behav. in cut_tree 1ac";
301 if map fst (get_interval ([],Frm) ([],Res) 9999 pt') =
304 ([1], Res)] then () else
305 error "ctree.sml: diff:behav. in cut_tree 1ad";
307 val (pt', cuts) = cut_tree pt ([2],Res);
308 if cuts = [([3], Frm),
315 then () else error "ctree.sml: diff:behav. in cut_tree 2";
317 val (pt', cuts) = cut_tree pt ([3,1],Frm);
318 if cuts = [([3, 1], Res),
323 then () else error "ctree.sml: diff:behav. in cut_tree 3";
325 val (pt', cuts) = cut_tree pt ([3,1],Res);
326 if cuts = [([3, 2], Res),
330 then () else error "ctree.sml: diff:behav. in cut_tree 4";
333 "=====new ptree 1a miniscript with mini-subpbl ===================";
334 "=====new ptree 1a miniscript with mini-subpbl ===================";
335 "=====new ptree 1a miniscript with mini-subpbl ===================";
336 val fmz = ["equality (x+1=(2::real))", "solveFor x","solutions L"];
338 ("Test",["sqroot-test","univariate","equation","test"],
339 ["Test","squ-equ-test-subpbl1"]);
340 val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
341 val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
342 val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
343 val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
344 val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
345 val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
346 val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
347 val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
348 val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
351 "-------------- cut_level ( ,Frm) on Incomplete Nd ---------------";
352 "-------------- cut_level ( ,Frm) on Incomplete Nd ---------------";
353 "-------------- cut_level ( ,Frm) on Incomplete Nd ---------------";
355 val (pt',cuts) = cut_level [] [3] pt ([1],Frm);(*([1],Frm) is stored*)
356 if cuts = [](*([1],Res) is not yet stored (Nd.ostate=Incomplete)*)
357 then () else error "ctree.sml: diff:behav. in cut_tree 4a";
359 val (pt', cuts) = cut_tree pt ([1],Frm);
361 then () else error "ctree.sml: diff:behav. in cut_tree 4a";
364 val pos as ([p],_) = ([1],Frm);
365 val pt as Nd (b,_) = pt;
370 print_depth 99;cuts;print_depth 3;
371 print_depth 99;map fst (get_interval ([],Frm) ([],Res) 9999 pt');print_depth 3;
372 ####################################################################*)*)
374 "=====new ptree 2 miniscript with mini-subpbl ====================";
375 "=====new ptree 2 miniscript with mini-subpbl ====================";
376 "=====new ptree 2 miniscript with mini-subpbl ====================";
378 CalcTree [(["equality (x+1=(2::real))", "solveFor x","solutions L"],
379 ("Test", ["sqroot-test","univariate","equation","test"],
380 ["Test","squ-equ-test-subpbl1"]))];
381 Iterator 1; moveActiveRoot 1;
382 autoCalculate 1 CompleteCalc;
384 interSteps 1 ([3,2],Res);
386 val ((pt,_),_) = get_calc 1;
389 "-------------- cut_tree (intermedi.ptree: 3rd level)-------------";
390 "-------------- cut_tree (intermedi.ptree: 3rd level)-------------";
391 "-------------- cut_tree (intermedi.ptree: 3rd level)-------------";
392 (*WN050225 intermed. outcommented
393 val (pt', cuts) = cut_tree pt ([3,2,1],Frm);
394 if cuts = [([3, 2, 1], Res),
399 then () else error "ctree.sml: diff:behav. in cut_tree 3rd level 1";
401 val (pt', cuts) = cut_tree pt ([3,2,1],Res);
402 if cuts = [([3, 2, 2], Res),
406 then () else error "ctree.sml: diff:behav. in cut_tree 3rd level 2";
409 "-------------- cappend (from ptree above)------------------------";
410 "-------------- cappend (from ptree above)------------------------";
411 "-------------- cappend (from ptree above)------------------------";
412 val (pt',cuts) = cappend_form pt [3,2,1] e_istate (str2term "newnew");
413 if cuts = [([3, 2, 1], Res),
419 then () else error "ctree.sml: diff:behav. in cappend_form";
420 if term2str (get_obj g_form pt' [3,2,1]) = "newnew" andalso
421 get_obj g_tac pt' [3,2,1] = Empty_Tac andalso
422 term2str (fst (get_obj g_result pt' [3,2,1])) = "??.empty"
423 then () else error "ctree.sml: diff:behav. in cappend 1";
425 val (pt',cuts) = cappend_atomic pt [3,2,1] e_istate (str2term "newform")
426 (Tac "test") (str2term "newresult",[]) Complete;
427 if cuts = [([3, 2, 1], Res), (*?????????????*)
433 then () else error "ctree.sml: diff:behav. in cappend_atomic";
437 "-------------- cappend minisubpbl -------------------------------";
438 "-------------- cappend minisubpbl -------------------------------";
439 "-------------- cappend minisubpbl -------------------------------";
440 "=====new ptree 1 miniscript with mini-subpbl ====================";
441 val fmz = ["equality (x+1=(2::real))", "solveFor x","solutions L"];
443 ("Test",["sqroot-test","univariate","equation","test"],
444 ["Test","squ-equ-test-subpbl1"]);
445 val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
446 val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
447 (* nxt = Add_Given "equality (x + 1 = 2)"
448 (writeln o (itms2str_ ctxt)) (get_obj g_pbl pt (fst p));
450 val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
451 (* (writeln o (itms2str_ ctxt)) (get_obj g_pbl pt (fst p));
453 val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
454 (* (writeln o (itms2str_ ctxt)) (get_obj g_pbl pt (fst p));
456 val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
457 val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
458 val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
459 (*###cappend_form: pos =[1] ... while calculating nxt, which pt is dropped
460 val nxt = ("Apply_Method", Apply_Method ["Test", "squ-equ-test-subpbl1"])*)
462 (*val (p,_,f,nxt,_,pt) = me nxt p [1] pt(**)cappend_form: pos =[1]*);
464 val (pt,cuts) = cappend_form pt (fst p) e_istate (str2term "x + 1 = 2");
465 val form = get_obj g_form pt (fst p);
466 val (res,_) = get_obj g_result pt (fst p);
467 if term2str form = "x + 1 = 2" andalso res = e_term then () else
468 error "ctree.sml, diff.behav. cappend minisubpbl ([1],Frm)";
469 if not (existpt ((lev_on o fst) p) pt) then () else
470 error "ctree.sml, diff.behav. cappend minisubpbl ([1],Frm) nxt";
472 (*val (p,_,f,nxt,_,pt) = me nxt p [1] pt(**)cappend_atomic: pos =[1]*);
475 cappend_atomic pt (fst p) e_istate (str2term "x + 1 = 2")
476 Empty_Tac (str2term "x + 1 + -1 * 2 = 0",[]) Incomplete;
477 val form = get_obj g_form pt (fst p);
478 val (res,_) = get_obj g_result pt (fst p);
479 if term2str form = "x + 1 = 2" andalso term2str res = "x + 1 + -1 * 2 = 0"
480 then () else error "ctree.sml, diff.behav. cappend minisubpbl ([1],Res)";
481 if not (existpt ((lev_on o fst) p) pt) then () else
482 error "ctree.sml, diff.behav. cappend minisubpbl ([1],Res) nxt";
484 (*val (p,_,f,nxt,_,pt) = me nxt p [1] pt(**)cappend_atomic: pos =[2]*);
487 cappend_atomic pt (fst p) e_istate (str2term "x + 1 + -1 * 2 = 0")
488 Empty_Tac (str2term "-1 + x = 0",[]) Incomplete;
489 val form = get_obj g_form pt (fst p);
490 val (res,_) = get_obj g_result pt (fst p);
491 if term2str form = "x + 1 + -1 * 2 = 0" andalso term2str res = "-1 + x = 0"
492 then () else error "ctree.sml, diff.behav. cappend minisubpbl ([2],Res)";
493 if not (existpt ((lev_on o fst) p) pt) then () else
494 error "ctree.sml, diff.behav. cappend minisubpbl ([2],Res) nxt";
497 (*val (p,_,f,nxt,_,pt) = me nxt p [1] pt;(**)cappend_problem: pos =[3]*)
499 val (pt,cuts) = cappend_problem pt (fst p) e_istate e_fmz ([],e_spec,e_term);
500 if is_pblobj (get_obj I pt (fst p)) then () else
501 error "ctree.sml, diff.behav. cappend minisubpbl ([3],Pbl)";
502 if not (existpt ((lev_on o fst) p) pt) then () else
503 error "ctree.sml, diff.behav. cappend minisubpbl ([3],Pbl) nxt";
505 (* ...complete calchead skipped...*)
507 (*val (p,_,f,nxt,_,pt) = me nxt p [1] pt(**)cappend_form: pos =[3,1]*);
508 val p = ([3, 1], Frm);
509 val (pt,cuts) = cappend_form pt (fst p) e_istate (str2term "-1 + x = 0");
510 val form = get_obj g_form pt (fst p);
511 val (res,_) = get_obj g_result pt (fst p);
512 if term2str form = "-1 + x = 0" andalso res = e_term then () else
513 error "ctree.sml, diff.behav. cappend minisubpbl ([3,1],Frm)";
514 if not (existpt ((lev_on o fst) p) pt) then () else
515 error "ctree.sml, diff.behav. cappend minisubpbl ([3,1],Frm) nxt";
517 (*val (p,_,f,nxt,_,pt) = me nxt p [1] pt;(**)cappend_atomic: pos =[3,1]*)
518 val p = ([3, 1], Res);
520 cappend_atomic pt (fst p) e_istate (str2term "-1 + x = 0")
521 Empty_Tac (str2term "x = 0 + -1 * -1",[]) Incomplete;
522 val form = get_obj g_form pt (fst p);
523 val (res,_) = get_obj g_result pt (fst p);
524 if term2str form = "-1 + x = 0" andalso term2str res = "x = 0 + -1 * -1" then()
525 else error "ctree.sml, diff.behav. cappend minisubpbl ([3,1],Res)";
526 if not (existpt ((lev_on o fst) p) pt) then () else
527 error "ctree.sml, diff.behav. cappend minisubpbl ([3,1],Res) nxt";
529 (*val (p,_,f,nxt,_,pt) = me nxt p [1] pt(**)cappend_form: pos =[3,1]*);
530 (*val (p,_,f,nxt,_,pt) = me nxt p [1] pt(**)cappend_atomic: pos =[3,1]*);
531 (*val (p,_,f,nxt,_,pt) = me nxt p [1] pt(**)cappend_atomic: pos =[3,2]*);
532 (*val (p,_,f,nxt,_,pt) = me nxt p [1] pt(**).append_result: pos =[3]*);
533 (*val (p,_,f,nxt,_,pt) = me nxt p [1] pt(**)cappend_atomic: pos =[4]*);
534 (*val (p,_,f,nxt,_,pt) = me nxt p [1] pt(**).append_result: pos =[]*);
536 WN050225 intermed. outcommented---*)
538 "=====new ptree 3 ================================================";
539 "=====new ptree 3 ================================================";
540 "=====new ptree 3 ================================================";
542 CalcTree [(["equality (x+1=(2::real))", "solveFor x","solutions L"],
543 ("Test", ["sqroot-test","univariate","equation","test"],
544 ["Test","squ-equ-test-subpbl1"]))];
545 Iterator 1; moveActiveRoot 1;
546 autoCalculate 1 CompleteCalc;
548 val ((pt,_),_) = get_calc 1;
551 "-------------- move_dn ------------------------------------------";
552 "-------------- move_dn ------------------------------------------";
553 "-------------- move_dn ------------------------------------------";
554 val p = move_dn [] pt ([],Pbl) (*-> ([1],Frm)*);
555 val p = move_dn [] pt p (*-> ([1],Res)*);
556 val p = move_dn [] pt p (*-> ([2],Res)*);
557 val p = move_dn [] pt p (*-> ([3],Pbl)*);
558 val p = move_dn [] pt p (*-> ([3,1],Frm)*);
559 val p = move_dn [] pt p (*-> ([3,1],Res)*);
560 val p = move_dn [] pt p (*-> ([3,2],Res)*);
561 val p = move_dn [] pt p (*-> ([3],Res)*);
562 (* term2str (get_obj g_res pt [3]);
563 term2str (get_obj g_form pt [4]);
565 val p = move_dn [] pt p (*-> ([4],Res)*);
566 val p = move_dn [] pt p (*-> ([],Res)*);
568 val p = (move_dn [] pt p) handle e => print_exn_G e;
569 Exception PTREE end of calculation*)
570 if p=([],Res) then () else error "ctree.sml: diff:behav. in move_dn";
573 "-------------- move_dn: Frm -> Res ------------------------------";
574 "-------------- move_dn: Frm -> Res ------------------------------";
575 "-------------- move_dn: Frm -> Res ------------------------------";
577 CalcTree (*start of calculation, return No.1*)
578 [(["equality (1+-1*2+x=0)", "solveFor x","solutions L"],
580 ["linear","univariate","equation","test"],
581 ["Test","solve_linear"]))];
582 Iterator 1; moveActiveRoot 1;
583 autoCalculate 1 CompleteCalcHead;
584 autoCalculate 1 (Step 1);
585 refFormula 1 (get_pos 1 1);
589 if get_pos 1 1 = ([1], Frm) then ()
590 else error "ctree.sml: diff.behav. in move_dn: Frm -> Res (1)";
591 moveActiveDown 1; (*<ERROR> pos does not exist </ERROR>*)
593 autoCalculate 1 (Step 1);
594 refFormula 1 (get_pos 1 1);
596 moveActiveDown 1; (*<ERROR> pos does not exist </ERROR>*)
597 if get_pos 1 1 = ([1], Res) then ()
598 else error "ctree.sml: diff.behav. in move_dn: Frm -> Res (1)";
599 moveActiveDown 1; (*<ERROR> pos does not exist </ERROR>*)
602 "-------------- move_up ------------------------------------------";
603 "-------------- move_up ------------------------------------------";
604 "-------------- move_up ------------------------------------------";
605 val p = move_up [] pt ([],Res); (*-> ([4],Res)*)
606 val p = move_up [] pt p; (*-> ([3],Res)*)
607 val p = move_up [] pt p; (*-> ([3,2],Res)*)
608 val p = move_up [] pt p; (*-> ([3,1],Res)*)
609 val p = move_up [] pt p; (*-> ([3,1],Frm)*)
610 val p = move_up [] pt p; (*-> ([3],Pbl)*)
611 val p = move_up [] pt p; (*-> ([2],Res)*)
612 val p = move_up [] pt p; (*-> ([1],Res)*)
613 val p = move_up [] pt p; (*-> ([1],Frm)*)
614 val p = move_up [] pt p; (*-> ([],Pbl)*)
615 (*val p = (move_up [] pt p) handle e => print_exn_G e;
616 Exception PTREE begin of calculation*)
617 if p=([],Pbl) then () else error "ctree.sml: diff.behav. in move_up";
620 "------ move into detail -----------------------------------------";
621 "------ move into detail -----------------------------------------";
622 "------ move into detail -----------------------------------------";
624 CalcTree [(["equality (x+1=(2::real))", "solveFor x","solutions L"],
625 ("Test", ["sqroot-test","univariate","equation","test"],
626 ["Test","squ-equ-test-subpbl1"]))];
627 Iterator 1; moveActiveRoot 1;
628 autoCalculate 1 CompleteCalc;
633 refFormula 1 (get_pos 1 1) (* 2 Res, <ISA> -1 + x = 0 </ISA> *);
635 interSteps 1 ([2],Res);
637 val ((pt,_),_) = get_calc 1; show_pt pt;
640 val p = move_up [] pt p; (*([2, 6], Res)*);
641 val p = movelevel_up [] pt p;(*([2], Frm)*);
642 val p = move_dn [] pt p; (*([2, 1], Frm)*);
643 val p = move_dn [] pt p; (*([2, 1], Res)*);
644 val p = move_dn [] pt p; (*([2, 2], Res)*);
645 val p = move_dn [] pt p; (*([2, 3], Res)*);
646 val p = move_dn [] pt p; (*([2, 4], Res)*);
647 val p = move_dn [] pt p; (*([2, 5], Res)*);
648 val p = move_dn [] pt p; (*([2, 6], Res)*);
649 if p = ([2, 6], Res) then()
650 else error "ctree.sml: diff.behav. in move into detail";
652 "=====new ptree 3a ===============================================";
653 "=====new ptree 3a ===============================================";
654 "=====new ptree 3a ===============================================";
656 CalcTree [(["equality (x+1=(2::real))", "solveFor x","solutions L"],
657 ("Test", ["sqroot-test","univariate","equation","test"],
658 ["Test","squ-equ-test-subpbl1"]))];
659 Iterator 1; moveActiveRoot 1;
660 autoCalculate 1 CompleteCalcHead;
661 autoCalculate 1 (Step 1);
662 autoCalculate 1 (Step 1);
663 autoCalculate 1 (Step 1);
664 val ((pt,_),_) = get_calc 1;
665 val p = move_dn [] pt ([],Pbl) (*-> ([1], Frm)*);
666 val p = move_dn [] pt ([1], Frm) (*-> ([1], Res)*);
667 val p = move_dn [] pt ([1], Res) (*-> ([2], Res)*);
668 (*val p = move_dn [] pt ([2], Res) ->Exception- PTREE "[] not complete"*);
670 moveDown 1 ([],Pbl) (*-> ([1], Frm)*);
671 moveDown 1 ([1],Frm) (*-> ([1],Res)*);
672 moveDown 1 ([1],Res) (*-> ([2],Res)*);
673 moveDown 1 ([2],Res) (*-> pos does not exist*);
675 get_obj g_ostate pt [1];
679 "-------------- move_dn in Incomplete ctree ----------------------";
680 "-------------- move_dn in Incomplete ctree ----------------------";
681 "-------------- move_dn in Incomplete ctree ----------------------";
685 "=====new ptree 4: crooked by cut_level_'_ =======================";
686 "=====new ptree 4: crooked by cut_level_'_ =======================";
687 "=====new ptree 4: crooked by cut_level_'_ =======================";
690 [(["equality (x/(x^2 - 6*x+9) - 1/(x^2 - 3*x) =1/x)",
691 "solveFor x","solutions L"],
692 ("RatEq",["univariate","equation"],["no_met"]))];
693 Iterator 1; moveActiveRoot 1;
694 autoCalculate 1 CompleteCalc;
696 getTactic 1 ([1],Res);(*Rewrite_Set RatEq_simplify*)
697 getTactic 1 ([2],Res);(*Rewrite_Set norm_Rational*)
698 getTactic 1 ([3],Res);(*Rewrite_Set RatEq_eliminate*)
699 getTactic 1 ([4,1],Res);(*Rewrite all_left*)
700 getTactic 1 ([4,2],Res);(*Rewrite_Set expand_binoms*)
701 getTactic 1 ([4,3],Res);(*Rewrite_Set_Inst make_ratpoly_in*)
703 moveActiveFormula 1 ([1],Res)(*1.1...1.4*);
704 moveActiveFormula 1 ([2],Res)(**ME_Isa: 'expand' not known*);
705 moveActiveFormula 1 ([3],Res)(*3.1.*);
706 moveActiveFormula 1 ([4,2],Res)(*4.2.1.*);
707 moveActiveFormula 1 ([4,3],Res)(**one_scr_arg: called by Script Stepwise t_=*);
709 moveActiveFormula 1 ([1],Res)(*1.1...1.4*);
710 interSteps 1 ([1],Res)(*..is activeFormula !?!*);
712 getTactic 1 ([1,1],Res);(*Rewrite real_diff_minus*)
713 getTactic 1 ([1,2],Res);(*Rewrite real_diff_minus*)
714 getTactic 1 ([1,3],Res);(*Rewrite real_diff_minus*)
715 getTactic 1 ([1,4],Res);(*Rewrite real_rat_mult_1*)
717 moveActiveFormula 1 ([4,2],Res)(*4.2.1.*);
718 interSteps 1 ([4,2],Res)(*..is activeFormula !?!*);
719 val ((pt,_),_) = get_calc 1;
720 writeln(pr_ptree pr_short pt);
721 (*delete [4,1] in order to make pos [4],[4,4] for pblobjs differen [4],[4,3]:
722 ###########################################################################*)
723 val (pt, ppp) = cut_level_'_ [] [] pt ([4,1],Frm);
724 writeln(pr_ptree pr_short pt);
727 "-------------- get_interval from ctree: incremental development--";
728 "-------------- get_interval from ctree: incremental development--";
729 "-------------- get_interval from ctree: incremental development--";
730 "--- level 1: get pos from start b to end p ----------------------";
731 "--- level 1: get pos from start b to end p ----------------------";
732 "--- level 1: get pos from start b to end p ----------------------";
733 (******************************************************************)
734 (**) val SAVE_get_trace = get_trace; (**)
735 (******************************************************************)
736 (*'getnds' below is structured as such:*)
737 fun www _ [x] = "l+r-margin"
738 | www true [x1,x2] = "l-margin, r-margin"
739 | www _ [x1,x2] = "intern, r-margin"
740 | www true (x::(xs as _::_)) = "l-margin " ^ www false xs
741 | www _ (x::(xs as _::_)) = "intern " ^ www false xs;
742 www true [1,2,3,4,5];
743 (*val it = "from intern intern intern to" : string*)
745 (*val it = "from to" : string*)
747 (*val it = "from+to" : string*)
750 (*specific values of hd of pos p,q for simple handling take_fromto,
751 from-pos p, to-pos q: take_fromto (hdp p) (hdq q) (children pt) ...
752 ... can be used even for positions _below_ p or q*)
753 fun hdp [] = 1 | hdp [0] = 1 | hdp x = hd x;(*start with first*)
754 fun hdq [] = 99999 | hdq [0] = 99999 | hdq x = hd x;(*take until last*)
755 (*analoguous for tl*)
756 fun tlp [] = [0] | tlp [_] = [0] | tlp x = tl x;
757 fun tlq [] = [99999] | tlq [_] = [99999] | tlq x = tl x;
759 (*see modspec.sml#pt_form
760 fun pt_form (PrfObj {form,...}) = term2str form
761 | pt_form (PblObj {probl,spec,origin=(_,spec',_),...}) =
762 let val (dI, pI, _) = get_somespec' spec spec'
763 val {cas,...} = get_pbt pI
765 NONE => term2str (pblterm dI pI)
766 | SOME t => term2str (subst_atomic (mk_env probl) t)
769 (*.get an 'interval' from ptree down to a certain level
770 by 'take_fromto children' of the nodes with specific 'from' and 'to';
771 'i > 0' suppresses output during recursive descent towards 'from'
772 b: the 'from' incremented to the actual pos
773 p,q: specific 'from','to' for simple use of 'take_fromto'*)
774 fun getnd i (b,p) q (Nd (po, nds)) =
775 (if i <= 0 then [(*[(b, pt_form po)]*) (**)[b](**)] else [])
777 @ (writeln("getnd : b="^(ints2str' b)^", p="^
778 (ints2str' p)^", q="^(ints2str' q));
780 getnds (i-1) true (b@[hdp p], tlp p) (tlq q)
781 (take_fromto (hdp p) (hdq q) nds))
783 and getnds _ _ _ _ [] = [] (*no children*)
784 | getnds i _ (b,p) q [nd] = (getnd i (b,p) q nd) (*l+r-margin*)
785 | getnds i true (b,p) q [n1, n2] = (*l-margin, r-margin*)
786 (writeln("getnds3: b="^ ints2str' b ^", p="^ ints2str' p ^
787 ", q="^ ints2str' q);
788 (getnd i ( b, p ) [99999] n1) @
789 (getnd ~99999 (lev_on b,[0]) q n2))
790 | getnds i _ (b,p) q [n1, n2] = (*intern, r-margin*)
791 (writeln("getnds4: b="^ ints2str' b ^", p="^ ints2str' p ^
792 ", q="^ ints2str' q);
793 (getnd i ( b,[0]) [99999] n1) @
794 (getnd ~99999 (lev_on b,[0]) q n2))
795 | getnds i true (b,p) q (nd::(nds as _::_)) = (*l-margin, intern*)
796 (writeln("getnds5: b="^ ints2str' b ^", p="^ ints2str' p ^
797 ", q="^ ints2str' q);
798 (getnd i ( b, p ) [99999] nd) @
799 (getnds ~99999 false (lev_on b,[0]) q nds))
800 | getnds i _ (b,p) q (nd::(nds as _::_)) = (*intern, ...*)
801 (getnd i ( b,[0]) [99999] nd) @
802 (getnds ~99999 false (lev_on b,[0]) q nds);
804 (*get an 'interval from to' from a ptree as 'intervals f t' of respective nodes
805 where 'from' are pos, i.e. a key as int list, 'f' an int (to,t analoguous)
806 (1) the 'f' are given
807 (1a) by 'from' if 'f' = the respective element of 'from' (left margin)
808 (1b) -inifinity, if 'f' > the respective element of 'from' (internal node)
810 (2a) by 'to' if 't' = the respective element of 'to' (right margin)
811 (2b) inifinity, if 't' < the respective element of 'to (internal node)'
812 the 'f' and 't' are set by hdp,... *)
813 fun get_trace pt p q =
814 (flat o (getnds ((length p) -1) true ([hdp p], tlp p) (tlq q)))
815 (take_fromto (hdp p) (hdq q) (children pt));
818 writeln(pr_ptree pr_short pt);
819 case get_trace pt [1,3] [4,1,1] of
820 [[1,3],[1,4],[2],[3],[4],[4,1],[4,1,1]] => ()
821 | _ => error "diff.behav.in ctree.sml: get_interval lev 1a";
822 case get_trace pt [2] [4,3,2] of
823 [[2],[3],[4],[4,1],[4,1,1],[4,2],[4,3],[4,3,1],[4,3,2]] => ()
824 | _ => error "diff.behav.in ctree.sml: get_interval lev 1b";
825 case get_trace pt [1,4] [4,3,1] of
826 [[1,4],[2],[3],[4],[4,1],[4,1,1],[4,2],[4,3],[4,3,1]] => ()
827 | _ => error "diff.behav.in ctree.sml: get_interval lev 1c";
828 case get_trace pt [4,2] [5] of
829 (*[([4,2],_),([4,3],_),([4,4],_),([4,4,1],_),([4,4,2],_),([4,4,3],_),
830 ([4,4,4],_),([4,4,5],_),([5],_)] => () ..with pt_form*)
831 [[4,2],[4,3],[4,3,1],[4,3,2],[4,3,3],[4,3,4],[4,3,5],[5]]=>()
832 | _ => error "diff.behav.in ctree.sml: get_interval lev 1d";
833 case get_trace pt [] [4,4,2] of
834 [[1],[1,1],[1,2],[1,3],[1,4],[2],[3],[4],[4,1],[4,1,1],[4,2],
835 [4,3],[4,3,1],[4,3,2]] => ()
836 | _ => error "diff.behav.in ctree.sml: get_interval lev 1e";
837 case get_trace pt [] [] of
838 [[1],[1,1],[1,2],[1,3],[1,4],[2],[3],[4],[4,1],[4,1,1],[4,2],
839 [4,3],[4,3,1],[4,3,2],[4,3,3],[4,3,4],[4,3,5],[5]] => ()
840 | _ => error "diff.behav.in ctree.sml: get_interval lev 1f";
841 case get_trace pt [4,3] [4,3] of
842 [[4,3],[4,3,1],[4,3,2],[4,3,3],[4,3,4],[4,3,5]] => ()
843 | _ => error "diff.behav.in ctree.sml: get_interval lev 1g";
845 "--- level 2: get pos' from start b to end p ---------------------";
846 "--- level 2: get pos' from start b to end p ---------------------";
847 "--- level 2: get pos' from start b to end p ---------------------";
848 (*idea: pos_ is _ONLY_ relevant exactly at (endpoint of) from, to
849 development stopped in favour of move_dn, see get_interval
850 actually used (inefficient) version with move_dn: see modspec.sml
853 case get_trace pt ([1,4],Res) ([4,4,1],Frm) of
854 [[2],[3],[4],[4,1],[4,2],[4,2,1],[4,3],[4,4],[4,4,1]] => ()
855 | _ => error "diff.behav.in ctree.sml: get_interval lev 1b";
856 case get_trace pt ([],Pbl) ([],Res) of
857 [[1],[1,1],[1,2],[1,3],[1,4],[2],[3],[4],[4,1],[4,2],[4,2,1],[4,3],
858 [4,4],[4,4,1],[4,4,2],[4,4,3],[4,4,4],[4,4,5],[5]] => ()
859 | _ => error "diff.behav.in ctree.sml: get_interval lev 1e";
862 (******************************************************************)
863 (**) val get_trace = SAVE_get_trace; (**)
864 (******************************************************************)
867 "=====new ptree 4 ratequation ====================================";
868 "=====new ptree 4 ratequation ====================================";
869 "=====new ptree 4 ratequation ====================================";
872 [(["equality (x/(x^2 - 6*x+9) - 1/(x^2 - 3*x) =1/x)",
873 "solveFor x","solutions L"],
874 ("RatEq",["univariate","equation"],["no_met"]))];
875 Iterator 1; moveActiveRoot 1;
876 autoCalculate 1 CompleteCalc;
877 val ((pt,_),_) = get_calc 1;
881 "-------------- pt_extract form, tac, asm<>[] --------------------";
882 "-------------- pt_extract form, tac, asm<>[] --------------------";
883 "-------------- pt_extract form, tac, asm<>[] --------------------";
884 val (Form form, SOME tac, asm) = pt_extract (pt, ([3], Res));
885 case (term2str form, tac, terms2strs asm) of
886 ("(3 + -1 * x + x ^^^ 2) * x = 1 * (9 * x + -6 * x ^^^ 2 + x ^^^ 3)",
889 ["normalize", "polynomial", "univariate", "equation"]),
890 ["9 * x + -6 * x ^^^ 2 + x ^^^ 3 ~= 0"]) => ()
891 | _ => error "diff.behav.in ctree.sml: pt_extract asm<>[]";
892 (*WN060717 unintentionally changed some rls/ord while
893 completing knowl. for thes2file...
895 case (term2str form, tac, terms2strs asm) of
896 ((*"(3 + (-1 * x + x ^^^ 2)) * x = 1 * (9 * x + (x ^^^ 3 + -6 * x ^^^ 2))",
899 ["normalize", "polynomial", "univariate", "equation"]),
900 ["9 * x + (x ^^^ 3 + -6 * x ^^^ 2) ~= 0"]) => ()
901 | _ => error "diff.behav.in ctree.sml: pt_extract asm<>[]";
903 .... but it became even better*)
907 "=====new ptree 5 minisubpbl =====================================";
908 "=====new ptree 5 minisubpbl =====================================";
909 "=====new ptree 5 minisubpbl =====================================";
911 CalcTree [(["equality (x+1=(2::real))", "solveFor x","solutions L"],
912 ("Test", ["sqroot-test","univariate","equation","test"],
913 ["Test","squ-equ-test-subpbl1"]))];
914 Iterator 1; moveActiveRoot 1;
915 autoCalculate 1 CompleteCalc;
916 val ((pt,_),_) = get_calc 1;
919 "-------------- pt_extract form, tac, asm ------------------------";
920 "-------------- pt_extract form, tac, asm ------------------------";
921 "-------------- pt_extract form, tac, asm ------------------------";
922 val (ModSpec (_,_,form,_,_,_), SOME tac, asm) = pt_extract (pt, ([], Frm));
923 case (term2str form, tac, terms2strs asm) of
924 ("solve (x + 1 = 2, x)",
925 Apply_Method ["Test", "squ-equ-test-subpbl1"],
927 | _ => error "diff.behav.in ctree.sml: pt_extract ([], Pbl)";
929 val (Form form, SOME tac, asm) = pt_extract (pt, ([1], Frm));
930 case (term2str form, tac, terms2strs asm) of
931 ("x + 1 = 2", Rewrite_Set "norm_equation", []) => ()
932 | _ => error "diff.behav.in ctree.sml: pt_extract ([1], Frm)";
934 val (Form form, SOME tac, asm) = pt_extract (pt, ([1], Res));
935 case (term2str form, tac, terms2strs asm) of
936 ("x + 1 + -1 * 2 = 0", Rewrite_Set "Test_simplify", []) => ()
937 | _ => error "diff.behav.in ctree.sml: pt_extract ([1], Res)";
939 val (Form form, SOME tac, asm) = pt_extract (pt, ([2], Res));
940 case (term2str form, tac, terms2strs asm) of
942 Subproblem ("Test", ["linear", "univariate", "equation", "test"]),
944 | _ => error "diff.behav.in ctree.sml: pt_extract ([2], Res)";
946 val (ModSpec (_,_,form,_,_,_), SOME tac, asm) = pt_extract (pt, ([3], Pbl));
947 case (term2str form, tac, terms2strs asm) of
948 ("solve (-1 + x = 0, x)", Apply_Method ["Test", "solve_linear"], []) => ()
949 | _ => error "diff.behav.in ctree.sml: pt_extract ([3], Pbl)";
951 val (Form form, SOME tac, asm) = pt_extract (pt, ([3,1], Frm));
952 case (term2str form, tac, terms2strs asm) of
953 ("-1 + x = 0", Rewrite_Set_Inst (["(bdv, x)"], "isolate_bdv"), []) => ()
954 | _ => error "diff.behav.in ctree.sml: pt_extract ([3,1], Frm)";
956 val (Form form, SOME tac, asm) = pt_extract (pt, ([3,1], Res));
957 case (term2str form, tac, terms2strs asm) of
958 ("x = 0 + -1 * -1", Rewrite_Set "Test_simplify", []) => ()
959 | _ => error "diff.behav.in ctree.sml: pt_extract ([3,1], Res)";
961 val (Form form, SOME tac, asm) = pt_extract (pt, ([3,2], Res));
962 case (term2str form, tac, terms2strs asm) of
963 ("x = 1", Check_Postcond ["linear", "univariate", "equation", "test"],
965 | _ => error "diff.behav.in ctree.sml: pt_extract ([3,2], Res)";
967 val (Form form, SOME tac, asm) = pt_extract (pt, ([3], Res));
968 case (term2str form, tac, terms2strs asm) of
969 ("[x = 1]", Check_elementwise "Assumptions", []) => ()
970 | _ => error "diff.behav.in ctree.sml: pt_extract ([3], Res)";
972 val (Form form, SOME tac, asm) = pt_extract (pt, ([4], Res));
973 case (term2str form, tac, terms2strs asm) of
975 Check_Postcond ["sqroot-test", "univariate", "equation", "test"],
977 | _ => error "diff.behav.in ctree.sml: pt_extract ([4], Res)";
979 val (Form form, tac, asm) = pt_extract (pt, ([], Res));
980 case (term2str form, tac, terms2strs asm) of
981 ("[x = 1]", NONE, []) => ()
982 | _ => error "diff.behav.in ctree.sml: pt_extract ([], Res)";
984 "=====new ptree 6 minisubpbl intersteps ==========================";
985 "=====new ptree 6 minisubpbl intersteps ==========================";
986 "=====new ptree 6 minisubpbl intersteps ==========================";
988 CalcTree [(["equality (x+1=(2::real))", "solveFor x","solutions L"],
989 ("Test", ["sqroot-test","univariate","equation","test"],
990 ["Test","squ-equ-test-subpbl1"]))];
991 Iterator 1; moveActiveRoot 1;
992 autoCalculate 1 CompleteCalc;
993 interSteps 1 ([2],Res);
994 interSteps 1 ([3,2],Res);
995 val ((pt,_),_) = get_calc 1;
998 (**##############################################################**)
999 "-------------- get_allpos' new ----------------------------------";
1000 "-------------- get_allpos' new ----------------------------------";
1001 "-------------- get_allpos' new ----------------------------------";
1004 val cuts = get_allp [] ([], ([],Frm)) pt;
1007 [(*never returns the first pos'*)
1010 ([2, 1], Frm), ([2, 1], Res), ([2, 2], Res), ([2, 3], Res),
1011 ([2, 4], Res), ([2, 5], Res), ([2, 6], Res),
1014 ([3, 1], Frm), ([3, 1], Res),
1015 ([3, 2, 1], Frm), ([3, 2, 1], Res), ([3, 2, 2], Res),
1019 ([], Res)] then () else
1020 error "ctree.sml diff.behav. get_allp new []";
1023 val cuts2 = get_allps [] [1] (children pt);
1025 if cuts = cuts2 @ [([], Res)] then () else
1026 error "ctree.sml diff.behav. get_allps new []";
1028 "---(3) on S(606)..S(608)--------";
1029 "--- nd [2] with 6 children---------------------------------";
1030 val cuts = get_allp [] ([2], ([],Frm)) (get_nd pt [2]);
1032 [([2, 1], Frm), ([2, 1], Res), ([2, 2], Res), ([2, 3], Res),
1033 ([2, 4], Res), ([2, 5], Res), ([2, 6], Res),
1034 ([2], Res)] then () else
1035 error "ctree.sml diff.behav. get_allp new [2]";
1037 val cuts2 = get_allps [] [2,1] (children (get_nd pt [2]));
1038 if cuts = cuts2 @ [([2], Res)] then () else
1039 error "ctree.sml diff.behav. get_allps new [2]";
1042 "---(4) on S(606)..S(608)--------";
1043 "--- nd [3] subproblem--------------------------------------";
1044 val cuts = get_allp [] ([3], ([],Frm)) (get_nd pt [3]);
1048 ([3, 2, 1], Frm), ([3, 2, 1], Res), ([3, 2, 2], Res),
1050 ([3], Res)] then () else
1051 error "ctree.sml diff.behav. get_allp new [3]";
1053 val cuts2 = get_allps [] [3,1] (children (get_nd pt [3]));
1054 if cuts = cuts2 @ [([3], Res)] then () else
1055 error "ctree.sml diff.behav. get_allps new [3]";
1057 "--- nd [3,2] with 2 children--------------------------------";
1058 val cuts = get_allp [] ([3,2], ([],Frm)) (get_nd pt [3,2]);
1060 [([3, 2, 1], Frm), ([3, 2, 1], Res), ([3, 2, 2], Res),
1061 ([3, 2], Res)] then () else
1062 error "ctree.sml diff.behav. get_allp new [3,2]";
1064 val cuts2 = get_allps [] [3,2,1] (children (get_nd pt [3,2]));
1065 if cuts = cuts2 @ [([3, 2], Res)] then () else
1066 error "ctree.sml diff.behav. get_allps new [3,2]";
1068 "---(5a) on S(606)..S(608)--------";
1069 "--- nd [3,2,1] with 0 children------------------------------";
1070 val cuts = get_allp [] ([3,2,1], ([],Frm)) (get_nd pt [3,2,1]);
1073 error "ctree.sml diff.behav. get_allp new [3,2,1]";
1075 val cuts2 = get_allps [] [3,2,1,1] (children (get_nd pt [3,2,1]));
1076 if cuts = cuts2 @ [] then () else
1077 error "ctree.sml diff.behav. get_allps new [3,2,1]";
1080 (**#################################################################**)
1081 "-------------- cut_tree new (from ptree above)-------------------";
1082 "-------------- cut_tree new (from ptree above)-------------------";
1083 "-------------- cut_tree new (from ptree above)-------------------";
1085 val b = get_obj g_branch pt [];
1086 if b = TransitiveB then () else
1087 error ("ctree.sml diff.behav. in [] branch="^branch2str b);
1088 val b = get_obj g_branch pt [3];
1089 if b = TransitiveB then () else
1090 error ("ctree.sml diff.behav. in [3] branch="^branch2str b);
1092 "---(2) on S(606)..S(608)--------";
1093 val (pt', cuts) = cut_tree pt ([1],Res);
1097 if cuts = [([2, 1], Frm), ([2, 1], Res), ([2, 2], Res), ([2, 3], Res),
1098 ([2, 4], Res), ([2, 5], Res), ([2, 6], Res), ([2], Res), ([3], Pbl),
1099 ([3, 1], Frm), ([3, 1], Res), ([3, 2, 1], Frm), ([3, 2, 1], Res),
1100 ([3, 2, 2], Res), ([3, 2], Res), ([3], Res), ([4], Res),
1101 (*WN060727 after replacing cutlevup by test_trans:*)([], Res)] then () else
1102 error "ctree.sml: diff.behav. cut_tree ([1],Res)";
1105 "---(3) on S(606)..S(608)--------";
1106 val (pt', cuts) = cut_tree pt ([2],Res);
1110 if cuts = [(*preceding step on WS was ([1]),Res*)
1111 ([2, 1], Frm), ([2, 1], Res), ([2, 2], Res), ([2, 3], Res),
1112 ([2, 4], Res), ([2, 5], Res), ([2, 6], Res),
1117 ([3, 2, 1], Frm), ([3, 2, 1], Res), ([3, 2, 2], Res),
1121 (*WN060727 added after replacing cutlevup by test_trans:*)([],Res)] then ()
1122 else error "ctree.sml: diff.behav. cut_tree ([2],Res)";
1124 "---(4) on S(606)..S(608)--------";
1125 val (pt', cuts) = cut_tree pt ([3],Pbl);
1129 if cuts = [([3], Pbl),
1130 ([3, 1], Frm), ([3, 1], Res),
1131 ([3, 2, 1], Frm), ([3, 2, 1], Res), ([3, 2, 2], Res),
1135 (*WN060727 added after replacing cutlevup by test_trans:*)([], Res)]
1136 then () else error "ctree.sml: diff.behav. cut_tree ([3],Pbl)";
1138 "---(5a) on S(606)..S(608) cut_tree --------";
1139 val (pt', cuts) = cut_tree pt ([3,2,1],Res);
1143 if cuts = [([3, 2, 2], Res), ([3, 2], Res),
1144 (*WN060727 added after replacing cutlevup by test_trans:*)
1145 ([3], Res), ([4], Res),([],Res)] then ()
1146 else error "ctree.sml: diff.behav. cut_tree ([3,2,1],Res)";
1150 "-------------- cappend on complete ctree from above -------------";
1151 "-------------- cappend on complete ctree from above -------------";
1152 "-------------- cappend on complete ctree from above -------------";
1155 "---(2) on S(606)..S(608)--------";
1156 val (pt', cuts) = cappend_atomic pt [1] e_istate (str2term "Inform[1]")
1157 (Tac "test") (str2term "Inres[1]",[]) Complete;
1161 if cuts = [([2, 1], Frm), ([2, 1], Res), ([2, 2], Res), ([2, 3], Res),
1162 ([2, 4], Res), ([2, 5], Res), ([2, 6], Res), ([2], Res), ([3], Pbl),
1163 ([3, 1], Frm), ([3, 1], Res), ([3, 2, 1], Frm), ([3, 2, 1], Res),
1164 ([3, 2, 2], Res), ([3, 2], Res), ([3], Res), ([4], Res),
1165 (*WN060727 added after replacing cutlevup by test_trans:*) ([], Res)] then ()
1166 else error "ctree.sml: diff:behav. in complete pt:append_atomic[1] cuts";
1167 val afterins = get_allp [] ([], ([],Frm)) pt';
1171 if afterins = [([1], Frm), ([1], Res)
1172 (*, WN060727 removed after replacing cutlevup by test_trans:([], Res)*)] then()
1173 else error "ctree.sml: diff:behav. in complete pt: append_atomic[1] afterins";
1176 "---(3) on S(606)..S(608)--------";
1178 val (pt', cuts) = cappend_atomic pt [2] e_istate (str2term "Inform[2]")
1179 (Tac "test") (str2term "Inres[2]",[]) Complete;
1183 if cuts = [([2, 1], Frm), ([2, 1], Res), ([2, 2], Res), ([2, 3], Res),
1184 ([2, 4], Res), ([2, 5], Res), ([2, 6], Res), ([2], Res), ([3], Pbl),
1185 ([3, 1], Frm),([3, 1], Res), ([3, 2, 1], Frm), ([3, 2, 1], Res),
1186 ([3, 2, 2], Res), ([3, 2], Res), ([3], Res), ([4], Res),
1187 (*WN060727 added after replacing cutlevup by test_trans:*) ([], Res)] then ()
1188 else error "ctree.sml: diff:behav.in complete pt: append_atomic[2] cuts";
1189 val afterins = get_allp [] ([], ([],Frm)) pt';
1193 if afterins = [([1], Frm), ([1], Res), ([2], Frm), ([2], Res)
1194 (*, WN060727 removed after replacing cutlevup by test_trans:([], Res)*)]
1196 error "ctree.sml: diff:behav. in complete pt: append_atomic[2] afterins";
1199 val p = move_dn [] pt' ([],Pbl) (*-> ([1],Frm)*);
1200 val p = move_dn [] pt' p (*-> ([1],Res)*);
1201 val p = move_dn [] pt' p (*-> ([2],Frm)*);
1202 val p = move_dn [] pt' p (*-> ([2],Res)*);
1204 term2str (get_obj g_form pt' [2]);
1205 term2str (get_obj g_res pt' [2]);
1206 ostate2str (get_obj g_ostate pt' [2]);
1209 "---(4) on S(606)..S(608)--------";
1210 val (pt', cuts) = cappend_problem pt [3] e_istate ([],e_spec)
1211 ([],e_spec, str2term "Inhead[3]");
1215 if cuts = [([3], Pbl),
1216 ([3, 1], Frm), ([3, 1], Res),
1217 ([3, 2, 1], Frm), ([3, 2, 1], Res), ([3, 2, 2], Res),
1219 ([3], Res), ([4], Res),
1220 (*WN060727 added after replacing cutlevup by test_trans*)([], Res)] then ()else
1221 error "ctree.sml: diff:behav. in ccomplete pt: append_problem[3] cuts";
1222 val afterins = get_allp [] ([], ([],Frm)) pt';
1227 [([1], Frm), ([1], Res),([2, 1], Frm), ([2, 1], Res), ([2, 2], Res),
1228 ([2, 3], Res), ([2, 4], Res), ([2, 5], Res), ([2, 6], Res), ([2], Res),
1229 ([3], Pbl)] then () else
1230 error "ctree.sml: diff:behav.in complete pt: append_problem[3] afterins";
1231 (* use"systest/ctree.sml";
1235 "---(6-1) on S(606)..S(608)--------";
1236 val (pt', cuts) = cappend_atomic pt [3,1] e_istate (str2term "Inform[3,1]")
1237 (Tac "test") (str2term "Inres[3,1]",[]) Complete;
1241 if cuts = [([3, 2, 1], Frm), ([3, 2, 1], Res), ([3, 2, 2], Res),
1243 (*WN060727 added*)([3], Res), ([4], Res), ([], Res)] then () else
1244 error "ctree.sml: diff:behav. in complete pt: append_atomic[3,1] cuts";
1245 val afterins = get_allp [] ([], ([],Frm)) pt';
1249 (*WN060727 replaced after overwriting cutlevup by test_trans
1250 if afterins = [([1], Frm), ([1], Res),
1251 ([2, 1], Frm), ([2, 1], Res), ([2, 2], Res),
1252 ([2, 3], Res), ([2, 4], Res), ([2, 5], Res), ([2, 6], Res),
1255 ([3, 1], Frm), ([3, 1], Res)(*replaced*), (*([3, 2], Res) cut!*)
1256 ([3], Res)(*cutlevup=false*),
1258 ([], Res)(*cutlevup=false*)] then () else
1259 error "ctree.sml: diff:behav. in complete pt: append_atomic[3,1] insrtd";
1261 if afterins = [([1], Frm), ([1], Res),
1262 ([2, 1], Frm), ([2, 1], Res), ([2, 2], Res),
1263 ([2, 3], Res), ([2, 4], Res), ([2, 5], Res), ([2, 6], Res),
1266 ([3, 1], Frm), ([3, 1], Res)] then () else
1267 error "ctree.sml: diff:behav. in complete pt: append_atomic[3,1] insrtd";
1269 if term2str (get_obj g_form pt' [3,1]) = "Inform [3, 1]" then () else
1270 error "ctree.sml: diff:behav. in complete pt: append_atomic[3,1] Inform";
1272 "---(6) on S(606)..S(608)--------";
1273 val (pt', cuts) = cappend_atomic pt [3,2] e_istate (str2term "Inform[3,2]")
1274 (Tac "test") (str2term "Inres[3,2]",[]) Complete;
1278 if cuts = [(*just after is: cutlevup=false in [3]*)
1279 (*WN060727 after test_trans instead cutlevup added:*)
1280 ([3], Res), ([4], Res), ([], Res)] then () else
1281 error "ctree.sml: diff:behav. in complete pt: append_atomic[3,2] cuts";
1282 val afterins = get_allp [] ([], ([],Frm)) pt';
1286 (*WN060727 replaced after overwriting cutlevup by test_trans
1287 if afterins = [([1], Frm), ([1], Res),
1288 ([2, 1], Frm), ([2, 1], Res), ([2, 2], Res),
1289 ([2, 3], Res), ([2, 4], Res), ([2, 5], Res), ([2, 6], Res),
1292 ([3, 1], Frm), ([3, 1], Res), ([3, 2], Frm), ([3, 2], Res),
1294 ([4], Res), ([], Res)] then () else
1295 error "ctree.sml: diff:behav. in complete pt: append_atomic[3,2] insrtd";
1297 if afterins = [([1], Frm), ([1], Res),
1298 ([2, 1], Frm), ([2, 1], Res), ([2, 2], Res),
1299 ([2, 3], Res), ([2, 4], Res), ([2, 5], Res), ([2, 6], Res),
1302 ([3, 1], Frm), ([3, 1], Res), ([3, 2], Frm), ([3, 2], Res)]
1304 error "ctree.sml: diff:behav. in complete pt: append_atomic[3,2] insrtd";
1306 if term2str (get_obj g_form pt' [3,2]) = "Inform [3, 2]" then () else
1307 error "ctree.sml: diff:behav. in complete pt: append_atomic[3,2] Inform";
1309 "---(6++) on S(606)..S(608)--------";
1311 val (pt', cuts) = cappend_atomic pt [3,2,1] e_istate (str2term "Inform[3,2,1]")
1312 (Tac "test") (str2term "Inres[3,2,1]",[]) Complete;
1316 if cuts = [([3, 2, 2], Res), ([3, 2], Res),
1317 (*WN060727 {cutlevup->test_trans} added:*)([3], Res), ([4], Res), ([], Res)]
1319 error "ctree.sml: diff:behav. in complete pt: append_atomic[3,2,1] cuts";
1320 val afterins = get_allp [] ([], ([],Frm)) pt';
1324 if afterins = [([1], Frm), ([1], Res),
1325 ([2, 1], Frm), ([2, 1], Res), ([2, 2], Res),
1326 ([2, 3], Res), ([2, 4], Res), ([2, 5], Res), ([2, 6], Res),
1329 ([3, 1], Frm), ([3, 1], Res),
1330 ([3, 2, 1], Frm), ([3, 2, 1], Res)] then () else
1331 error "ctree.sml: diff:behav. in complete pt: append_atom[3,2,1] insrtd";
1332 if term2str (get_obj g_form pt' [3,2,1]) = "Inform [3, 2, 1]" then () else
1333 error "ctree.sml: diff:behav. complete pt: append_atomic[3,2,1] Inform";
1339 ===== inhibit exn ?===========================================================*)