(* Title:  "Specify/refine.sml"

   Author: Walther Neuper

   (c) due to copyright terms

*)

"-----------------------------------------------------------------------------------------------";

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

"-----------------------------------------------------------------------------------------------";

"refine.thy: store test-pbtyps by 'setup' ------------------------------------------------------";

"----------- testdata for refin, Refine.refine_ori --------------------------------------------";

(*"----------- refin test-pbtyps -------requires specific 'setup'-------------------------------";*)

"----------- Refine.refine_ori test-pbtyps --requires 'setup'----------------------------------";

"----------- refine test-pbtyps ------requires 'setup'------------------------------------------";

"----------- Refine_Problem (from subp-rooteq.sml) ---------------------------------------------";

"-----------------------------------------------------------------------------------------------";

"-----------------------------------------------------------------------------------------------";

"-----------------------------------------------------------------------------------------------";

"----------- testdata for refin, Refine.refine_ori --------------------------------------------";

"----------- testdata for refin, Refine.refine_ori --------------------------------------------";

"----------- testdata for refin, Refine.refine_ori --------------------------------------------";

Test_Tool.show_ptyps();

val thy = @{theory "Isac_Knowledge"};

val ctxt = Proof_Context.init_global @{theory "Isac_Knowledge"};

(*case 1: no refinement *)

val (d1,ts1) = Input_Descript.split ((Thm.term_of o the o (TermC.parse thy)) "fixedValues [aaa = 0]");

val (d2,ts2) = Input_Descript.split ((Thm.term_of o the o (TermC.parse thy)) "errorBound (ddd = 0)");

val ori1 = [(1,[1],"#Given",d1,ts1), (2,[1],"#Given",d2,ts2)]: O_Model.T;

(*case 2: refined to pbt without children *)

val (d2,ts2) = Input_Descript.split ((Thm.term_of o the o (TermC.parse thy)) "relations [aaa333]");

val ori2 = [(1,[1],"#Given",d1,ts1), (2,[1],"#Given",d2,ts2)]:O_Model.T;

(*case 3: refined to pbt with children *)

val (d2,ts2) = Input_Descript.split ((Thm.term_of o the o (TermC.parse thy)) "valuesFor [aaa222]");

val ori3 = [(1,[1],"#Given",d1,ts1), (2,[1],"#Given",d2,ts2)]:O_Model.T;

(*case 4: refined to children (without child)*)

val (d3,ts3) = Input_Descript.split ((Thm.term_of o the o (TermC.parse thy)) "boundVariable aaa222yyy");

val ori4 = [(1,[1],"#Given",d1,ts1), (2,[1],"#Given",d2,ts2), (3,[1],"#Given",d3,ts3)]:O_Model.T;

(*=================================================================

This test expects pbls at a certain position in the tree.

Since parallel evaluation (i.e. Theory_Data) this cannot be expected.

Solutions would be

* provide an access function for a branch (not only leaves)

* sort the tree of pbls.

"----------- refin test-pbtyps -------requires specific 'setup'-------------------------------";

"----------- refin test-pbtyps -------requires specific 'setup'-------------------------------";

"----------- refin test-pbtyps -------requires specific 'setup'-------------------------------";

(* fragile test setup: expects ptyps as fixed *)

val level_1 = case nth 9 (get_ptyps ()) of

Store.Node ("test", _, level_1) => level_1 | _ => error "refin broken: root-branch in ptyps changed?"

val level_2 = case nth 4 level_1 of

Store.Node ("refine", _, level_2) => level_2 | _ => error "refin broken: lev1-branch in ptyps changed?"

val pbla_branch = case level_2 of 

[Store.Node ("pbla", _, _)] => level_2 | _ => error "refin broken: lev2-branch in ptyps changed?";

(*case 1: no refinement *)

case refin [] ori1 (hd pbla_branch) of 

  SOME ["pbla"] => () | _ => error "refin case 1 broken";

(*case 2: refined to pbt without children *)

case refin [] ori2 (hd pbla_branch) of 

  SOME ["pbla", "pbla3"] => () | _ => error "refin case 2 broken";

(*case 3: refined to pbt with children *)

case refin [] ori3 (hd pbla_branch) of 

  SOME ["pbla", "pbla2"] => () | _ => error "refin case 3 broken";

(*case 4: refined to children (without child)*)

case refin [] ori4 (hd pbla_branch) of 

  SOME ["pbla", "pbla2", "pbla2y"] => () | _ => error "refin case 4 broken";

(*case 5: start refinement somewhere in ptyps*)

val [Store.Node ("pbla",_,[_, ppp as Store.Node ("pbla2",_,_), _])] = pbla_branch;

case refin ["pbla"] ori4 ppp of 

  SOME ["pbla", "pbla2", "pbla2y"] => () | _ => error "refin case 5 broken";

==================================================================*)

