wneuper/isa: test/Tools/isac/Interpret/ctree.sml@50bc995aa45b

     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 "-------------- get_allpos' (from ptree above)--------------------";

    15 (**#####################################################################(**)

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

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

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

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

    20 (**)#####################################################################**)

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

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

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

    24 "-------------- cappend minisubpbl -------------------------------";

    26 "=====new ptree 3 ================================================";

    27 "-------------- move_dn ------------------------------------------";

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

    29 "-------------- move_up ------------------------------------------";

    30 "------ move into detail -----------------------------------------";

    31 "=====new ptree 3a ===============================================";

    32 "-------------- move_dn in Incomplete ctree ----------------------";

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

    35 (*############## development stopped 0501 ########################*)

    36 (******************************************************************)

    37 (*              val SAVE_get_trace = get_trace;                   *)

    38 (******************************************************************)

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

    40 (******************************************************************)

    41 (*              val get_trace = SAVE_get_trace;                   *)

    42 (******************************************************************)

    43 (*############## development stopped 0501 ########################*)

    45 "=====new ptree 4 ratequation ====================================";

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

    47 "=====new ptree 5 minisubpbl =====================================";

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

    50 (**#####################################################################(**)

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

    52 "-------------- get_allpos' new ----------------------------------";

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

    54 (**)#####################################################################**)

    56 "-----------------------------------------------------------------";

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

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

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

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

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

    64 "this build should be detailed each time a test fails later    \

    65 \i.e. all the tests should be caught here first                \

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

    67 val fmz = ["equality (x+1=(2::real))",

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

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

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

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

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

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

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

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

    76    *)

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

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

    79    *)

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

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

    82    *)

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

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

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

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

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

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

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

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

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

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

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

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

    96 "----------------------------------------------------------------/";

    97 (*========== inhibit exn WN110319 ==============================================

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

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

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

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

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

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

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

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

   107 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 (*val nxt = ("Apply_Method", Apply_Method ["Test", "solve_linear"])*)

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

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

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

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

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

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

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

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

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

   122  show_pt pt;

   123 ============ inhibit exn WN110319 ============================================*)

   125 (*=== inhibit exn ?=============================================================

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

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

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

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

   131    [([], Frm),

   132     ([1], Frm),

   133     ([1], Res),

   134     ([2], Res),

   135     ([3], Frm),

   136     ([3, 1], Frm),

   137     ([3, 1], Res),

   138     ([3, 2], Res),

   139     ([3], Res),

   140     ([4], Res),

   141     ([], Res)]

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

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

   145    [([1], Frm),

   146     ([1], Res),

   147     ([2], Res),

   148     ([3], Frm),

   149     ([3, 1], Frm),

   150     ([3, 1], Res),

   151     ([3, 2], Res),

   152     ([3], Res),

   153     ([4], Res)]

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

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

   157    [([2], Res),

   158     ([3], Frm),

   159     ([3, 1], Frm),

   160     ([3, 1], Res),

   161     ([3, 2], Res),

   162     ([3], Res),

   163     ([4], Res)]

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

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

   167    [([3], Frm),

   168     ([3, 1], Frm),

   169     ([3, 1], Res),

   170     ([3, 2], Res),

   171     ([3], Res),

   172     ([4], Res)]

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

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

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

   177     ([3, 1], Res),

   178     ([3, 2], Res)]

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

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

   182    [([3], Frm),

   183     ([3, 1], Frm),

   184     ([3, 1], Res),

   185     ([3, 2], Res),

   186     ([3], Res)]

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

   190 (**##############################################################(**)

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

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

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

   195 show_pt pt;

   196 show_pt pt';

   197 print_depth 99; cuts; print_depth 3;

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

   200 	   ([3], Frm),

   201 	   ([3, 1], Frm),

   202 	   ([3, 1], Res),

   203 	   ([3, 2], Res),

   204 	   ([3], Res),

   205 	   ([4], Res)]

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

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

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

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

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

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

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

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

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

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

   217    [([], Frm),

   218     ([1], Frm),

   219     ([1], Res),

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

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

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

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

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

   227 	   ([3, 1], Frm),

   228 	   ([3, 1], Res),

   229 	   ([3, 2], Res),

   230 	   ([3], Res),

   231 	   ([4], Res)]

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

   255 	   ([3], Frm),

   256 	   ([3, 1], Frm),

   257 	   ([3, 1], Res),

   258 	   ([3, 2], Res),

   259 	   ([3], Res),

   260 	   ([4], Res),

   261 	   ([], Res)]

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

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

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

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

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

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

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

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

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

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

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

   277    [([], Frm),

   278     ([1], Frm),

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

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

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

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

   284 	   ([3, 1], Frm),

   285 	   ([3, 1], Res),

   286 	   ([3, 2], Res),

   287 	   ([3], Res),

   288 	   ([4], Res),

   289 	   ([], Res)]

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

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

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

   294 	   ([3, 2], Res),

   295 	   ([3], Res),

   296 	   ([4], Res),

   297 	   ([], Res)]

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

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

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

   302 	   ([3], Res),

   303 	   ([4], Res),

   304 	   ([], Res)]

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

   325 show_pt pt;

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

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

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

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

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

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

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

   336 if cuts = []

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

   339 (*WN050219

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

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

   344 show_pt pt;

   345 show_pt pt';

   346 print_depth 99;cuts;print_depth 3;

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

   348 ####################################################################*)*)

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

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

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

   353  states:=[];

   354  CalcTree

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

   356    ("Test",

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

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

   359  Iterator 1; moveActiveRoot 1;

   360  autoCalculate 1 CompleteCalc;

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

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

   365  show_pt pt;

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

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

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

   370 (*WN050225 intermed. outcommented

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

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

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

   374 	    ([3, 2], Res),

   375 	    ([3], Res),

   376 	    ([4], Res)]

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

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

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

   381 	    ([3, 2], Res),

   382 	    ([3], Res),

   383 	    ([4], Res)]

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

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

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

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

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

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

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

   393 	   ([3, 2], Res),

   394 	   ([3], Res),

   395 	   ([4], Res),

   396 	   ([], Res)]

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

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

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

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

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

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

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

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

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

   407 	   ([3, 2], Res),

   408 	   ([3], Res),

   409 	   ([4], Res),

   410 	   ([], Res)]

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

   415 "-------------- cappend minisubpbl -------------------------------";

   416 "-------------- cappend minisubpbl -------------------------------";

   417 "-------------- cappend minisubpbl -------------------------------";

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

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

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

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

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

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

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

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

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

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

   428    *)

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

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

   431    *)

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

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

   434    *)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

   453 val (pt,cuts) =

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

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

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

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

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

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

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

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

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

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

   465 val (pt,cuts) =

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

   484 (* ...complete calchead skipped...*)

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

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

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

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

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

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

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

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

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

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

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

   498 val (pt,cuts) =

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

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

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

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

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

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

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

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

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

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

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

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

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

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

   515 WN050225 intermed. outcommented---*)

   517 "=====new ptree 3 ================================================";

   518 "=====new ptree 3 ================================================";

   519 "=====new ptree 3 ================================================";

   520  states:=[];

   521  CalcTree

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

   523    ("Test",

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

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

   526  Iterator 1; moveActiveRoot 1;

   527  autoCalculate 1 CompleteCalc;

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

   530  show_pt pt;

   532 "-------------- move_dn ------------------------------------------";

   533 "-------------- move_dn ------------------------------------------";

   534 "-------------- move_dn ------------------------------------------";

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

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

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

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

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

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

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

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

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

   544    term2str (get_obj g_form pt [4]);

   545    *)

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

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

   548 (*

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

   550                                   Exception PTREE end of calculation*)

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

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

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

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

   557  states := [];

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

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

   560        ("Test",

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

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

   563  Iterator 1; moveActiveRoot 1;

   564  autoCalculate 1 CompleteCalcHead;

   565  autoCalculate 1 (Step 1);

   566  refFormula 1 (get_pos 1 1);

   568  moveActiveRoot 1;

   569  moveActiveDown 1;

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

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

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

   574  autoCalculate 1 (Step 1);

   575  refFormula 1 (get_pos 1 1);

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

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

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

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

   583 "-------------- move_up ------------------------------------------";

   584 "-------------- move_up ------------------------------------------";

   585 "-------------- move_up ------------------------------------------";

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

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

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

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

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

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

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

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

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

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

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

   597                                   Exception PTREE begin of calculation*)

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

   601 "------ move into detail -----------------------------------------";

   602 "------ move into detail -----------------------------------------";

   603 "------ move into detail -----------------------------------------";

   604  states:=[];

   605  CalcTree

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

   607    ("Test",

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

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

   610  Iterator 1; moveActiveRoot 1;

   611  autoCalculate 1 CompleteCalc;

   612  moveActiveRoot 1;

   613  moveActiveDown 1;

   614  moveActiveDown 1;

   615  moveActiveDown 1;

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

   618  interSteps 1 ([2],Res);

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

   621  val p = get_pos 1 1;

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

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

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

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

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

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

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

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

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

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

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

   635 "=====new ptree 3a ===============================================";

   636 "=====new ptree 3a ===============================================";

   637 "=====new ptree 3a ===============================================";

   638  states:=[];

   639  CalcTree

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

   641    ("Test",

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

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

   644  Iterator 1; moveActiveRoot 1;

   645  autoCalculate 1 CompleteCalcHead;

   646  autoCalculate 1 (Step 1);

   647  autoCalculate 1 (Step 1);

   648  autoCalculate 1 (Step 1);

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

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

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

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

   653  (*val p = move_dn [] pt ([2], Res)     ->Exception- PTREE "[] not complete"*);

   655  moveDown 1 ([],Pbl)        (*-> ([1], Frm)*);

   656  moveDown 1 ([1],Frm)       (*-> ([1],Res)*);

   657  moveDown 1 ([1],Res)       (*-> ([2],Res)*);

   658  moveDown 1 ([2],Res)       (*-> pos does not exist*);

   659 (*

   660  get_obj g_ostate pt [1];

   661  show_pt pt;

   662 *)

   664 "-------------- move_dn in Incomplete ctree ----------------------";

   665 "-------------- move_dn in Incomplete ctree ----------------------";

   666 "-------------- move_dn in Incomplete ctree ----------------------";

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

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

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

   673 states:=[];

   674 CalcTree

   675 [(["equality (x/(x^2 - 6*x+9) - 1/(x^2 - 3*x) =1/x)",

   676 	   "solveFor x","solutions L"],

   677   ("RatEq",["univariate","equation"],["no_met"]))];

   678 Iterator 1; moveActiveRoot 1;

   679 autoCalculate 1 CompleteCalc;

   681 getTactic 1 ([1],Res);(*Rewrite_Set RatEq_simplify*)

   682 getTactic 1 ([2],Res);(*Rewrite_Set norm_Rational*)

   683 getTactic 1 ([3],Res);(*Rewrite_Set RatEq_eliminate*)

   684 getTactic 1 ([4,1],Res);(*Rewrite all_left*)

   685 getTactic 1 ([4,2],Res);(*Rewrite_Set expand_binoms*)

   686 getTactic 1 ([4,3],Res);(*Rewrite_Set_Inst make_ratpoly_in*)

   688 moveActiveFormula 1 ([1],Res)(*1.1...1.4*);

   689 moveActiveFormula 1 ([2],Res)(**ME_Isa: 'expand' not known*);

   690 moveActiveFormula 1 ([3],Res)(*3.1.*);

   691 moveActiveFormula 1 ([4,2],Res)(*4.2.1.*);

   692 moveActiveFormula 1 ([4,3],Res)(**one_scr_arg: called by Script Stepwise t_=*);

   694 moveActiveFormula 1 ([1],Res)(*1.1...1.4*);

   695 interSteps 1 ([1],Res)(*..is activeFormula !?!*);

   697 getTactic 1 ([1,1],Res);(*Rewrite real_diff_minus*)

   698 getTactic 1 ([1,2],Res);(*Rewrite real_diff_minus*)

   699 getTactic 1 ([1,3],Res);(*Rewrite real_diff_minus*)

   700 getTactic 1 ([1,4],Res);(*Rewrite real_rat_mult_1*)

   702 moveActiveFormula 1 ([4,2],Res)(*4.2.1.*);

   703 interSteps 1 ([4,2],Res)(*..is activeFormula !?!*);

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

   705 writeln(pr_ptree pr_short pt);

   706 (*delete [4,1] in order to make pos [4],[4,4] for pblobjs differen [4],[4,3]:

   707  ###########################################################################*)

   708 val (pt, ppp) = cut_level_'_ [] [] pt ([4,1],Frm);

   709 writeln(pr_ptree pr_short pt);

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

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

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

   715 "--- level 1: get pos from start b to end p ----------------------";

   716 "--- level 1: get pos from start b to end p ----------------------";

   717 "--- level 1: get pos from start b to end p ----------------------";

   718 (******************************************************************)

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

   720 (******************************************************************)

   721 (*'getnds' below is structured as such:*)

   722 fun www _ [x] = "l+r-margin"

   723   | www true [x1,x2] = "l-margin,  r-margin"

   724   | www _ [x1,x2] = "intern,  r-margin"

   725   | www true (x::(xs as _::_)) = "l-margin  " ^ www false xs

   726   | www _ (x::(xs as _::_)) = "intern  " ^ www false xs;

   727 www true [1,2,3,4,5];

   728 (*val it = "from  intern  intern  intern  to" : string*)

   729 www true [1,2];

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

   731 www true [1];

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

   734 local

   735 (*specific values of hd of pos p,q for simple handling take_fromto,

   736   from-pos p, to-pos q: take_fromto (hdp p) (hdq q) (children pt) ...

   737   ... can be used even for positions _below_ p or q*)

   738 fun hdp [] = 1     | hdp [0] = 1     | hdp x = hd x;(*start with first*)

   739 fun hdq	[] = 99999 | hdq [0] = 99999 | hdq x = hd x;(*take until last*)

   740 (*analoguous for tl*)

   741 fun tlp [] = [0]     | tlp [_] = [0]     | tlp x = tl x;

   742 fun tlq [] = [99999] | tlq [_] = [99999] | tlq x = tl x;

   744 (*see modspec.sml#pt_form

   745 fun pt_form (PrfObj {form,...}) = term2str form

   746   | pt_form (PblObj {probl,spec,origin=(_,spec',_),...}) =

   747     let val (dI, pI, _) = get_somespec' spec spec'

   748 	val {cas,...} = get_pbt pI

   749     in case cas of

   750 	   NONE => term2str (pblterm dI pI)

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

   752     end;

   753 *)

   754 (*.get an 'interval' from ptree down to a certain level

   755    by 'take_fromto children' of the nodes with specific 'from' and 'to';

   756    'i > 0' suppresses output during recursive descent towards 'from'

   757    b: the 'from' incremented to the actual pos

   758    p,q: specific 'from','to' for simple use of 'take_fromto'*)

   759 fun getnd i (b,p) q (Nd (po, nds)) =

   760     (if  i <= 0 then [(*[(b, pt_form po)]*) (**)[b](**)] else [])

   762     @ (writeln("getnd  : b="^(ints2str' b)^", p="^

   763 	       (ints2str' p)^", q="^(ints2str' q));

   765        getnds (i-1) true (b@[hdp p], tlp p) (tlq q)

   766 	       (take_fromto (hdp p) (hdq q) nds))

   768 and getnds _ _ _ _ [] = []                         (*no children*)

   769   | getnds i _ (b,p) q [nd] = (getnd i (b,p) q nd) (*l+r-margin*)

   770   | getnds i true (b,p) q [n1, n2] =               (*l-margin,  r-margin*)

   771     (writeln("getnds3: b="^ ints2str' b ^", p="^ ints2str' p ^

   772 	     ", q="^ ints2str' q);

   773     (getnd i      (       b, p ) [99999] n1) @

   774     (getnd ~99999 (lev_on b,[0]) q       n2))

   775   | getnds i _    (b,p) q [n1, n2] =               (*intern,  r-margin*)

   776     (writeln("getnds4: b="^ ints2str' b ^", p="^ ints2str' p ^

   777 	     ", q="^ ints2str' q);

   778     (getnd i      (       b,[0]) [99999] n1) @

   779     (getnd ~99999 (lev_on b,[0]) q       n2))

   780   | getnds i true (b,p) q (nd::(nds as _::_)) =    (*l-margin, intern*)

   781     (writeln("getnds5: b="^ ints2str' b ^", p="^ ints2str' p ^

   782 	     ", q="^ ints2str' q);

   783     (getnd i             (       b, p ) [99999] nd) @

   784     (getnds ~99999 false (lev_on b,[0]) q nds))

   785   | getnds i _ (b,p) q (nd::(nds as _::_)) =       (*intern, ...*)

   786     (getnd i             (       b,[0]) [99999] nd) @

   787     (getnds ~99999 false (lev_on b,[0]) q nds);

   788 in

   789 (*get an 'interval from to' from a ptree as 'intervals f t' of respective nodes

   790   where 'from' are pos, i.e. a key as int list, 'f' an int (to,t analoguous)

   791 (1) the 'f' are given

   792 (1a) by 'from' if 'f' = the respective element of 'from' (left margin)

   793 (1b) -inifinity, if 'f' > the respective element of 'from' (internal node)

   794 (2) the 't' ar given

   795 (2a) by 'to' if 't' = the respective element of 'to' (right margin)

   796 (2b) inifinity, if 't' < the respective element of 'to (internal node)'

   797 the 'f' and 't' are set by hdp,... *)

   798 fun get_trace pt p q =

   799     (flat o (getnds ((length p) -1) true ([hdp p], tlp p) (tlq q)))

   800 	(take_fromto (hdp p) (hdq q) (children pt));

   801 end;

   803 writeln(pr_ptree pr_short pt);

   804 case get_trace pt [1,3] [4,1,1] of

   805     [[1,3],[1,4],[2],[3],[4],[4,1],[4,1,1]] => ()

   806   | _ => error "diff.behav.in ctree.sml: get_interval lev 1a";

   807 case get_trace pt [2] [4,3,2] of

   808     [[2],[3],[4],[4,1],[4,1,1],[4,2],[4,3],[4,3,1],[4,3,2]] => ()

   809   | _ => error "diff.behav.in ctree.sml: get_interval lev 1b";

   810 case get_trace pt [1,4] [4,3,1] of

   811     [[1,4],[2],[3],[4],[4,1],[4,1,1],[4,2],[4,3],[4,3,1]] => ()

   812   | _ => error "diff.behav.in ctree.sml: get_interval lev 1c";

   813 case get_trace pt [4,2] [5] of

   814    (*[([4,2],_),([4,3],_),([4,4],_),([4,4,1],_),([4,4,2],_),([4,4,3],_),

   815     ([4,4,4],_),([4,4,5],_),([5],_)] => () ..with pt_form*)

   816     [[4,2],[4,3],[4,3,1],[4,3,2],[4,3,3],[4,3,4],[4,3,5],[5]]=>()

   817   | _ => error "diff.behav.in ctree.sml: get_interval lev 1d";

   818 case get_trace pt [] [4,4,2] of

   819     [[1],[1,1],[1,2],[1,3],[1,4],[2],[3],[4],[4,1],[4,1,1],[4,2],

   820      [4,3],[4,3,1],[4,3,2]] => ()

   821   | _ => error "diff.behav.in ctree.sml: get_interval lev 1e";

   822 case get_trace pt [] [] of

   823     [[1],[1,1],[1,2],[1,3],[1,4],[2],[3],[4],[4,1],[4,1,1],[4,2],

   824      [4,3],[4,3,1],[4,3,2],[4,3,3],[4,3,4],[4,3,5],[5]] => ()

   825   | _ => error "diff.behav.in ctree.sml: get_interval lev 1f";

   826 case get_trace pt [4,3] [4,3] of

   827     [[4,3],[4,3,1],[4,3,2],[4,3,3],[4,3,4],[4,3,5]] => ()

   828   | _ => error "diff.behav.in ctree.sml: get_interval lev 1g";

   830 "--- level 2: get pos' from start b to end p ---------------------";

   831 "--- level 2: get pos' from start b to end p ---------------------";

   832 "--- level 2: get pos' from start b to end p ---------------------";

   833 (*idea: pos_ is _ONLY_ relevant exactly at (endpoint of) from, to

   834   development stopped in favour of move_dn, see get_interval

   835   actually used (inefficient) version with move_dn: see modspec.sml

   836 *)

   837 (*

   838 case get_trace pt ([1,4],Res) ([4,4,1],Frm) of

   839     [[2],[3],[4],[4,1],[4,2],[4,2,1],[4,3],[4,4],[4,4,1]] => ()

   840   | _ => error "diff.behav.in ctree.sml: get_interval lev 1b";

   841 case get_trace pt ([],Pbl) ([],Res) of

   842     [[1],[1,1],[1,2],[1,3],[1,4],[2],[3],[4],[4,1],[4,2],[4,2,1],[4,3],

   843      [4,4],[4,4,1],[4,4,2],[4,4,3],[4,4,4],[4,4,5],[5]] => ()

   844   | _ => error "diff.behav.in ctree.sml: get_interval lev 1e";

   845 *)

   847 (******************************************************************)

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

   849 (******************************************************************)

   852 "=====new ptree 4 ratequation ====================================";

   853 "=====new ptree 4 ratequation ====================================";

   854 "=====new ptree 4 ratequation ====================================";

   855 states:=[];

   856 CalcTree

   857 [(["equality (x/(x^2 - 6*x+9) - 1/(x^2 - 3*x) =1/x)",

   858 	   "solveFor x","solutions L"],

   859   ("RatEq",["univariate","equation"],["no_met"]))];

   860 Iterator 1; moveActiveRoot 1;

   861 autoCalculate 1 CompleteCalc;

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

   863 show_pt pt;

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

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

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

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

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

   871     ("(3 + -1 * x + x ^^^ 2) * x = 1 * (9 * x + -6 * x ^^^ 2 + x ^^^ 3)",

   872      Subproblem

   873          ("PolyEq",

   874           ["normalize", "polynomial", "univariate", "equation"]),

   875 	 ["9 * x + -6 * x ^^^ 2 + x ^^^ 3 ~= 0"]) => ()

   876   | _ => error "diff.behav.in ctree.sml: pt_extract asm<>[]";

   877 (*WN060717 unintentionally changed some rls/ord while

   878      completing knowl. for thes2file...

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

   881     ((*"(3 + (-1 * x + x ^^^ 2)) * x = 1 * (9 * x + (x ^^^ 3 + -6 * x ^^^ 2))",

   882      *)Subproblem

   883          ("PolyEq",

   884           ["normalize", "polynomial", "univariate", "equation"]),

   885 	 ["9 * x + (x ^^^ 3 + -6 * x ^^^ 2) ~= 0"]) => ()

   886   | _ => error "diff.behav.in ctree.sml: pt_extract asm<>[]";

   888 .... but it became even better*)

   892 "=====new ptree 5 minisubpbl =====================================";

   893 "=====new ptree 5 minisubpbl =====================================";

   894 "=====new ptree 5 minisubpbl =====================================";

   895 states:=[];

   896 CalcTree

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

   898    ("Test",

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

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

   901 Iterator 1; moveActiveRoot 1;

   902 autoCalculate 1 CompleteCalc;

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

   904 show_pt pt;

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

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

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

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

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

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

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

   913      []) => ()

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

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

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

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

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

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

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

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

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

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

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

   928     ("-1 + x = 0",

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

   930      []) => ()

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

   951      []) => ()

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

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

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

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

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

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

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

   961     ("[x = 1]",

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

   963      []) => ()

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

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

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

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

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

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

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

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

   974 states:=[];

   975 CalcTree

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

   977    ("Test",

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

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

   980 Iterator 1; moveActiveRoot 1;

   981 autoCalculate 1 CompleteCalc;

   982 interSteps 1 ([2],Res);

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

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

   985 show_pt pt;

   987 (**##############################################################**)

   988 "-------------- get_allpos' new ----------------------------------";

   989 "-------------- get_allpos' new ----------------------------------";

   990 "-------------- get_allpos' new ----------------------------------";

   991 "--- whole ctree";

   992 print_depth 99;

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

   994 print_depth 3;

   995 if cuts =

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

   997     ([1], Frm),

   998     ([1], Res),

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

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

  1001     ([2], Res),

  1002     ([3], Pbl),

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

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

  1005     ([3, 2], Res),

  1006     ([3], Res),

  1007     ([4], Res),

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

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

  1011 print_depth 99;

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

  1013 print_depth 3;

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

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

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

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

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

  1020 if cuts =

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

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

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

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

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

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

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

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

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

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

  1034 if cuts =

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

  1036     ([3, 1], Res),

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

  1038     ([3, 2], Res),

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

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

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

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

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

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

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

  1048 if cuts =

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

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

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

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

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

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

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

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

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

  1060 if cuts =

  1061    [] then () else

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

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

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

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

  1069 (**#################################################################**)

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

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

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

  1073 show_pt pt;

  1074 val b = get_obj g_branch pt [];

  1075 if b = TransitiveB then () else

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

  1077 val b = get_obj g_branch pt [3];

  1078 if b = TransitiveB then () else

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

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

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

  1083 print_depth 99;

  1084 cuts;

  1085 print_depth 3;

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

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

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

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

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

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

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

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

  1096 print_depth 99;

  1097 cuts;

  1098 print_depth 3;

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

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

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

  1102 	   ([2], Res),

  1103 	   ([3], Pbl),

  1104 	   ([3, 1], Frm),

  1105 	   ([3, 1], Res),

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

  1107 	   ([3, 2], Res),

  1108 	   ([3], Res),

  1109 	   ([4], Res),

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

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

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

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

  1115 print_depth 99;

  1116 cuts;

  1117 print_depth 3;

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

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

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

  1121 	   ([3, 2], Res),

  1122 	   ([3], Res),

  1123 	   ([4], Res),

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

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

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

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

  1129 print_depth 99;

  1130 cuts;

  1131 print_depth 1;

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

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

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

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

  1136 show_pt pt';

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

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

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

  1142 show_pt pt;

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

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

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

  1147 print_depth 99;

  1148 cuts;

  1149 print_depth 3;

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

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

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

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

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

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

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

  1157 print_depth 99;

  1158 afterins;

  1159 print_depth 3;

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

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

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

  1163 show_pt pt';

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

  1166 show_pt pt;

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

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

  1169 print_depth 99;

  1170 cuts;

  1171 print_depth 3;

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

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

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

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

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

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

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

  1179 print_depth 99;

  1180 afterins;

  1181 print_depth 3;

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

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

  1184 then () else

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

  1186 show_pt pt';

  1187 (*

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

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

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

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

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

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

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

  1196  *)

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

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

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

  1201 print_depth 99;

  1202 cuts;

  1203 print_depth 3;

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

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

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

  1207 	   ([3, 2], Res),

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

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

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

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

  1212 print_depth 99;

  1213 afterins;

  1214 print_depth 3;

  1215 if afterins =

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

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

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

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

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

  1221    use"ctree.sml";

  1222    *)

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

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

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

  1227 print_depth 99;

  1228 cuts;

  1229 print_depth 3;

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

  1231 	   ([3, 2], Res),

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

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

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

  1235 print_depth 99;

  1236 afterins;

  1237 print_depth 3;

  1238 (*WN060727 replaced after overwriting cutlevup by test_trans

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

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

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

  1242 	       ([2], Res),

  1243 	       ([3], Pbl),

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

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

  1246 	       ([4], Res),

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

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

  1249 *)

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

  1253 	       ([2], Res),

  1254 	       ([3], Pbl),

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

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

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

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

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

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

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

  1264 print_depth 99;

  1265 cuts;

  1266 print_depth 3;

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

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

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

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

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

  1272 print_depth 99;

  1273 afterins;

  1274 print_depth 3;

  1275 (*WN060727 replaced after overwriting cutlevup by test_trans

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

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

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

  1279 	       ([2], Res),

  1280 	       ([3], Pbl),

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

  1282 	       ([3], Res),

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

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

  1285 *)

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

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

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

  1289 	       ([2], Res),

  1290 	       ([3], Pbl),

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

  1292 then () else

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

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

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

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

  1299 (**)

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

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

  1302 print_depth 99;

  1303 cuts;

  1304 print_depth 1;

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

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

  1307 then () else

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

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

  1310 print_depth 99;

  1311 afterins;

  1312 print_depth 3;

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

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

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

  1316 	       ([2], Res),

  1317 	       ([3], Pbl),

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

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

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

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

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

  1323 (*

  1324 show_pt pt';

  1325 show_pt pt;

  1326 *)

  1328 ===== inhibit exn ?===========================================================*)

author	Mathias Lehnfeld <bonzai@inode.at>
	Thu, 07 Apr 2011 16:31:05 +0200
branch	decompose-isar
changeset 41951	50bc995aa45b
parent 41950	2476f5f0f9ee
child 41957	703d656a6291
permissions	-rw-r--r--