wneuper/isa: test/Tools/isac/Interpret/ctree.sml@3228aa46fd30

     1 (* tests for sml/ME/ctree.sml

     2    authors: Walther Neuper 060113

     3    (c) due to copyright terms

     5 use"../smltest/ME/ctree.sml";

     6 use"ctree.sml";

     7 *)

     9 "-----------------------------------------------------------------";

    10 "table of contents -----------------------------------------------";

    11 "-----------------------------------------------------------------";

    12 "-----------------------------------------------------------------";

    13 "-------------- build miniscript stepwise BEFORE ALL TESTS -------";

    14 "-------------- check positions in miniscript --------------------";

    15 "-------------- get_allpos' (from ptree above)--------------------";

    16 (**#####################################################################(**)

    17 "-------------- cut_level (from ptree above)----------------------";

    18 "-------------- cut_tree (from ptree above)-----------------------";

    19 "=====new ptree 1a miniscript with mini-subpbl ===================";

    20 "-------------- cut_level ( ,Frm) on Incomplete Nd ---------------";

    21 (**)#####################################################################**)

    22 "=====new ptree 2 miniscript with mini-subpbl ====================";

    23 "-------------- cut_tree (intermedi.ptree: 3rd level)-------------";

    24 "-------------- cappend (from ptree above)------------------------";

    25 "-------------- cappend minisubpbl -------------------------------";

    27 "=====new ptree 3 ================================================";

    28 "-------------- move_dn ------------------------------------------";

    29 "-------------- move_dn: Frm -> Res ------------------------------";

    30 "-------------- move_up ------------------------------------------";

    31 "------ move into detail -----------------------------------------";

    32 "=====new ptree 3a ===============================================";

    33 "-------------- move_dn in Incomplete ctree ----------------------";

    35 "=====new ptree 4: crooked by cut_level_'_ =======================";

    36 (*############## development stopped 0501 ########################*)

    37 (******************************************************************)

    38 (*              val SAVE_get_trace = get_trace;                   *)

    39 (******************************************************************)

    40 "-------------- get_interval from ctree: incremental development--";

    41 (******************************************************************)

    42 (*              val get_trace = SAVE_get_trace;                   *)

    43 (******************************************************************)

    44 (*############## development stopped 0501 ########################*)

    46 "=====new ptree 4 ratequation ====================================";

    47 "-------------- pt_extract form, tac, asm<>[] --------------------";

    48 "=====new ptree 5 minisubpbl =====================================";

    49 "-------------- pt_extract form, tac, asm ------------------------";

    51 (**#####################################################################(**)

    52 "=====new ptree 6 minisubpbl intersteps ==========================";

    53 "-------------- get_allpos' new ----------------------------------";

    54 "-------------- cut_tree new (from ptree above)-------------------";

    55 (**)#####################################################################**)

    57 "-----------------------------------------------------------------";

    58 "-----------------------------------------------------------------";

    59 "-----------------------------------------------------------------";

    62 "-------------- build miniscript stepwise BEFORE ALL TESTS -------";

    63 "-------------- build miniscript stepwise BEFORE ALL TESTS -------";

    64 "-------------- build miniscript stepwise BEFORE ALL TESTS -------";

    65 "this build should be detailed each time a test fails later       ";

    66 "i.e. all the tests should be caught here first                   ";

    67 "and linked with a reference to the respective test environment   ";

    68 val fmz = ["equality (x+1=(2::int))", (*FIRST OF ALL TESTS*) "solveFor x", "solutions L"];

    69 val (dI',pI',mI') = ("Test",["sqroot-test","univariate","equation","test"],

    70   ["Test","squ-equ-test-subpbl1"]);

    71 val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];

    72 val (p,_,f,nxt,_,pt) = me nxt p [] pt;

    73 val (p,_,f,nxt,_,pt) = me nxt p [] pt;

    74 val (p,_,f,nxt,_,pt) = me nxt p [] pt;

    79 "-------------- check positions in miniscript --------------------";

    80 "-------------- check positions in miniscript --------------------";

    81 "-------------- check positions in miniscript --------------------";

    82 val fmz = ["equality (x+1=(2::int))",

    83 	   "solveFor x","solutions L"];

    84 val (dI',pI',mI') =

    85   ("Test",["sqroot-test","univariate","equation","test"],

    86    ["Test","squ-equ-test-subpbl1"]);

    87 val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];

    88 val (p,_,f,nxt,_,pt) = me nxt p [1] pt;

    89 (* nxt = Add_Given "equality (x + 1 = 2)"

    90    (writeln o (itms2str_ ctxt)) (get_obj g_pbl pt (fst p));

    91    *)

    92 val (p,_,f,nxt,_,pt) = me nxt p [1] pt;

    93 (* (writeln o (itms2str_ ctxt)) (get_obj g_pbl pt (fst p));

    94    *)

    95 val (p,_,f,nxt,_,pt) = me nxt p [1] pt;

    96 (* (writeln o (itms2str_ ctxt)) (get_obj g_pbl pt (fst p));

    97    *)

    98 val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;

    99 val (p,_,f,nxt,_,pt) = me nxt p [1] pt;

   100 val (p,_,f,nxt,_,pt) = me nxt p [1] pt;

   101 "ctree.sml-------------- get_allpos' new ------------------------\"";

   102 val (PP, pp) = split_last [1];

   103 val ((pt', cuts), clevup) = cut_bottom (PP, pp) (get_nd pt PP);

   105 val cuts = get_allp [] ([], ([],Frm)) pt;

   106 val cuts2 = get_allps [] [1] (children pt);

   107 "ctree.sml-------------- cut_tree new (from ptree above)----------";

   108 val (pt', cuts) = cut_tree pt ([1],Frm);

   109 "ctree.sml-------------- cappend on complete ctree from above ----";

   110 val (pt', cuts) = cappend_form pt [1] (e_istate, e_ctxt) (str2term "Inform[1]");

   111 "----------------------------------------------------------------/";

   112 (*========== inhibit exn WN110319 ==============================================

   113 val (p,_,f,nxt,_,pt) = me nxt p [1] pt(*cappend_form: pos =[1]*);

   114 val (p,_,f,nxt,_,pt) = me nxt p [1] pt(*cappend_atomic: pos =[1]*);

   115 val (p,_,f,nxt,_,pt) = me nxt p [1] pt(*cappend_atomic: pos =[2]*);

   116 val (p,_,f,nxt,_,pt) = me nxt p [1] pt(*cappend_problem: pos =[3]*);

   118 val (p,_,f,nxt,_,pt) = me nxt p [1] pt;

   119 val (p,_,f,nxt,_,pt) = me nxt p [1] pt;

   120 (*val nxt = ("Add_Given", Add_Given "equality (-1 + x = 0)").....*)

   121 val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;

   122 val (p,_,f,nxt,_,pt) = me nxt p [1] pt;

   123 val (p,_,f,nxt,_,pt) = me nxt p [1] pt;

   124 val (p,_,f,nxt,_,pt) = me nxt p [1] pt;

   125 (*val nxt = ("Apply_Method", Apply_Method ["Test", "solve_linear"])*)

   127 val (p,_,f,nxt,_,pt) = me nxt p [1] pt(*cappend_form: pos =[3,1]*);

   128 val (p,_,f,nxt,_,pt) = me nxt p [1] pt(*cappend_atomic: pos =[3,1]*);

   129 val (p,_,f,nxt,_,pt) = me nxt p [1] pt(*cappend_atomic: pos =[3,2]*);

   130 val (p,_,f,nxt,_,pt) = me nxt p [1] pt(*.append_result: pos =[3]*);

   131 val (p,_,f,nxt,_,pt) = me nxt p [1] pt(*cappend_atomic: pos =[4]*);

   132 val (p,_,f,nxt,_,pt) = me nxt p [1] pt(*.append_result: pos =[]*);

   133 val Form' (FormKF (~1,EdUndef,0,Nundef,res)) = f;

   134 if (snd nxt)=End_Proof' andalso res="[x = 1]" then ()

   135 else error "new behaviour in test: miniscript with mini-subpbl";

   137  show_pt pt;

   138 ============ inhibit exn WN110319 ============================================*)

   140 (*=== inhibit exn ?=============================================================

   142 "-------------- get_allpos' (from ptree above)--------------------";

   143 "-------------- get_allpos' (from ptree above)--------------------";

   144 "-------------- get_allpos' (from ptree above)--------------------";

   145 if get_allpos' ([], 1) pt =

   146    [([], Frm),

   147     ([1], Frm),

   148     ([1], Res),

   149     ([2], Res),

   150     ([3], Frm),

   151     ([3, 1], Frm),

   152     ([3, 1], Res),

   153     ([3, 2], Res),

   154     ([3], Res),

   155     ([4], Res),

   156     ([], Res)]

   157 then () else error "ctree.sml: diff:behav. in get_allpos' 1";

   159 if get_allpos's ([], 1) (children pt) =

   160    [([1], Frm),

   161     ([1], Res),

   162     ([2], Res),

   163     ([3], Frm),

   164     ([3, 1], Frm),

   165     ([3, 1], Res),

   166     ([3, 2], Res),

   167     ([3], Res),

   168     ([4], Res)]

   169 then () else error "ctree.sml: diff:behav. in get_allpos' 2";

   171 if get_allpos's ([], 2) (takerest (1, children pt)) =

   172    [([2], Res),

   173     ([3], Frm),

   174     ([3, 1], Frm),

   175     ([3, 1], Res),

   176     ([3, 2], Res),

   177     ([3], Res),

   178     ([4], Res)]

   179 then () else error "ctree.sml: diff:behav. in get_allpos' 3";

   181 if get_allpos's ([], 3) (takerest (2, children pt)) =

   182    [([3], Frm),

   183     ([3, 1], Frm),

   184     ([3, 1], Res),

   185     ([3, 2], Res),

   186     ([3], Res),

   187     ([4], Res)]

   188 then () else error "ctree.sml: diff:behav. in get_allpos' 4";

   190 if get_allpos's ([3], 1) (children (nth 3 (children pt))) =

   191    [([3, 1], Frm),

   192     ([3, 1], Res),

   193     ([3, 2], Res)]

   194 then () else error "ctree.sml: diff:behav. in get_allpos' 5";

   196 if get_allpos' ([3], 1) (nth 3 (children pt)) =

   197    [([3], Frm),

   198     ([3, 1], Frm),

   199     ([3, 1], Res),

   200     ([3, 2], Res),

   201     ([3], Res)]

   202 then () else error "ctree.sml: diff:behav. in get_allpos' 6";

   205 (**##############################################################(**)

   207 "-------------- cut_level (from ptree above)----------------------";

   208 "-------------- cut_level (from ptree above)----------------------";

   209 "-------------- cut_level (from ptree above)----------------------";

   210 show_pt pt;

   211 show_pt pt';

   212 print_depth 99; cuts; print_depth 3;

   214 (*if cuts = [([2], Res),

   215 	   ([3], Frm),

   216 	   ([3, 1], Frm),

   217 	   ([3, 1], Res),

   218 	   ([3, 2], Res),

   219 	   ([3], Res),

   220 	   ([4], Res)]

   221 then () else error "ctree.sml: diff:behav. in cut_level 1a";

   222 val (res,asm) = get_obj g_result pt' [2];

   223 if res = e_term andalso asm = [] then () else

   224 error "ctree.sml: diff:behav. in cut_level 1aa" WN050219*);

   225 if not (existpt [2] pt') then () else

   226 error "ctree.sml: diff:behav. in cut_level 1aa2" (*WN050220*);

   228 val (res,asm) = get_obj g_result pt' [];

   229 if term2str res = "[x = 1]" (*WN050219 e_term in cut_tree!!!*) then () else

   230 error "ctree.sml: diff:behav. in cut_level 1ab";

   231 if map fst (get_interval ([],Frm) ([],Res) 9999 pt') =

   232    [([], Frm),

   233     ([1], Frm),

   234     ([1], Res),

   235     ([2], Res),(*, e_term in cut_tree!!!*)

   236     ([], Res)] then () else

   237 error "ctree.sml: diff:behav. in cut_level 1b";

   240 val (pt',cuts) = cut_level [] [] pt ([2],Res);

   241 if cuts = [([3], Frm),

   242 	   ([3, 1], Frm),

   243 	   ([3, 1], Res),

   244 	   ([3, 2], Res),

   245 	   ([3], Res),

   246 	   ([4], Res)]

   247 then () else error "ctree.sml: diff:behav. in cut_level 2a";

   249 if pr_ptree pr_short pt' = ".    ----- pblobj -----\n1.   x + 1 = 2\n2.   x + 1 + -1 * 2 = 0\n"

   250 then () else error "ctree.sml: diff:behav. in cut_level 2b";

   252 val (pt',cuts) = cut_level [] [3] pt ([3,1],Frm);

   253 if cuts = [([3, 1], Res), ([3, 2], Res)]

   254 then () else error "ctree.sml: diff:behav. in cut_level 3a";

   255 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"

   256 then () else error "ctree.sml: diff:behav. in cut_level 3b";

   258 val (pt',cuts) = cut_level [] [3] pt ([3,1],Res);

   259 if cuts = [([3, 2], Res)]

   260 then () else error "ctree.sml: diff:behav. in cut_level 4a";

   261 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"

   262 then () else error "ctree.sml: diff:behav. in cut_level 4b";

   265 "-------------- cut_tree (from ptree above)-----------------------";

   266 "-------------- cut_tree (from ptree above)-----------------------";

   267 "-------------- cut_tree (from ptree above)-----------------------";

   268 val (pt', cuts) = cut_tree pt ([2],Frm);(*not created by move_dn -- not on WS*)

   269 if cuts = [([2], Res),

   270 	   ([3], Frm),

   271 	   ([3, 1], Frm),

   272 	   ([3, 1], Res),

   273 	   ([3, 2], Res),

   274 	   ([3], Res),

   275 	   ([4], Res),

   276 	   ([], Res)]

   277 then () else error "ctree.sml: diff:behav. in cut_tree 1a";

   279 val (res,asm) = get_obj g_result pt' [2];

   280 if res = e_term (*WN050219 done by cut_level*) then () else

   281 error "ctree.sml: diff:behav. in cut_tree 1aa";

   283 val form = get_obj g_form pt' [2];

   284 if term2str form = "x + 1 + -1 * 2 = 0" (*remained !!!*) then () else

   285 error "ctree.sml: diff:behav. in cut_tree 1ab";

   287 val (res,asm) = get_obj g_result pt' [];

   288 if res = e_term (*WN050219 done by cut_tree*) then () else

   289 error "ctree.sml: diff:behav. in cut_tree 1ac";

   291 if map fst (get_interval ([],Frm) ([],Res) 9999 pt') =

   292    [([], Frm),

   293     ([1], Frm),

   294     ([1], Res)] then () else

   295 error "ctree.sml: diff:behav. in cut_tree 1ad";

   297 val (pt', cuts) = cut_tree pt ([2],Res);

   298 if cuts = [([3], Frm),

   299 	   ([3, 1], Frm),

   300 	   ([3, 1], Res),

   301 	   ([3, 2], Res),

   302 	   ([3], Res),

   303 	   ([4], Res),

   304 	   ([], Res)]

   305 then () else error "ctree.sml: diff:behav. in cut_tree 2";

   307 val (pt', cuts) = cut_tree pt ([3,1],Frm);

   308 if cuts = [([3, 1], Res),

   309 	   ([3, 2], Res),

   310 	   ([3], Res),

   311 	   ([4], Res),

   312 	   ([], Res)]

   313 then () else error "ctree.sml: diff:behav. in cut_tree 3";

   315 val (pt', cuts) = cut_tree pt ([3,1],Res);

   316 if cuts = [([3, 2], Res),

   317 	   ([3], Res),

   318 	   ([4], Res),

   319 	   ([], Res)]

   320 then () else error "ctree.sml: diff:behav. in cut_tree 4";

   323 "=====new ptree 1a miniscript with mini-subpbl ===================";

   324 "=====new ptree 1a miniscript with mini-subpbl ===================";

   325 "=====new ptree 1a miniscript with mini-subpbl ===================";

   326 val fmz = ["equality (x+1=2)",

   327 	   "solveFor x","solutions L"];

   328 val (dI',pI',mI') =

   329   ("Test",["sqroot-test","univariate","equation","test"],

   330    ["Test","squ-equ-test-subpbl1"]);

   331 val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];

   332 val (p,_,f,nxt,_,pt) = me nxt p [1] pt;

   333 val (p,_,f,nxt,_,pt) = me nxt p [1] pt;

   334 val (p,_,f,nxt,_,pt) = me nxt p [1] pt;

   335 val (p,_,f,nxt,_,pt) = me nxt p [1] pt;

   336 val (p,_,f,nxt,_,pt) = me nxt p [1] pt;

   337 val (p,_,f,nxt,_,pt) = me nxt p [1] pt;

   338 val (p,_,f,nxt,_,pt) = me nxt p [1] pt;

   339 val (p,_,f,nxt,_,pt) = me nxt p [1] pt;

   340 show_pt pt;

   342 "-------------- cut_level ( ,Frm) on Incomplete Nd ---------------";

   343 "-------------- cut_level ( ,Frm) on Incomplete Nd ---------------";

   344 "-------------- cut_level ( ,Frm) on Incomplete Nd ---------------";

   346 val (pt',cuts) = cut_level [] [3] pt ([1],Frm);(*([1],Frm) is stored*)

   347 if cuts = [](*([1],Res) is not yet stored (Nd.ostate=Incomplete)*)

   348 then () else error "ctree.sml: diff:behav. in cut_tree 4a";

   350 val (pt', cuts) = cut_tree pt ([1],Frm);

   351 if cuts = []

   352 then () else error "ctree.sml: diff:behav. in cut_tree 4a";

   354 (*WN050219

   355 val pos as ([p],_) = ([1],Frm);

   356 val pt as Nd (b,_) = pt;

   359 show_pt pt;

   360 show_pt pt';

   361 print_depth 99;cuts;print_depth 3;

   362 print_depth 99;map fst (get_interval ([],Frm) ([],Res) 9999 pt');print_depth 3;

   363 ####################################################################*)*)

   365 "=====new ptree 2 miniscript with mini-subpbl ====================";

   366 "=====new ptree 2 miniscript with mini-subpbl ====================";

   367 "=====new ptree 2 miniscript with mini-subpbl ====================";

   368  states:=[];

   369  CalcTree

   370  [(["equality (x+1=2)", "solveFor x","solutions L"],

   371    ("Test",

   372     ["sqroot-test","univariate","equation","test"],

   373     ["Test","squ-equ-test-subpbl1"]))];

   374  Iterator 1; moveActiveRoot 1;

   375  autoCalculate 1 CompleteCalc;

   377  interSteps 1 ([3,2],Res);

   379  val ((pt,_),_) = get_calc 1;

   380  show_pt pt;

   382 "-------------- cut_tree (intermedi.ptree: 3rd level)-------------";

   383 "-------------- cut_tree (intermedi.ptree: 3rd level)-------------";

   384 "-------------- cut_tree (intermedi.ptree: 3rd level)-------------";

   385 (*WN050225 intermed. outcommented

   386  val (pt', cuts) = cut_tree pt ([3,2,1],Frm);

   387  if cuts = [([3, 2, 1], Res),

   388 	    ([3, 2, 2], Res),

   389 	    ([3, 2], Res),

   390 	    ([3], Res),

   391 	    ([4], Res)]

   392  then () else error "ctree.sml: diff:behav. in cut_tree 3rd level 1";

   394  val (pt', cuts) = cut_tree pt ([3,2,1],Res);

   395  if cuts = [([3, 2, 2], Res),

   396 	    ([3, 2], Res),

   397 	    ([3], Res),

   398 	    ([4], Res)]

   399  then () else error "ctree.sml: diff:behav. in cut_tree 3rd level 2";

   402 "-------------- cappend (from ptree above)------------------------";

   403 "-------------- cappend (from ptree above)------------------------";

   404 "-------------- cappend (from ptree above)------------------------";

   405 val (pt',cuts) = cappend_form pt [3,2,1] e_istate (str2term "newnew");

   406 if cuts = [([3, 2, 1], Res),

   407 	   ([3, 2, 2], Res),

   408 	   ([3, 2], Res),

   409 	   ([3], Res),

   410 	   ([4], Res),

   411 	   ([], Res)]

   412 then () else error "ctree.sml: diff:behav. in cappend_form";

   413 if term2str (get_obj g_form pt' [3,2,1]) = "newnew" andalso

   414    get_obj g_tac pt' [3,2,1] = Empty_Tac andalso

   415    term2str (fst (get_obj g_result pt' [3,2,1])) = "??.empty"

   416  then () else error "ctree.sml: diff:behav. in cappend 1";

   418 val (pt',cuts) = cappend_atomic pt [3,2,1] e_istate (str2term "newform")

   419     (Tac "test") (str2term "newresult",[]) Complete;

   420 if cuts = [([3, 2, 1], Res), (*?????????????*)

   421 	   ([3, 2, 2], Res),

   422 	   ([3, 2], Res),

   423 	   ([3], Res),

   424 	   ([4], Res),

   425 	   ([], Res)]

   426 then () else error "ctree.sml: diff:behav. in cappend_atomic";

   430 "-------------- cappend minisubpbl -------------------------------";

   431 "-------------- cappend minisubpbl -------------------------------";

   432 "-------------- cappend minisubpbl -------------------------------";

   433 "=====new ptree 1 miniscript with mini-subpbl ====================";

   434 val fmz = ["equality (x+1=2)",

   435 	   "solveFor x","solutions L"];

   436 val (dI',pI',mI') =

   437   ("Test",["sqroot-test","univariate","equation","test"],

   438    ["Test","squ-equ-test-subpbl1"]);

   439 val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];

   440 val (p,_,f,nxt,_,pt) = me nxt p [1] pt;

   441 (* nxt = Add_Given "equality (x + 1 = 2)"

   442    (writeln o (itms2str_ ctxt)) (get_obj g_pbl pt (fst p));

   443    *)

   444 val (p,_,f,nxt,_,pt) = me nxt p [1] pt;

   445 (* (writeln o (itms2str_ ctxt)) (get_obj g_pbl pt (fst p));

   446    *)

   447 val (p,_,f,nxt,_,pt) = me nxt p [1] pt;

   448 (* (writeln o (itms2str_ ctxt)) (get_obj g_pbl pt (fst p));

   449    *)

   450 val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;

   451 val (p,_,f,nxt,_,pt) = me nxt p [1] pt;

   452 val (p,_,f,nxt,_,pt) = me nxt p [1] pt;

   453 (*###cappend_form: pos =[1]  ... while calculating nxt, which pt is dropped

   454 val nxt = ("Apply_Method", Apply_Method ["Test", "squ-equ-test-subpbl1"])*)

   456 (*val (p,_,f,nxt,_,pt) = me nxt p [1] pt(**)cappend_form: pos =[1]*);

   457 val p = ([1], Frm);

   458 val (pt,cuts) = cappend_form pt (fst p) e_istate (str2term "x + 1 = 2");

   459 val form = get_obj g_form pt (fst p);

   460 val (res,_) = get_obj g_result pt (fst p);

   461 if term2str form = "x + 1 = 2" andalso res = e_term then () else

   462 error "ctree.sml, diff.behav. cappend minisubpbl ([1],Frm)";

   463 if not (existpt ((lev_on o fst) p) pt) then () else

   464 error "ctree.sml, diff.behav. cappend minisubpbl ([1],Frm) nxt";

   466 (*val (p,_,f,nxt,_,pt) = me nxt p [1] pt(**)cappend_atomic: pos =[1]*);

   467 val p = ([1], Res);

   468 val (pt,cuts) =

   469     cappend_atomic pt (fst p) e_istate (str2term "x + 1 = 2")

   470 		   Empty_Tac (str2term "x + 1 + -1 * 2 = 0",[]) Incomplete;

   471 val form = get_obj g_form pt (fst p);

   472 val (res,_) = get_obj g_result pt (fst p);

   473 if term2str form = "x + 1 = 2" andalso term2str res = "x + 1 + -1 * 2 = 0"

   474 then () else error "ctree.sml, diff.behav. cappend minisubpbl ([1],Res)";

   475 if not (existpt ((lev_on o fst) p) pt) then () else

   476 error "ctree.sml, diff.behav. cappend minisubpbl ([1],Res) nxt";

   478 (*val (p,_,f,nxt,_,pt) = me nxt p [1] pt(**)cappend_atomic: pos =[2]*);

   479 val p = ([2], Res);

   480 val (pt,cuts) =

   481     cappend_atomic pt (fst p) e_istate (str2term "x + 1 + -1 * 2 = 0")

   482 		   Empty_Tac (str2term "-1 + x = 0",[]) Incomplete;

   483 val form = get_obj g_form pt (fst p);

   484 val (res,_) = get_obj g_result pt (fst p);

   485 if term2str form = "x + 1 + -1 * 2 = 0" andalso term2str res = "-1 + x = 0"

   486 then () else error "ctree.sml, diff.behav. cappend minisubpbl ([2],Res)";

   487 if not (existpt ((lev_on o fst) p) pt) then () else

   488 error "ctree.sml, diff.behav. cappend minisubpbl ([2],Res) nxt";

   491 (*val (p,_,f,nxt,_,pt) = me nxt p [1] pt;(**)cappend_problem: pos =[3]*)

   492 val p = ([3], Pbl);

   493 val (pt,cuts) = cappend_problem pt (fst p) e_istate e_fmz ([],e_spec,e_term);

   494 if is_pblobj (get_obj I pt (fst p)) then () else

   495 error "ctree.sml, diff.behav. cappend minisubpbl ([3],Pbl)";

   496 if not (existpt ((lev_on o fst) p) pt) then () else

   497 error "ctree.sml, diff.behav. cappend minisubpbl ([3],Pbl) nxt";

   499 (* ...complete calchead skipped...*)

   501 (*val (p,_,f,nxt,_,pt) = me nxt p [1] pt(**)cappend_form: pos =[3,1]*);

   502 val p = ([3, 1], Frm);

   503 val (pt,cuts) = cappend_form pt (fst p) e_istate (str2term "-1 + x = 0");

   504 val form = get_obj g_form pt (fst p);

   505 val (res,_) = get_obj g_result pt (fst p);

   506 if term2str form = "-1 + x = 0" andalso res = e_term then () else

   507 error "ctree.sml, diff.behav. cappend minisubpbl ([3,1],Frm)";

   508 if not (existpt ((lev_on o fst) p) pt) then () else

   509 error "ctree.sml, diff.behav. cappend minisubpbl ([3,1],Frm) nxt";

   511 (*val (p,_,f,nxt,_,pt) = me nxt p [1] pt;(**)cappend_atomic: pos =[3,1]*)

   512 val p = ([3, 1], Res);

   513 val (pt,cuts) =

   514     cappend_atomic pt (fst p) e_istate (str2term "-1 + x = 0")

   515 		   Empty_Tac (str2term "x = 0 + -1 * -1",[]) Incomplete;

   516 val form = get_obj g_form pt (fst p);

   517 val (res,_) = get_obj g_result pt (fst p);

   518 if term2str form = "-1 + x = 0" andalso term2str res = "x = 0 + -1 * -1" then()

   519 else error "ctree.sml, diff.behav. cappend minisubpbl ([3,1],Res)";

   520 if not (existpt ((lev_on o fst) p) pt) then () else

   521 error "ctree.sml, diff.behav. cappend minisubpbl ([3,1],Res) nxt";

   523 (*val (p,_,f,nxt,_,pt) = me nxt p [1] pt(**)cappend_form: pos =[3,1]*);

   524 (*val (p,_,f,nxt,_,pt) = me nxt p [1] pt(**)cappend_atomic: pos =[3,1]*);

   525 (*val (p,_,f,nxt,_,pt) = me nxt p [1] pt(**)cappend_atomic: pos =[3,2]*);

   526 (*val (p,_,f,nxt,_,pt) = me nxt p [1] pt(**).append_result: pos =[3]*);

   527 (*val (p,_,f,nxt,_,pt) = me nxt p [1] pt(**)cappend_atomic: pos =[4]*);

   528 (*val (p,_,f,nxt,_,pt) = me nxt p [1] pt(**).append_result: pos =[]*);

   530 WN050225 intermed. outcommented---*)

   532 "=====new ptree 3 ================================================";

   533 "=====new ptree 3 ================================================";

   534 "=====new ptree 3 ================================================";

   535  states:=[];

   536  CalcTree

   537  [(["equality (x+1=2)", "solveFor x","solutions L"],

   538    ("Test",

   539     ["sqroot-test","univariate","equation","test"],

   540     ["Test","squ-equ-test-subpbl1"]))];

   541  Iterator 1; moveActiveRoot 1;

   542  autoCalculate 1 CompleteCalc;

   544  val ((pt,_),_) = get_calc 1;

   545  show_pt pt;

   547 "-------------- move_dn ------------------------------------------";

   548 "-------------- move_dn ------------------------------------------";

   549 "-------------- move_dn ------------------------------------------";

   550  val p = move_dn [] pt ([],Pbl) (*-> ([1],Frm)*);

   551  val p = move_dn [] pt p        (*-> ([1],Res)*);

   552  val p = move_dn [] pt p        (*-> ([2],Res)*);

   553  val p = move_dn [] pt p        (*-> ([3],Pbl)*);

   554  val p = move_dn [] pt p        (*-> ([3,1],Frm)*);

   555  val p = move_dn [] pt p        (*-> ([3,1],Res)*);

   556  val p = move_dn [] pt p        (*-> ([3,2],Res)*);

   557  val p = move_dn [] pt p        (*-> ([3],Res)*);

   558 (* term2str (get_obj g_res pt [3]);

   559    term2str (get_obj g_form pt [4]);

   560    *)

   561  val p = move_dn [] pt p        (*-> ([4],Res)*);

   562  val p = move_dn [] pt p        (*-> ([],Res)*);

   563 (*

   564  val p = (move_dn [] pt p) handle e => print_exn_G e;

   565                                   Exception PTREE end of calculation*)

   566 if p=([],Res) then () else error "ctree.sml: diff:behav. in move_dn";

   569 "-------------- move_dn: Frm -> Res ------------------------------";

   570 "-------------- move_dn: Frm -> Res ------------------------------";

   571 "-------------- move_dn: Frm -> Res ------------------------------";

   572  states := [];

   573  CalcTree      (*start of calculation, return No.1*)

   574      [(["equality (1+-1*2+x=0)", "solveFor x","solutions L"],

   575        ("Test",

   576 	["linear","univariate","equation","test"],

   577 	["Test","solve_linear"]))];

   578  Iterator 1; moveActiveRoot 1;

   579  autoCalculate 1 CompleteCalcHead;

   580  autoCalculate 1 (Step 1);

   581  refFormula 1 (get_pos 1 1);

   583  moveActiveRoot 1;

   584  moveActiveDown 1;

   585  if get_pos 1 1 = ([1], Frm) then ()

   586  else error "ctree.sml: diff.behav. in move_dn: Frm -> Res (1)";

   587  moveActiveDown 1; (*<ERROR> pos does not exist </ERROR>*)

   589  autoCalculate 1 (Step 1);

   590  refFormula 1 (get_pos 1 1);

   592  moveActiveDown 1; (*<ERROR> pos does not exist </ERROR>*)

   593  if get_pos 1 1 = ([1], Res) then ()

   594  else error "ctree.sml: diff.behav. in move_dn: Frm -> Res (1)";

   595  moveActiveDown 1; (*<ERROR> pos does not exist </ERROR>*)

   598 "-------------- move_up ------------------------------------------";

   599 "-------------- move_up ------------------------------------------";

   600 "-------------- move_up ------------------------------------------";

   601  val p = move_up [] pt ([],Res); (*-> ([4],Res)*)

   602  val p = move_up [] pt p;        (*-> ([3],Res)*)

   603  val p = move_up [] pt p;        (*-> ([3,2],Res)*)

   604  val p = move_up [] pt p;        (*-> ([3,1],Res)*)

   605  val p = move_up [] pt p;        (*-> ([3,1],Frm)*)

   606  val p = move_up [] pt p;        (*-> ([3],Pbl)*)

   607  val p = move_up [] pt p;        (*-> ([2],Res)*)

   608  val p = move_up [] pt p;        (*-> ([1],Res)*)

   609  val p = move_up [] pt p;        (*-> ([1],Frm)*)

   610  val p = move_up [] pt p;        (*-> ([],Pbl)*)

   611 (*val p = (move_up [] pt p) handle e => print_exn_G e;

   612                                   Exception PTREE begin of calculation*)

   613 if p=([],Pbl) then () else error "ctree.sml: diff.behav. in move_up";

   616 "------ move into detail -----------------------------------------";

   617 "------ move into detail -----------------------------------------";

   618 "------ move into detail -----------------------------------------";

   619  states:=[];

   620  CalcTree

   621  [(["equality (x+1=2)", "solveFor x","solutions L"],

   622    ("Test",

   623     ["sqroot-test","univariate","equation","test"],

   624     ["Test","squ-equ-test-subpbl1"]))];

   625  Iterator 1; moveActiveRoot 1;

   626  autoCalculate 1 CompleteCalc;

   627  moveActiveRoot 1;

   628  moveActiveDown 1;

   629  moveActiveDown 1;

   630  moveActiveDown 1;

   631  refFormula 1 (get_pos 1 1) (* 2 Res, <ISA> -1 + x = 0 </ISA> *);

   633  interSteps 1 ([2],Res);

   635  val ((pt,_),_) = get_calc 1; show_pt pt;

   636  val p = get_pos 1 1;

   638  val p = move_up [] pt p;     (*([2, 6], Res)*);

   639  val p = movelevel_up [] pt p;(*([2], Frm)*);

   640  val p = move_dn [] pt p;     (*([2, 1], Frm)*);

   641  val p = move_dn [] pt p;     (*([2, 1], Res)*);

   642  val p = move_dn [] pt p;     (*([2, 2], Res)*);

   643  val p = move_dn [] pt p;     (*([2, 3], Res)*);

   644  val p = move_dn [] pt p;     (*([2, 4], Res)*);

   645  val p = move_dn [] pt p;     (*([2, 5], Res)*);

   646  val p = move_dn [] pt p;     (*([2, 6], Res)*);

   647  if p = ([2, 6], Res) then()

   648  else error "ctree.sml: diff.behav. in move into detail";

   650 "=====new ptree 3a ===============================================";

   651 "=====new ptree 3a ===============================================";

   652 "=====new ptree 3a ===============================================";

   653  states:=[];

   654  CalcTree

   655  [(["equality (x+1=2)", "solveFor x","solutions L"],

   656    ("Test",

   657     ["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*);

   674 (*

   675  get_obj g_ostate pt [1];

   676  show_pt pt;

   677 *)

   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_'_ =======================";

   688 states:=[];

   689 CalcTree

   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*)

   744 www true [1,2];

   745 (*val it = "from  to" : string*)

   746 www true [1];

   747 (*val it = "from+to" : string*)

   749 local

   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

   764     in case cas of

   765 	   NONE => term2str (pblterm dI pI)

   766 	 | SOME t => term2str (subst_atomic (mk_env probl) t)

   767     end;

   768 *)

   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);

   803 in

   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)

   809 (2) the 't' ar given

   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));

   816 end;

   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

   851 *)

   852 (*

   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";

   860 *)

   862 (******************************************************************)

   863 (**)            val get_trace = SAVE_get_trace;                 (**)

   864 (******************************************************************)

   867 "=====new ptree 4 ratequation ====================================";

   868 "=====new ptree 4 ratequation ====================================";

   869 "=====new ptree 4 ratequation ====================================";

   870 states:=[];

   871 CalcTree

   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;

   878 show_pt pt;

   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)",

   887      Subproblem

   888          ("PolyEq",

   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))",

   897      *)Subproblem

   898          ("PolyEq",

   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 =====================================";

   910 states:=[];

   911 CalcTree

   912  [(["equality (x+1=2)", "solveFor x","solutions L"],

   913    ("Test",

   914     ["sqroot-test","univariate","equation","test"],

   915     ["Test","squ-equ-test-subpbl1"]))];

   916 Iterator 1; moveActiveRoot 1;

   917 autoCalculate 1 CompleteCalc;

   918 val ((pt,_),_) = get_calc 1;

   919 show_pt pt;

   921 "-------------- pt_extract form, tac, asm ------------------------";

   922 "-------------- pt_extract form, tac, asm ------------------------";

   923 "-------------- pt_extract form, tac, asm ------------------------";

   924 val (ModSpec (_,_,form,_,_,_), SOME tac, asm) = pt_extract (pt, ([], Frm));

   925 case (term2str form, tac, terms2strs asm) of

   926     ("solve (x + 1 = 2, x)",

   927     Apply_Method ["Test", "squ-equ-test-subpbl1"],

   928      []) => ()

   929   | _ => error "diff.behav.in ctree.sml: pt_extract ([], Pbl)";

   931 val (Form form, SOME tac, asm) = pt_extract (pt, ([1], Frm));

   932 case (term2str form, tac, terms2strs asm) of

   933     ("x + 1 = 2", Rewrite_Set "norm_equation", []) => ()

   934   | _ => error "diff.behav.in ctree.sml: pt_extract ([1], Frm)";

   936 val (Form form, SOME tac, asm) = pt_extract (pt, ([1], Res));

   937 case (term2str form, tac, terms2strs asm) of

   938     ("x + 1 + -1 * 2 = 0", Rewrite_Set "Test_simplify", []) => ()

   939   | _ => error "diff.behav.in ctree.sml: pt_extract ([1], Res)";

   941 val (Form form, SOME tac, asm) = pt_extract (pt, ([2], Res));

   942 case (term2str form, tac, terms2strs asm) of

   943     ("-1 + x = 0",

   944      Subproblem ("Test", ["linear", "univariate", "equation", "test"]),

   945      []) => ()

   946   | _ => error "diff.behav.in ctree.sml: pt_extract ([2], Res)";

   948 val (ModSpec (_,_,form,_,_,_), SOME tac, asm) = pt_extract (pt, ([3], Pbl));

   949 case (term2str form, tac, terms2strs asm) of

   950     ("solve (-1 + x = 0, x)", Apply_Method ["Test", "solve_linear"], []) => ()

   951   | _ => error "diff.behav.in ctree.sml: pt_extract ([3], Pbl)";

   953 val (Form form, SOME tac, asm) = pt_extract (pt, ([3,1], Frm));

   954 case (term2str form, tac, terms2strs asm) of

   955     ("-1 + x = 0", Rewrite_Set_Inst (["(bdv, x)"], "isolate_bdv"), []) => ()

   956   | _ => error "diff.behav.in ctree.sml: pt_extract ([3,1], Frm)";

   958 val (Form form, SOME tac, asm) = pt_extract (pt, ([3,1], Res));

   959 case (term2str form, tac, terms2strs asm) of

   960     ("x = 0 + -1 * -1", Rewrite_Set "Test_simplify", []) => ()

   961   | _ => error "diff.behav.in ctree.sml: pt_extract ([3,1], Res)";

   963 val (Form form, SOME tac, asm) = pt_extract (pt, ([3,2], Res));

   964 case (term2str form, tac, terms2strs asm) of

   965     ("x = 1", Check_Postcond ["linear", "univariate", "equation", "test"],

   966      []) => ()

   967   | _ => error "diff.behav.in ctree.sml: pt_extract ([3,2], Res)";

   969 val (Form form, SOME tac, asm) = pt_extract (pt, ([3], Res));

   970 case (term2str form, tac, terms2strs asm) of

   971     ("[x = 1]", Check_elementwise "Assumptions", []) => ()

   972   | _ => error "diff.behav.in ctree.sml: pt_extract ([3], Res)";

   974 val (Form form, SOME tac, asm) = pt_extract (pt, ([4], Res));

   975 case (term2str form, tac, terms2strs asm) of

   976     ("[x = 1]",

   977      Check_Postcond ["sqroot-test", "univariate", "equation", "test"],

   978      []) => ()

   979   | _ => error "diff.behav.in ctree.sml: pt_extract ([4], Res)";

   981 val (Form form, tac, asm) = pt_extract (pt, ([], Res));

   982 case (term2str form, tac, terms2strs asm) of

   983     ("[x = 1]", NONE, []) => ()

   984   | _ => error "diff.behav.in ctree.sml: pt_extract ([], Res)";

   986 "=====new ptree 6 minisubpbl intersteps ==========================";

   987 "=====new ptree 6 minisubpbl intersteps ==========================";

   988 "=====new ptree 6 minisubpbl intersteps ==========================";

   989 states:=[];

   990 CalcTree

   991  [(["equality (x+1=2)", "solveFor x","solutions L"],

   992    ("Test",

   993     ["sqroot-test","univariate","equation","test"],

   994     ["Test","squ-equ-test-subpbl1"]))];

   995 Iterator 1; moveActiveRoot 1;

   996 autoCalculate 1 CompleteCalc;

   997 interSteps 1 ([2],Res);

   998 interSteps 1 ([3,2],Res);

   999 val ((pt,_),_) = get_calc 1;

  1000 show_pt pt;

  1002 (**##############################################################**)

  1003 "-------------- get_allpos' new ----------------------------------";

  1004 "-------------- get_allpos' new ----------------------------------";

  1005 "-------------- get_allpos' new ----------------------------------";

  1006 "--- whole ctree";

  1007 print_depth 99;

  1008 val cuts = get_allp [] ([], ([],Frm)) pt;

  1009 print_depth 3;

  1010 if cuts =

  1011    [(*never returns the first pos'*)

  1012     ([1], Frm),

  1013     ([1], Res),

  1014     ([2, 1], Frm), ([2, 1], Res), ([2, 2], Res), ([2, 3], Res),

  1015     ([2, 4], Res), ([2, 5], Res), ([2, 6], Res),

  1016     ([2], Res),

  1017     ([3], Pbl),

  1018     ([3, 1], Frm), ([3, 1], Res),

  1019     ([3, 2, 1], Frm), ([3, 2, 1], Res), ([3, 2, 2], Res),

  1020     ([3, 2], Res),

  1021     ([3], Res),

  1022     ([4], Res),

  1023     ([], Res)] then () else

  1024 error "ctree.sml diff.behav. get_allp new []";

  1026 print_depth 99;

  1027 val cuts2 = get_allps [] [1] (children pt);

  1028 print_depth 3;

  1029 if cuts = cuts2 @ [([], Res)] then () else

  1030 error "ctree.sml diff.behav. get_allps new []";

  1032 "---(3) on S(606)..S(608)--------";

  1033 "--- nd [2] with 6 children---------------------------------";

  1034 val cuts = get_allp [] ([2], ([],Frm)) (get_nd pt [2]);

  1035 if cuts =

  1036    [([2, 1], Frm), ([2, 1], Res), ([2, 2], Res), ([2, 3], Res),

  1037     ([2, 4], Res), ([2, 5], Res), ([2, 6], Res),

  1038     ([2], Res)] then () else

  1039 error "ctree.sml diff.behav. get_allp new [2]";

  1041 val cuts2 = get_allps [] [2,1] (children (get_nd pt [2]));

  1042 if cuts = cuts2 @ [([2], Res)] then () else

  1043 error "ctree.sml diff.behav. get_allps new [2]";

  1046 "---(4) on S(606)..S(608)--------";

  1047 "--- nd [3] subproblem--------------------------------------";

  1048 val cuts = get_allp [] ([3], ([],Frm)) (get_nd pt [3]);

  1049 if cuts =

  1050    [([3, 1], Frm),

  1051     ([3, 1], Res),

  1052     ([3, 2, 1], Frm), ([3, 2, 1], Res), ([3, 2, 2], Res),

  1053     ([3, 2], Res),

  1054     ([3], Res)] then () else

  1055 error "ctree.sml diff.behav. get_allp new [3]";

  1057 val cuts2 = get_allps [] [3,1] (children (get_nd pt [3]));

  1058 if cuts = cuts2 @ [([3], Res)] then () else

  1059 error "ctree.sml diff.behav. get_allps new [3]";

  1061 "--- nd [3,2] with 2 children--------------------------------";

  1062 val cuts = get_allp [] ([3,2], ([],Frm)) (get_nd pt [3,2]);

  1063 if cuts =

  1064    [([3, 2, 1], Frm), ([3, 2, 1], Res), ([3, 2, 2], Res),

  1065     ([3, 2], Res)] then () else

  1066 error "ctree.sml diff.behav. get_allp new [3,2]";

  1068 val cuts2 = get_allps [] [3,2,1] (children (get_nd pt [3,2]));

  1069 if cuts = cuts2 @ [([3, 2], Res)] then () else

  1070 error "ctree.sml diff.behav. get_allps new [3,2]";

  1072 "---(5a) on S(606)..S(608)--------";

  1073 "--- nd [3,2,1] with 0 children------------------------------";

  1074 val cuts = get_allp [] ([3,2,1], ([],Frm)) (get_nd pt [3,2,1]);

  1075 if cuts =

  1076    [] then () else

  1077 error "ctree.sml diff.behav. get_allp new [3,2,1]";

  1079 val cuts2 = get_allps [] [3,2,1,1] (children (get_nd pt [3,2,1]));

  1080 if cuts = cuts2 @ [] then () else

  1081 error "ctree.sml diff.behav. get_allps new [3,2,1]";

  1084 (**#################################################################**)

  1085 "-------------- cut_tree new (from ptree above)-------------------";

  1086 "-------------- cut_tree new (from ptree above)-------------------";

  1087 "-------------- cut_tree new (from ptree above)-------------------";

  1088 show_pt pt;

  1089 val b = get_obj g_branch pt [];

  1090 if b = TransitiveB then () else

  1091 error ("ctree.sml diff.behav. in [] branch="^branch2str b);

  1092 val b = get_obj g_branch pt [3];

  1093 if b = TransitiveB then () else

  1094 error ("ctree.sml diff.behav. in [3] branch="^branch2str b);

  1096 "---(2) on S(606)..S(608)--------";

  1097 val (pt', cuts) = cut_tree pt ([1],Res);

  1098 print_depth 99;

  1099 cuts;

  1100 print_depth 3;

  1101 if cuts = [([2, 1], Frm), ([2, 1], Res), ([2, 2], Res), ([2, 3], Res),

  1102       ([2, 4], Res), ([2, 5], Res), ([2, 6], Res), ([2], Res), ([3], Pbl),

  1103       ([3, 1], Frm), ([3, 1], Res), ([3, 2, 1], Frm), ([3, 2, 1], Res),

  1104       ([3, 2, 2], Res), ([3, 2], Res), ([3], Res), ([4], Res),

  1105 (*WN060727 after replacing cutlevup by test_trans:*)([], Res)] then () else

  1106 error "ctree.sml: diff.behav. cut_tree ([1],Res)";

  1109 "---(3) on S(606)..S(608)--------";

  1110 val (pt', cuts) = cut_tree pt ([2],Res);

  1111 print_depth 99;

  1112 cuts;

  1113 print_depth 3;

  1114 if cuts = [(*preceding step on WS was ([1]),Res*)

  1115 	   ([2, 1], Frm), ([2, 1], Res), ([2, 2], Res), ([2, 3], Res),

  1116 	   ([2, 4], Res), ([2, 5], Res), ([2, 6], Res),

  1117 	   ([2], Res),

  1118 	   ([3], Pbl),

  1119 	   ([3, 1], Frm),

  1120 	   ([3, 1], Res),

  1121 	   ([3, 2, 1], Frm), ([3, 2, 1], Res), ([3, 2, 2], Res),

  1122 	   ([3, 2], Res),

  1123 	   ([3], Res),

  1124 	   ([4], Res),

  1125 (*WN060727 added after replacing cutlevup by test_trans:*)([],Res)] then ()

  1126 else error "ctree.sml: diff.behav. cut_tree ([2],Res)";

  1128 "---(4) on S(606)..S(608)--------";

  1129 val (pt', cuts) = cut_tree pt ([3],Pbl);

  1130 print_depth 99;

  1131 cuts;

  1132 print_depth 3;

  1133 if cuts = [([3], Pbl),

  1134 	   ([3, 1], Frm), ([3, 1], Res),

  1135 	   ([3, 2, 1], Frm), ([3, 2, 1], Res), ([3, 2, 2], Res),

  1136 	   ([3, 2], Res),

  1137 	   ([3], Res),

  1138 	   ([4], Res),

  1139 (*WN060727 added after replacing cutlevup by test_trans:*)([], Res)]

  1140 then () else error "ctree.sml: diff.behav. cut_tree ([3],Pbl)";

  1142 "---(5a) on S(606)..S(608) cut_tree --------";

  1143 val (pt', cuts) = cut_tree pt ([3,2,1],Res);

  1144 print_depth 99;

  1145 cuts;

  1146 print_depth 1;

  1147 if cuts = [([3, 2, 2], Res), ([3, 2], Res),

  1148 (*WN060727 added after replacing cutlevup by test_trans:*)

  1149 ([3], Res), ([4], Res),([],Res)] then ()

  1150 else error "ctree.sml: diff.behav. cut_tree ([3,2,1],Res)";

  1151 show_pt pt';

  1154 "-------------- cappend on complete ctree from above -------------";

  1155 "-------------- cappend on complete ctree from above -------------";

  1156 "-------------- cappend on complete ctree from above -------------";

  1157 show_pt pt;

  1159 "---(2) on S(606)..S(608)--------";

  1160 val (pt', cuts) = cappend_atomic pt [1] e_istate (str2term "Inform[1]")

  1161     (Tac "test") (str2term "Inres[1]",[]) Complete;

  1162 print_depth 99;

  1163 cuts;

  1164 print_depth 3;

  1165 if cuts = [([2, 1], Frm), ([2, 1], Res), ([2, 2], Res), ([2, 3], Res),

  1166       ([2, 4], Res), ([2, 5], Res), ([2, 6], Res), ([2], Res), ([3], Pbl),

  1167       ([3, 1], Frm), ([3, 1], Res), ([3, 2, 1], Frm), ([3, 2, 1], Res),

  1168       ([3, 2, 2], Res), ([3, 2], Res), ([3], Res), ([4], Res),

  1169 (*WN060727 added after replacing cutlevup by test_trans:*) ([], Res)] then ()

  1170 else error "ctree.sml: diff:behav. in complete pt:append_atomic[1] cuts";

  1171 val afterins = get_allp [] ([], ([],Frm)) pt';

  1172 print_depth 99;

  1173 afterins;

  1174 print_depth 3;

  1175 if afterins = [([1], Frm), ([1], Res)

  1176 (*, WN060727 removed after replacing cutlevup by test_trans:([], Res)*)] then()

  1177 else error "ctree.sml: diff:behav. in complete pt: append_atomic[1] afterins";

  1178 show_pt pt';

  1180 "---(3) on S(606)..S(608)--------";

  1181 show_pt pt;

  1182 val (pt', cuts) = cappend_atomic pt [2] e_istate (str2term "Inform[2]")

  1183     (Tac "test") (str2term "Inres[2]",[]) Complete;

  1184 print_depth 99;

  1185 cuts;

  1186 print_depth 3;

  1187 if cuts = [([2, 1], Frm), ([2, 1], Res), ([2, 2], Res), ([2, 3], Res),

  1188       ([2, 4], Res), ([2, 5], Res), ([2, 6], Res), ([2], Res), ([3], Pbl),

  1189       ([3, 1], Frm),([3, 1], Res), ([3, 2, 1], Frm), ([3, 2, 1], Res),

  1190       ([3, 2, 2], Res), ([3, 2], Res), ([3], Res), ([4], Res),

  1191 (*WN060727 added after replacing cutlevup by test_trans:*) ([], Res)] then ()

  1192 else error "ctree.sml: diff:behav.in complete pt: append_atomic[2] cuts";

  1193 val afterins = get_allp [] ([], ([],Frm)) pt';

  1194 print_depth 99;

  1195 afterins;

  1196 print_depth 3;

  1197 if afterins = [([1], Frm), ([1], Res), ([2], Frm), ([2], Res)

  1198 (*,  WN060727 removed after replacing cutlevup by test_trans:([], Res)*)]

  1199 then () else

  1200 error "ctree.sml: diff:behav. in complete pt: append_atomic[2] afterins";

  1201 show_pt pt';

  1202 (*

  1203  val p = move_dn [] pt' ([],Pbl) (*-> ([1],Frm)*);

  1204  val p = move_dn [] pt' p        (*-> ([1],Res)*);

  1205  val p = move_dn [] pt' p        (*-> ([2],Frm)*);

  1206  val p = move_dn [] pt' p        (*-> ([2],Res)*);

  1208  term2str (get_obj g_form pt' [2]);

  1209  term2str (get_obj g_res pt' [2]);

  1210  ostate2str (get_obj g_ostate pt' [2]);

  1211  *)

  1213 "---(4) on S(606)..S(608)--------";

  1214 val (pt', cuts) = cappend_problem pt [3] e_istate ([],e_spec)

  1215 				  ([],e_spec, str2term "Inhead[3]");

  1216 print_depth 99;

  1217 cuts;

  1218 print_depth 3;

  1219 if cuts = [([3], Pbl),

  1220 	   ([3, 1], Frm), ([3, 1], Res),

  1221 	   ([3, 2, 1], Frm), ([3, 2, 1], Res), ([3, 2, 2], Res),

  1222 	   ([3, 2], Res),

  1223 	   ([3], Res), ([4], Res),

  1224 (*WN060727 added after replacing cutlevup by test_trans*)([], Res)] then ()else

  1225 error "ctree.sml: diff:behav. in ccomplete pt: append_problem[3] cuts";

  1226 val afterins = get_allp [] ([], ([],Frm)) pt';

  1227 print_depth 99;

  1228 afterins;

  1229 print_depth 3;

  1230 if afterins =

  1231    [([1], Frm), ([1], Res),([2, 1], Frm), ([2, 1], Res), ([2, 2], Res),

  1232     ([2, 3], Res), ([2, 4], Res), ([2, 5], Res), ([2, 6], Res), ([2], Res),

  1233     ([3], Pbl)] then () else

  1234 error "ctree.sml: diff:behav.in complete pt: append_problem[3] afterins";

  1235 (* use"systest/ctree.sml";

  1236    use"ctree.sml";

  1237    *)

  1239 "---(6-1) on S(606)..S(608)--------";

  1240 val (pt', cuts) = cappend_atomic pt [3,1] e_istate (str2term "Inform[3,1]")

  1241     (Tac "test") (str2term "Inres[3,1]",[]) Complete;

  1242 print_depth 99;

  1243 cuts;

  1244 print_depth 3;

  1245 if cuts = [([3, 2, 1], Frm), ([3, 2, 1], Res), ([3, 2, 2], Res),

  1246 	   ([3, 2], Res),

  1247 (*WN060727 added*)([3], Res), ([4], Res), ([], Res)] then () else

  1248 error "ctree.sml: diff:behav. in complete pt: append_atomic[3,1] cuts";

  1249 val afterins = get_allp [] ([], ([],Frm)) pt';

  1250 print_depth 99;

  1251 afterins;

  1252 print_depth 3;

  1253 (*WN060727 replaced after overwriting cutlevup by test_trans

  1254 if afterins = [([1], Frm), ([1], Res),

  1255 	       ([2, 1], Frm), ([2, 1], Res), ([2, 2], Res),

  1256 	       ([2, 3], Res), ([2, 4], Res), ([2, 5], Res), ([2, 6], Res),

  1257 	       ([2], Res),

  1258 	       ([3], Pbl),

  1259 	       ([3, 1], Frm), ([3, 1], Res)(*replaced*), (*([3, 2], Res) cut!*)

  1260 	       ([3], Res)(*cutlevup=false*),

  1261 	       ([4], Res),

  1262 	       ([], Res)(*cutlevup=false*)] then () else

  1263 error "ctree.sml: diff:behav. in complete pt: append_atomic[3,1] insrtd";

  1264 *)

  1265 if afterins = [([1], Frm), ([1], Res),

  1266 	       ([2, 1], Frm), ([2, 1], Res), ([2, 2], Res),

  1267 	       ([2, 3], Res), ([2, 4], Res), ([2, 5], Res), ([2, 6], Res),

  1268 	       ([2], Res),

  1269 	       ([3], Pbl),

  1270 	       ([3, 1], Frm), ([3, 1], Res)] then () else

  1271 error "ctree.sml: diff:behav. in complete pt: append_atomic[3,1] insrtd";

  1273 if term2str (get_obj g_form pt' [3,1]) = "Inform [3, 1]" then () else

  1274 error "ctree.sml: diff:behav. in complete pt: append_atomic[3,1] Inform";

  1276 "---(6) on S(606)..S(608)--------";

  1277 val (pt', cuts) = cappend_atomic pt [3,2] e_istate (str2term "Inform[3,2]")

  1278     (Tac "test") (str2term "Inres[3,2]",[]) Complete;

  1279 print_depth 99;

  1280 cuts;

  1281 print_depth 3;

  1282 if cuts = [(*just after is: cutlevup=false in [3]*)

  1283 (*WN060727 after test_trans instead cutlevup added:*)

  1284 	   ([3], Res), ([4], Res), ([], Res)] then () else

  1285 error "ctree.sml: diff:behav. in complete pt: append_atomic[3,2] cuts";

  1286 val afterins = get_allp [] ([], ([],Frm)) pt';

  1287 print_depth 99;

  1288 afterins;

  1289 print_depth 3;

  1290 (*WN060727 replaced after overwriting cutlevup by test_trans

  1291 if afterins = [([1], Frm), ([1], Res),

  1292 	       ([2, 1], Frm), ([2, 1], Res), ([2, 2], Res),

  1293 	       ([2, 3], Res), ([2, 4], Res), ([2, 5], Res), ([2, 6], Res),

  1294 	       ([2], Res),

  1295 	       ([3], Pbl),

  1296 	       ([3, 1], Frm), ([3, 1], Res), ([3, 2], Frm), ([3, 2], Res),

  1297 	       ([3], Res),

  1298 	       ([4], Res), ([], Res)] then () else

  1299 error "ctree.sml: diff:behav. in complete pt: append_atomic[3,2] insrtd";

  1300 *)

  1301 if afterins = [([1], Frm), ([1], Res),

  1302 	       ([2, 1], Frm), ([2, 1], Res), ([2, 2], Res),

  1303 	       ([2, 3], Res), ([2, 4], Res), ([2, 5], Res), ([2, 6], Res),

  1304 	       ([2], Res),

  1305 	       ([3], Pbl),

  1306 	       ([3, 1], Frm), ([3, 1], Res), ([3, 2], Frm), ([3, 2], Res)]

  1307 then () else

  1308 error "ctree.sml: diff:behav. in complete pt: append_atomic[3,2] insrtd";

  1310 if term2str (get_obj g_form pt' [3,2]) = "Inform [3, 2]" then () else

  1311 error "ctree.sml: diff:behav. in complete pt: append_atomic[3,2] Inform";

  1313 "---(6++) on S(606)..S(608)--------";

  1314 (**)

  1315 val (pt', cuts) = cappend_atomic pt [3,2,1] e_istate (str2term "Inform[3,2,1]")

  1316     (Tac "test") (str2term "Inres[3,2,1]",[]) Complete;

  1317 print_depth 99;

  1318 cuts;

  1319 print_depth 1;

  1320 if cuts = [([3, 2, 2], Res), ([3, 2], Res),

  1321 (*WN060727 {cutlevup->test_trans} added:*)([3], Res), ([4], Res), ([], Res)]

  1322 then () else

  1323 error "ctree.sml: diff:behav. in complete pt: append_atomic[3,2,1] cuts";

  1324 val afterins = get_allp [] ([], ([],Frm)) pt';

  1325 print_depth 99;

  1326 afterins;

  1327 print_depth 3;

  1328 if afterins = [([1], Frm), ([1], Res),

  1329 	       ([2, 1], Frm), ([2, 1], Res), ([2, 2], Res),

  1330 	       ([2, 3], Res), ([2, 4], Res), ([2, 5], Res), ([2, 6], Res),

  1331 	       ([2], Res),

  1332 	       ([3], Pbl),

  1333 	       ([3, 1], Frm), ([3, 1], Res),

  1334 	       ([3, 2, 1], Frm), ([3, 2, 1], Res)] then () else

  1335 error "ctree.sml: diff:behav. in complete pt: append_atom[3,2,1] insrtd";

  1336 if term2str (get_obj g_form pt' [3,2,1]) = "Inform [3, 2, 1]" then () else

  1337 error "ctree.sml: diff:behav. complete pt: append_atomic[3,2,1] Inform";

  1338 (*

  1339 show_pt pt';

  1340 show_pt pt;

  1341 *)

  1343 ===== inhibit exn ?===========================================================*)

author	Walther Neuper <neuper@ist.tugraz.at>
	Tue, 03 May 2011 11:16:55 +0200
branch	decompose-isar
changeset 41968	3228aa46fd30
parent 41957	703d656a6291
child 41970	25957ffe68e8
permissions	-rw-r--r--