"----------- Refine.refine_ori test-pbtyps --requires 'setup'----------------------------------";

"----------- Refine.refine_ori test-pbtyps --requires 'setup'----------------------------------";

"----------- Refine.refine_ori test-pbtyps --requires 'setup'----------------------------------";

(*case 1: no refinement *)

case Refine.refine_ori ori1 ["pbla", "refine", "test"] of 

  NONE => () | _ => error "Refine.refine_ori case 1 broken";

(*case 2: refined to pbt without children *)

case Refine.refine_ori ori2 ["pbla", "refine", "test"] of 

  SOME ["pbla3", "pbla", "refine", "test"] => () | _ => error "Refine.refine_ori case 2 broken";

(*case 3: refined to pbt with children *)

case Refine.refine_ori ori3 ["pbla", "refine", "test"] of 

  SOME ["pbla2", "pbla", "refine", "test"] => () | _ => error "Refine.refine_ori case 3 broken";

(*case 4: refined to children (without child)*)

case Refine.refine_ori ori4 ["pbla", "refine", "test"] of 

  SOME ["pbla2y", "pbla2", "pbla", "refine", "test"] => () | _ => error "Refine.refine_ori case 4 broken";

(*case 5: start refinement somewhere in ptyps*)

case Refine.refine_ori ori4 ["pbla2", "pbla", "refine", "test"] of 

  SOME ["pbla2y", "pbla2", "pbla", "refine", "test"] => () | _ => error "Refine.refine_ori case 5 broken";

"----------- refine test-pbtyps ------requires 'setup'------------------------------------------";

"----------- refine test-pbtyps ------requires 'setup'------------------------------------------";

"----------- refine test-pbtyps ------requires 'setup'------------------------------------------";

val fmz1 = ["fixedValues [aaa=0]", "errorBound (ddd=0)"];

val fmz2 = ["fixedValues [aaa=0]", "relations aaa333"];

val fmz3 = ["fixedValues [aaa=0]", "valuesFor [aaa222]"];

val fmz4 = ["fixedValues [aaa=0]", "valuesFor [aaa222]",

	    "boundVariable aaa222yyy"];

(*case 1: no refinement *)

case Refine.refine fmz1 ["pbla", "refine", "test"] of

  [M_Match.Matches (["pbla", "refine", "test"], _), 

   M_Match.NoMatch (["pbla1", "pbla", "refine", "test"], _), 

   M_Match.NoMatch (["pbla2", "pbla", "refine", "test"], _), 

   M_Match.NoMatch (["pbla3", "pbla", "refine", "test"], _)] => ()

 | _ => error "--- Refine.refine test-pbtyps --- broken with case 1";

(* 

*** pass ["pbla"]

*** pass ["pbla", "pbla1"]

*** pass ["pbla", "pbla2"]

*** pass ["pbla", "pbla3"]

val it =

  [M_Match.Matches

     (["pbla"],

      {Find=[],

       Given=[Correct "fixedValues [aaa = #0]",

              Superfl "errorBound (ddd = #0)"],Relate=[],Where=[],With=[]}),

   M_Match.NoMatch

     (["pbla1", "pbla"],

      {Find=[],

       Given=[Correct "fixedValues [aaa = #0]",Missing "maximum a1_",

              Superfl "errorBound (ddd = #0)"],Relate=[],Where=[],With=[]}),

   M_Match.NoMatch

     (["pbla2", "pbla"],

      {Find=[],

       Given=[Correct "fixedValues [aaa = #0]",Missing "valuesFor a2_",

              Superfl "errorBound (ddd = #0)"],Relate=[],Where=[],With=[]}),

   M_Match.NoMatch

     (["pbla3", "pbla"],

      {Find=[],

       Given=[Correct "fixedValues [aaa = #0]",Missing "relations a3_",

              Superfl "errorBound (ddd = #0)"],Relate=[],Where=[],With=[]})]

  : match list*)

