(* Title:  300-init-subpbl.sml

   Author: Walther Neuper 1105

   (c) copyright due to lincense terms.

*)

"----------- Minisubplb/300-init-subpbl.sml ----------------------";

"----------- Minisubplb/300-init-subpbl.sml ----------------------";

"----------- Minisubplb/300-init-subpbl.sml ----------------------";

val fmz = ["equality (x+1=(2::real))", "solveFor x","solutions L"];

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

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

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

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

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

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

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

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

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

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

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

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

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

val (p,_,f,nxt,_,pt) = me nxt p [] pt; (*nxt = ("Subproblem"*)

"~~~~~ fun me, args:"; val (_,tac) = nxt;

"~~~~~ fun locatetac, args:"; val (tac, ptp as (pt, p)) = (tac, (pt,p));

val (mI,m) = mk_tac'_ tac;

val Appl m = applicable_in p pt m;

member op = specsteps mI; (*false*)

(*val Updated (cs' as (_,_,(_,p'))) =  loc_solve_ (mI,m) ptp;*)

"~~~~~ fun loc_solve_, args:"; val (m, (pt,pos)) = ((mI,m), ptp);

(*val (msg, cs') = solve m (pt, pos);*)

"~~~~~ fun solve, args:"; val ((mI,m), (pt, po as (p,p_))) = (m, (pt, pos));

e_metID = get_obj g_metID pt (par_pblobj pt p) (*false*);

	      val thy' = get_obj g_domID pt (par_pblobj pt p);

	      val (srls, is, sc) = from_pblobj_or_detail' thy' (p,p_) pt;

		      val d = e_rls; (*FIXME.WN0108: canon.simplifier for domain is missing: generate from domID?*)

(*val Steps (is', ss as (m',f',pt',p',c')::_) = locate_gen (thy',srls) m  (pt,(p,p_)) (sc,d) is;*)

"~~~~~ fun locate_gen, args:"; val ((ts as (thy',srls)), (m:tac_), ((pt,p):ctree * pos'), 

	                   (scr as Prog (h $ body),d), (ScrState (E,l,a,v,S,b), ctxt)) =

                   ((thy',srls), m,  (pt,(p,p_)), (sc,d), is);

val thy = assoc_thy thy';

l = [] orelse ((*init.in solve..Apply_Method...*)

			         (last_elem o fst) p = 0 andalso snd p = Res) (*false*);

(*val Assoc (iss as (is as (_,_,_,_,_,bb), ss as ((m',f',pt',p',c')::_))) =

    (astep_up (thy',srls,scr,d) ((E,l,a,v,S,b), [(m,EmptyMout,pt,p,[])]) );*)

"~~~~~ fun astep_up, args:"; val ((ys as (_,_,Prog sc,_)), ((E,l,a,v,S,b),ss)) =

                     ((thy',srls,scr,d), ((E,l,a,v,S,b), [(m,EmptyMout,pt,p,[])]) );

1 < length l (*true*);

val up = drop_last l;

(*ass_up ys ((E,up,a,v,S,b),ss) (go up sc);*)

"~~~~~ fun ass_up, args:"; val (ysa, iss, (Const ("Script.Try",_) $ e)) =

                                             (ys, ((E,up,a,v,S,b),ss), (go up sc));

(* STOPPED stepping into HERE due to type problem:  Can't unify _a to pos * pos_

astep_up ysa iss;

at bottom of | assy we see:

                 :

                 case assod pt d m stac of

"~~~~~ fun assod, args:"; val (...Subproblem'...) = ();

	      val ctxt = dI |> Thy_Info.get_theory |> Proof_Context.init_global 

          |> declare_constraints' vals

*)

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

case nxt of ("Model_Problem", _) => ()

| _ => error "minisubpbl: CalcTreeTEST has no nxt = Model_Problem";