(*case 2: refined to pbt without children *)

case Refine.refine fmz2 ["pbla", "refine", "test"] of

  [M_Match.Matches (["pbla", "refine", "test"], _),

   M_Match.NoMatch (["pbla1", "pbla", "refine", "test"], _),

   M_Match.NoMatch (["pbla2", "pbla", "refine", "test"], _),

   M_Match.Matches (["pbla3", "pbla", "refine", "test"], _)] => ()

 | _ => error "--- Refine.refine test-pbtyps --- broken with case 2";

(* 

*** pass ["pbla"]

*** pass ["pbla", "pbla1"]

*** pass ["pbla", "pbla2"]

*** pass ["pbla", "pbla3"]

val it =

  [M_Match.Matches

     (["pbla"],

      {Find=[],

       Given=[Correct "fixedValues [aaa = #0]",Superfl "relations aaa333"],

       Relate=[],Where=[],With=[]}),

   M_Match.NoMatch

     (["pbla1", "pbla"],

      {Find=[],

       Given=[Correct "fixedValues [aaa = #0]",Missing "maximum a1_",

              Superfl "relations aaa333"],Relate=[],Where=[],With=[]}),

   M_Match.NoMatch

     (["pbla2", "pbla"],

      {Find=[],

       Given=[Correct "fixedValues [aaa = #0]",Missing "valuesFor a2_",

              Superfl "relations aaa333"],Relate=[],Where=[],With=[]}),

   M_Match.Matches

     (["pbla3", "pbla"],

      {Find=[],

       Given=[Correct "fixedValues [aaa = #0]",Correct "relations aaa333"],

       Relate=[],Where=[],With=[]})] : match list*)

(*case 3: refined to pbt with children *)

case Refine.refine fmz3 ["pbla", "refine", "test"] of

  [M_Match.Matches (["pbla", "refine", "test"], _),

   M_Match.NoMatch (["pbla1", "pbla", "refine", "test"], _),

   M_Match.Matches (["pbla2", "pbla", "refine", "test"], _),

   M_Match.NoMatch (["pbla2x", "pbla2", "pbla", "refine", "test"], _),

   M_Match.NoMatch (["pbla2y", "pbla2", "pbla", "refine", "test"], _),

   M_Match.NoMatch (["pbla2z", "pbla2", "pbla", "refine", "test"], _),

   M_Match.NoMatch (["pbla3", "pbla", "refine", "test"], _)] => ()

 | _ => error "--- Refine.refine test-pbtyps --- broken with case 3";

(* 

*** pass ["pbla"]

*** pass ["pbla", "pbla1"]

*** pass ["pbla", "pbla2"]

*** pass ["pbla", "pbla2", "pbla2x"]

*** pass ["pbla", "pbla2", "pbla2y"]

*** pass ["pbla", "pbla2", "pbla2z"]

*** pass ["pbla", "pbla3"]

val it =

  [M_Match.Matches

     (["pbla"],

      {Find=[],

       Given=[Correct "fixedValues [aaa = #0]",Superfl "valuesFor aaa222"],

       Relate=[],Where=[],With=[]}),

   M_Match.NoMatch

     (["pbla1", "pbla"],

      {Find=[],

       Given=[Correct "fixedValues [aaa = #0]",Missing "maximum a1_",

              Superfl "valuesFor aaa222"],Relate=[],Where=[],With=[]}),

   M_Match.Matches

     (["pbla2", "pbla"],

      {Find=[],

       Given=[Correct "fixedValues [aaa = #0]",Correct "valuesFor aaa222"],

       Relate=[],Where=[],With=[]}),

   M_Match.NoMatch

     (["pbla2x", "pbla2", "pbla"],

      {Find=[],

       Given=[Correct "fixedValues [aaa = #0]",Correct "valuesFor aaa222",

              Missing "functionOf a2x_"],Relate=[],Where=[],With=[]}),

   M_Match.NoMatch

     (["pbla2y", "pbla2", "pbla"],

      {Find=[],

       Given=[Correct "fixedValues [aaa = #0]",Correct "valuesFor aaa222",

              Missing "boundVariable a2y_"],Relate=[],Where=[],With=[]}),

   M_Match.NoMatch

     (["pbla2z", "pbla2", "pbla"],

      {Find=[],

       Given=[Correct "fixedValues [aaa = #0]",Correct "valuesFor aaa222",

              Missing "interval a2z_"],Relate=[],Where=[],With=[]}),

   M_Match.NoMatch

     (["pbla3", "pbla"],

      {Find=[],

       Given=[Correct "fixedValues [aaa = #0]",Missing "relations a3_",

              Superfl "valuesFor aaa222"],Relate=[],Where=[],With=[]})]

  : match list*)

(*case 4: refined to children (without child)*)

case Refine.refine fmz4 ["pbla", "refine", "test"] of

    [M_Match.Matches (["pbla", "refine", "test"], _), 

     M_Match.NoMatch (["pbla1", "pbla", "refine", "test"], _), 

     M_Match.Matches (["pbla2", "pbla", "refine", "test"], _), 

     M_Match.NoMatch (["pbla2x", "pbla2", "pbla", "refine", "test"], _), 

     M_Match.Matches (["pbla2y", "pbla2", "pbla", "refine", "test"], _)] => ()

  | _ => error "--- Refine.refine test-pbtyps --- broken with case 4";

(* 

*** pass ["pbla"]

*** pass ["pbla", "pbla1"]

*** pass ["pbla", "pbla2"]

*** pass ["pbla", "pbla2", "pbla2x"]

*** pass ["pbla", "pbla2", "pbla2y"]

val it =

  [M_Match.Matches

     (["pbla"],

      {Find=[],

       Given=[Correct "fixedValues [aaa = #0]",Superfl "valuesFor aaa222",

              Superfl "boundVariable aaa222yyy"],Relate=[],Where=[],With=[]}),

   M_Match.NoMatch

     (["pbla1", "pbla"],

      {Find=[],

       Given=[Correct "fixedValues [aaa = #0]",Missing "maximum a1_",

              Superfl "valuesFor aaa222",Superfl "boundVariable aaa222yyy"],

       Relate=[],Where=[],With=[]}),

   M_Match.Matches

     (["pbla2", "pbla"],

      {Find=[],

       Given=[Correct "fixedValues [aaa = #0]",Correct "valuesFor aaa222",

              Superfl "boundVariable aaa222yyy"],Relate=[],Where=[],With=[]}),

   M_Match.NoMatch

     (["pbla2x", "pbla2", "pbla"],

      {Find=[],

       Given=[Correct "fixedValues [aaa = #0]",Correct "valuesFor aaa222",

              Missing "functionOf a2x_",Superfl "boundVariable aaa222yyy"],

       Relate=[],Where=[],With=[]}),

   M_Match.Matches

     (["pbla2y", "pbla2", "pbla"],

      {Find=[],

       Given=[Correct "fixedValues [aaa = #0]",Correct "valuesFor aaa222",

              Correct "boundVariable aaa222yyy"],Relate=[],Where=[],With=[]})]

  : match list*)

(*case 5: start refinement somewhere in ptyps*)

case Refine.refine fmz4 ["pbla2", "pbla", "refine", "test"] of

    [M_Match.Matches (["pbla2", "pbla", "refine", "test"], _), 

     M_Match.NoMatch (["pbla2x", "pbla2", "pbla", "refine", "test"], _), 

     M_Match.Matches (["pbla2y", "pbla2", "pbla", "refine", "test"], _)] => ()

  | _ => error "--- Refine.refine test-pbtyps --- broken with case 5";

(* 

*** pass ["pbla", "pbla2"]

*** pass ["pbla", "pbla2", "pbla2x"]

*** pass ["pbla", "pbla2", "pbla2y"]

val it =

  [M_Match.Matches

     (["pbla2", "pbla"],

      {Find=[],

       Given=[Correct "fixedValues [aaa = #0]",Correct "valuesFor aaa222",

              Superfl "boundVariable aaa222yyy"],Relate=[],Where=[],With=[]}),

   M_Match.NoMatch

     (["pbla2x", "pbla2", "pbla"],

      {Find=[],

       Given=[Correct "fixedValues [aaa = #0]",Correct "valuesFor aaa222",

              Missing "functionOf a2x_",Superfl "boundVariable aaa222yyy"],

       Relate=[],Where=[],With=[]}),

   M_Match.Matches

     (["pbla2y", "pbla2", "pbla"],

      {Find=[],

       Given=[Correct "fixedValues [aaa = #0]",Correct "valuesFor aaa222",

              Correct "boundVariable aaa222yyy"],Relate=[],Where=[],With=[]})]

  : match list*)

"----------- Refine_Problem (from subp-rooteq.sml) ---------------------------------------------";

"----------- Refine_Problem (from subp-rooteq.sml) ---------------------------------------------";

"----------- Refine_Problem (from subp-rooteq.sml) ---------------------------------------------";

(*

  By child of 2d962612dd0a this test case revealed an undetected failure

  of Specify.find_next_step -- for_problem: these propose Tactic.Refine_Problem,

  but Step_Specify.by_tactic_input (Refine_Problem ["sqroot-test", "univariate", "equation", "test"]..

  encounters "case Refine.problem ... of NONE".

  The failure might be caused by inappropriate problem-hierarchy.

*)

val c = [];

val fmz = ["equality ((x+1)*(x+2)=x^^^2+(8::real))", "solveFor x",

	   "errorBound (eps=0)", "solutions L"];

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

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

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

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

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

(*[], Pbl*)val (p,_,f,nxt,_,pt) = me nxt p c pt; (*\<rightarrow>Add_Find "solutions L"*)

(*=== specify a not-matching problem ---vvvvvvvvvvvvvvvvvvvvvvvvvvvv*)

val nxt = (Specify_Problem ["LINEAR", "univariate", "equation", "test"]);

(*=== specify a not-matching problem ---^^^^^^^^^^^^^^^^^^^^^^^^^^^^*)

(*[], Pbl*)val (p,_,f,nxt,_,pt) = me nxt p c pt; (*\<rightarrow>Add_Find "solutions L"*)

val www =

case f of Test_Out.PpcKF (Test_Out.Problem [],

  {Find = [Incompl "solutions []"], With = [],

   Given = [Correct "equality ((x + 1) * (x + 2) = x ^^^ 2 + 8)", Correct "solveFor x"],

   Where = [False www(*! ! ! ! ! !*)],

   Relate = [],...}) => www(*! ! !*)

| _ => error "--- Refine_Problem broken 1";

if www = "matches (x = 0) ((x + 1) * (x + 2) = x ^^^ 2 + 8) \<or>\nmatches (?b * x = 0) ((x + 1) * (x + 2) = x ^^^ 2 + 8) \<or>\nmatches (?a + x = 0) ((x + 1) * (x + 2) = x ^^^ 2 + 8) \<or>\nmatches (?a + ?b * x = 0) ((x + 1) * (x + 2) = x ^^^ 2 + 8)"

then () else error "--- Refine_Problem broken 2";

(*ML> f; 

val it = Form' (Test_Out.PpcKF (0,EdUndef,0,Nundef,

        (Problem ["LINEAR", "univariate", "equation", "test"],   <<<<<===== diff.to above WN120313

         {Find=[Incompl "solutions []"],

          Given=[Correct "equality ((x + #1) * (x + #2) = x ^^^ #2 + #8)",

                 Correct "solveFor x"],Relate=[],

          Where=[False "matches (x = #0) ((x + #1) * (x + #2) = x ^^^ #2 + #8)

                |\nmatches (?b * x = #0) ((x + #1) * (x + #2) = x ^^^ #2 + #8)

                |\nmatches (?a + x = #0) ((x + #1) * (x + #2) = x ^^^ #2 + #8)

        |\nmatches (?a + ?b * x = #0) ((x + #1) * (x + #2) = x ^^^ #2 + #8)"],

          With=[]}))) : mout

*)

(*/------------------- step into me Add_Find "solutions L" ---------------------------------\*)

(*[], Pbl*)val (p''''',_,f''''',nxt''''',_,pt''''') = (me nxt p c pt);

"~~~~~ fun me , args:"; val (tac, p, _(*NEW remove*), pt) = (nxt, p, c, pt);

(*+*)val Add_Find "solutions L" = tac;

      val (pt, p) =

  	    (*Step.by_tactic is here for testing by me; do_next would suffice in me*)

  	    case Step.by_tactic tac (pt, p) of

  		    ("ok", (_, _, ptp)) => ptp

  	    | ("unsafe-ok", (_, _, ptp)) => ptp

  	    | ("not-applicable",_) => (pt, p)

  	    | ("end-of-calculation", (_, _, ptp)) => ptp

  	    | ("failure", _) => raise ERROR "sys-raise ERROR"

  	    | _ => raise ERROR "me: uncovered case Step.by_tactic"

  val ("helpless", ([(*\<Or> should contain tac \<Or>*)], [], _)) = (*case*)

      Step.do_next p ((pt, Pos.e_pos'), []) (*of*);

"~~~~~ fun do_next , args:"; val ((ip as (_, p_)), (ptp as (pt, p), tacis)) = (p, ((pt, Pos.e_pos'), []));

  (*if*) Pos.on_calc_end ip (*else*);

      val (_, probl_id, _) = Calc.references (pt, p);

      val _ = (*case*) tacis (*of*);

        (*if*) probl_id = Problem.id_empty (*else*);

           switch_specify_solve p_ (pt, ip) (*return from Step.do_next*);

"~~~~~ fun switch_specify_solve , args:"; val (state_pos, (pt, input_pos)) = (p_, (pt, ip));

      (*if*) Pos.on_specification ([], state_pos) (*then*);

  val ("failure", ([], [], _)) =

           specify_do_next (pt, input_pos);

"~~~~~ fun specify_do_next , args:"; val (ptp as (pt, (p, p_))) = (pt, input_pos);

    val (_, (p_', tac)) =

  Specify.find_next_step ptp;

(*/------------------- step into find_next_step --------------------------------------------\*)

(*+ store for continuation after find_next_step*)val (p_'_'''''_', tac'''''_') = (p_', tac);

"~~~~~ fun find_next_step , args:"; val (pt, pos as (_, p_)) = (ptp);

    val {meth = met, origin = origin as (oris, o_refs as (_, pI', mI'), _), probl = pbl,

      spec = refs, ...} = Calc.specify_data (pt, pos);

      (*if*) Ctree.just_created (pt, pos) andalso origin <> Ctree.e_origin (*else*);

        (*if*) p_ = Pos.Pbl (*then*);

  val ("dummy", (Pbl, Refine_Problem ["sqroot-test", "univariate", "equation", "test"])) =

           for_problem oris (o_refs, refs) (pbl, met);

"~~~~~ fun for_problem , args:"; val (oris, ((dI', pI', mI'), (dI, pI, mI)), (pbl, met)) =

  (oris, (o_refs, refs), (pbl, met));

    val cpI = if pI = Problem.id_empty then pI' else pI;

    val cmI = if mI = MethodC.id_empty then mI' else mI;

    val {ppc = pbt, prls, where_, ...} = Problem.from_store cpI;

    val {ppc = mpc, ...} = MethodC.from_store cmI

    val (preok, (*+*)xxxxx(*+*) ) = Pre_Conds.check prls where_ pbl 0;

    (*if*) dI' = ThyC.id_empty andalso dI = ThyC.id_empty (*else*);

      (*if*) pI' = Problem.id_empty andalso pI = Problem.id_empty (*else*);

      val NONE = (*case*) find_first (I_Model.is_error o #5) pbl (*of*);

      val NONE = (*case*)

        item_to_add (ThyC.get_theory (if dI = ThyC.id_empty then dI' else dI)) oris pbt pbl (*of*);

      (*if*) not preok (*then*);

(*+*)Pre_Conds.to_string xxxxx = "[\n" ^

  "(false, matches (x = 0) ((x + 1) * (x + 2) = x ^^^ 2 + 8) \<or>\n" ^

    "matches (?b * x = 0) ((x + 1) * (x + 2) = x ^^^ 2 + 8) \<or>\n" ^

    "matches (?a + x = 0) ((x + 1) * (x + 2) = x ^^^ 2 + 8) \<or>\n" ^

    "matches (?a + ?b * x = 0) ((x + 1) * (x + 2) = x ^^^ 2 + 8))]";

  (*matches  ^^^^^^^^^^^^^^^^ NONE, ok: why then NONE = Refine.problem below?*)

(*-------------------- stop step into find_next_step ----------------------------------------*)

(*+ continue after find_next_step*)val (p_', tac) = (p_'_'''''_', tac'''''_')

(*\------------------- step into find_next_step --------------------------------------------/*)

(*-------------------- contiue step into specify_do_next ------------------------------------*)

    val ist_ctxt =  Ctree.get_loc pt (p, p_)

  val Refine_Problem ["sqroot-test", "univariate", "equation", "test"] =

    (*case*) tac (*of*);

  val ("failure", ([(*\<Or> should contain tac \<Or>*)], [], _)) = 

Step_Specify.by_tactic_input tac (pt, (p, p_'));

"~~~~~ fun by_tactic_input , args:"; val ((Tactic.Refine_Problem pI), (ptp as (pt, pos as (p,_)))) =

  (tac, (pt, (p, p_')));

      val (dI, dI', probl, ctxt) = case get_obj I pt p of

        PblObj {origin= (_, (dI, _, _), _), spec = (dI', _, _), probl, ctxt, ...} =>

          (dI, dI', probl, ctxt)

	    val thy = if dI' = ThyC.id_empty then dI else dI'

      val NONE = (*case*) (*------------------------------- vvv*)

    Refine.problem (ThyC.get_theory thy) pI probl (*of*);

"~~~~~ fun problem , args:"; val (thy, pblID, itms) = ((ThyC.get_theory thy), pI, probl);

(*  val SOME (Refine.Match_ (["sqroot-test", "univariate", "equation", "test"], _)) =*)

  val SOME (Refine.Match_ (rfd as (pI', _))) = (*case*) 

    Refine.refined_ ((Store.apply (get_ptyps ())) (Refine.refin'' thy ((rev o tl) pblID) itms []) pblID (rev pblID)) (*of*);

    (*if*) pblID = pI' (*then*);

    NONE  (*return from problem*);

(*-------------------- stop step into -------------------------------------------------------*)

val (p,f,nxt,pt) = (p''''',f''''',nxt''''',pt''''');

(*\------------------- step into me Add_Find "solutions L" ---------------------------------/*)

(*=== refine problem -----vvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvv*)

val nxt = (Refine_Problem ["univariate", "equation", "test"]);

(*=== refine problem -----^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^*)

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

(*("Specify_Problem", Specify_Problem ["normalise", "univariate", ...])*)

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

(*nxt = ("Specify_Theory", Specify_Theory "Test")*)

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

(*nxt = ("Specify_Method", Specify_Method ["Test", "squ-equ-test-subpbl1"]*)

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

(*nxt = ("Apply_Method", *)

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

(*nxt = ("Rewrite_Set", Rewrite_Set "norm_equation")*)

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

(*nxt = ("Rewrite_Set", Rewrite_Set "Test_simplify")*)

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

(*Subproblem ("Test", ["LINEAR", "univariate", "equation", "test"]*)

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

(*nxt = Model_Problem ["LINEAR", "univariate", "equation", "test"]*)

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

(*nxt = ("Add_Given", Add_Given "equality (-6 + 3 * x = 0)"*)

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

(**)

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

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

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

(*nxt = Specify_Problem ["LINEAR", "univariate", "equation", "test"])*)

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

(*xt = ("Specify_Method", Specify_Method ["Test", "solve_linear"])*)

val nxt = (Refine_Problem ["univariate", "equation", "test"]);

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

(*("Specify_Problem", Specify_Problem ["LINEAR", "univariate", ...])*)

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

(*val nxt = ("Specify_Method",Specify_Method ("Test", "solve_linear"))*)

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

(*val nxt = ("Apply_Method",Apply_Method ("Test", "solve_linear"))*)

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

(*val nxt = ("Rewrite_Set_Inst",Rewrite_Set_Inst ([#],"isolate_bdv"))*)

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

(*val nxt = ("Rewrite_Set",Rewrite_Set "Test_simplify")*)

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

(*val nxt = ("Check_Postcond",Check_Postcond ["LINEAR", "univariate", "eq*)

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

(*val nxt = ("Check_elementwise",Check_elementwise "Assumptions")*)

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

(*Check_Postcond ["normalise", "univariate", "equation", "test"])*)

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

val Test_Out.FormKF res = f;

if res = "[x = 2]"

then case nxt of End_Proof' => ()

  | _ => error "new behaviour in test:refine.sml:miniscript with mini-subpb 1"

else error "new behaviour in test:refine.sml:miniscript with mini-subpb 2"