wneuper/isa: test/Tools/isac/Interpret/error-pattern.sml@06ec8abfd3bc (annotated)

walther@59909	1	(* Title: "Interpret/error-pattern.sml"
akargl@42176	2	Author: Walther Neuper 060225,
neuper@37906	3	(c) due to copyright terms
walther@59860	4
walther@59860	5	Strange ERROR "Undefined fact: "all_left""
neuper@37906	6	*)
neuper@37906	7
neuper@37906	8	"-----------------------------------------------------------------";
neuper@37906	9	"table of contents -----------------------------------------------";
neuper@37906	10	"-----------------------------------------------------------------";
neuper@37906	11	"appendForm with miniscript with mini-subpbl:";
neuper@37906	12	"--------- appendFormula: on Res + equ_nrls ----------------------";
neuper@37906	13	"--------- appendFormula: on Frm + equ_nrls ----------------------";
neuper@37906	14	"--------- appendFormula: on Res + NO deriv ----------------------";
neuper@37906	15	"--------- appendFormula: on Res + late deriv [x = 3 + -2]---///--";
neuper@37906	16	"replaceForm with miniscript with mini-subpbl:";
neuper@37906	17	"--------- replaceFormula: on Res + = ----------------------------";
neuper@37906	18	"--------- replaceFormula: on Res + = 1st Nd ---------------------";
neuper@37906	19	"--------- replaceFormula: on Frm + = 1st Nd ---------------------";
neuper@37906	20	"--------- replaceFormula: cut calculation -----------------------";
neuper@37906	21	"--------- replaceFormula: cut calculation -----------------------";
neuper@37906	22	(* 040307 copied from informtest.sml ... old versions
neuper@37906	23	"--------- maximum-example, UC: Modeling / modifyCalcHead --------";*)
neuper@37906	24	"--------- syntax error ------------------------------------------";
neuper@37906	25	"CAS-command:";
Walther@60571	26	("--------- CAS-command on ([],Pbl) -------------------------------";)
Walther@60571	27	("--------- CAS-command on ([],Pbl) FE-interface ------------------";)
walther@59772	28	"--------- locate_input_term [rational,simplification] ----------------------";
Walther@60571	29	("--------- Take as 1st tac, start with <NEW> (CAS input) ---------";)
neuper@37906	30	"--------- Take as 1st tac, start from exp -----------------------";
Walther@60571	31	("--------- implicit_take, start with <NEW> (CAS input) ---------------";)
walther@59909	32	"--------- build fun check_for' ------------------------------";
walther@59909	33	"--------- build fun check_for' ?bdv -------------------------";
walther@59909	34	"--------- build fun check_for ------------------------";
walther@59909	35	"--------- embed fun check_for ------------------------";
Walther@60637	36	"----------- re-build: fill_from_store without thy-hierarchy -----------------------------------";
walther@59909	37	"--------- embed fun find_fill_patterns ---------------------------";
neuper@48895	38	"--------- build fun is_exactly_equal, inputFillFormula ----------";
wneuper@59262	39	"--------- fun appl_adds -----------------------------------------";
wneuper@59264	40	"--------- fun concat_deriv --------------------------------------";
wneuper@59264	41	"--------- handle an input formula -------------------------------";
wneuper@59264	42	"--------- fun dropwhile' ----------------------------------------";
neuper@37906	43	"-----------------------------------------------------------------";
neuper@37906	44	"-----------------------------------------------------------------";
neuper@37906	45	"-----------------------------------------------------------------";
neuper@37906	46
neuper@37906	47
neuper@37906	48	"--------- appendFormula: on Res + equ_nrls ----------------------";
neuper@37906	49	"--------- appendFormula: on Res + equ_nrls ----------------------";
neuper@37906	50	"--------- appendFormula: on Res + equ_nrls ----------------------";
Walther@60586	51	val Prog sc = (#program o MethodC.from_store ctxt) ["Test", "squ-equ-test-subpbl1"];
walther@59868	52	(writeln o UnparseC.term) sc;
Walther@60586	53	val Prog sc = (#program o MethodC.from_store ctxt) ["Test", "solve_linear"];
walther@59868	54	(writeln o UnparseC.term) sc;
neuper@37906	55
Walther@60549	56	States.reset ();
Walther@60571	57	CalcTree @{context} [(["equality (x+1=(2::real))", "solveFor x", "solutions L"],
walther@59997	58	("Test", ["sqroot-test", "univariate", "equation", "test"],
walther@59997	59	["Test", "squ-equ-test-subpbl1"]))];
neuper@37906	60	Iterator 1; moveActiveRoot 1;
wneuper@59248	61	autoCalculate 1 CompleteCalcHead;
Walther@60549	62	autoCalculate 1 (Steps 1); refFormula 1 (States.get_pos 1 1);(x + 1 = 2)
Walther@60549	63	autoCalculate 1 (Steps 1); refFormula 1 (States.get_pos 1 1);(x + 1 + - 1 2 = 0*);
neuper@37906	64
Walther@60549	65	appendFormula 1 "- 2 * 1 + (1 + x) = 0" (\|> Future.join); refFormula 1 (States.get_pos 1 1);
Walther@60549	66	val ((pt,_),_) = States.get_calc 1;
Walther@60608	67	val str = pr_ctree ctxt pr_short pt;
neuper@48895	68	if str =
neuper@48895	69	(". ----- pblobj -----\n" ^
neuper@48895	70	"1. x + 1 = 2\n" ^
walther@60324	71	"2. x + 1 + - 1 * 2 = 0\n" ^
walther@60324	72	"2.1. x + 1 + - 1 * 2 = 0\n" ^
walther@60324	73	"2.2. 1 + x + - 1 * 2 = 0\n" ^
walther@60324	74	"2.3. 1 + (x + - 1 * 2) = 0\n" ^
walther@60324	75	"2.4. 1 + (x + - 2) = 0\n" ^
walther@60324	76	"2.5. 1 + (x + - 2 * 1) = 0\n" ^
walther@60324	77	"2.6. 1 + x + - 2 * 1 = 0\n" ) then ()
neuper@48895	78	else error "inform.sml: diff.behav.appendFormula: on Res + equ 1";
neuper@37906	79
neuper@37906	80	moveDown 1 ([ ],Pbl); refFormula 1 ([1],Frm); (x + 1 = 2)
walther@60324	81	moveDown 1 ([1],Frm); refFormula 1 ([1],Res); (x + 1 + - 1 2 = 0*)
neuper@37906	82
neuper@37906	83	(the seven steps of detailed derivation)
neuper@37906	84	moveDown 1 ([1 ],Res); refFormula 1 ([2,1],Frm);
neuper@37906	85	moveDown 1 ([2,1],Frm); refFormula 1 ([2,1],Res);
neuper@37906	86	moveDown 1 ([2,1],Res); refFormula 1 ([2,2],Res);
neuper@37906	87	moveDown 1 ([2,2],Res); refFormula 1 ([2,3],Res);
neuper@37906	88	moveDown 1 ([2,3],Res); refFormula 1 ([2,4],Res);
neuper@37906	89	moveDown 1 ([2,4],Res); refFormula 1 ([2,5],Res);
neuper@37906	90	moveDown 1 ([2,5],Res); refFormula 1 ([2,6],Res);
Walther@60549	91	val ((pt,_),_) = States.get_calc 1;
walther@60324	92	if "- 2 * 1 + (1 + x) = 0" = UnparseC.term (fst (get_obj g_result pt [2,6])) then()
neuper@38031	93	else error "inform.sml: diff.behav.appendFormula: on Res + equ 2";
neuper@37906	94
neuper@37906	95	fetchProposedTactic 1; (takes Iterator 1 _1_)
neuper@48895	96	(* <ERROR> error in kernel </ERROR> ALREADY IN 2009-2*)
neuper@48895	97	(*========== inhibit exn WN1130701 broken at Isabelle2002 --> 2009-2 =============
Walther@60549	98	val (_,(tac,_,_)::_) = States.get_calc 1;
neuper@37906	99	if tac = Rewrite_Set "Test_simplify" then ()
neuper@38031	100	else error "inform.sml: diff.behav.appendFormula: on Res + equ 3";
neuper@48895	101	============ inhibit exn WN1130701 broken at Isabelle2002 --> 2009-2 ============*)
akargl@42209	102
wneuper@59248	103	autoCalculate 1 CompleteCalc;
Walther@60549	104	val ((pt,_),_) = States.get_calc 1;
walther@59868	105	if "[x = 1]" = UnparseC.term (fst (get_obj g_result pt [])) then ()
neuper@38031	106	else error "inform.sml: diff.behav.appendFormula: on Res + equ 4";
wneuper@59248	107	(* autoCalculate 1 CompleteCalc;
Walther@60549	108	val ((pt,p),_) = States.get_calc 1;
neuper@37906	109	(writeln o istates2str) (get_obj g_loc pt [ ]);
neuper@37906	110	(writeln o istates2str) (get_obj g_loc pt [1]);
neuper@37906	111	(writeln o istates2str) (get_obj g_loc pt [2]);
neuper@37906	112	(writeln o istates2str) (get_obj g_loc pt [3]);
neuper@37906	113	(writeln o istates2str) (get_obj g_loc pt [3,1]);
neuper@37906	114	(writeln o istates2str) (get_obj g_loc pt [3,2]);
neuper@37906	115	(writeln o istates2str) (get_obj g_loc pt [4]);
neuper@37906	116
neuper@37906	117	*)
neuper@37906	118	"----------------------------------------------------------";
akargl@42176	119
Walther@60500	120	val fod = Derive.do_one (Proof_Context.init_global @{theory "Isac_Knowledge"}) Atools_erls
walther@59852	121	((#rules o Rule_Set.rep) Test_simplify)
Walther@60594	122	(sqrt_right false) NONE
Walther@60565	123	(TermC.parse_test @{context} "x + 1 + - 1 * 2 = 0");
Walther@60611	124	(writeln o (Derive.trtas2str ctxt)) fod;
neuper@37906	125
Walther@60500	126	val ifod = Derive.do_one (Proof_Context.init_global @{theory "Isac_Knowledge"}) Atools_erls
walther@59852	127	((#rules o Rule_Set.rep) Test_simplify)
Walther@60594	128	(sqrt_right false) NONE
Walther@60565	129	(TermC.parse_test @{context} "- 2 * 1 + (1 + x) = 0");
Walther@60611	130	(writeln o (Derive.trtas2str ctxt)) ifod;
akargl@42176	131	fun equal (_,_,(t1, _)) (_,_,(t2, _)) = t1 = t2;
neuper@37906	132	val (fod', rifod') = dropwhile' equal (rev fod) (rev ifod);
Walther@60630	133	val der = fod' @ (map (Derive.rev_deriv' ctxt) rifod');
Walther@60611	134	(writeln o (Derive.trtas2str ctxt)) der;
neuper@37906	135	"----------------------------------------------------------";
wneuper@59252	136	DEconstrCalcTree 1;
neuper@37906	137
neuper@37906	138	"--------- appendFormula: on Frm + equ_nrls ----------------------";
neuper@37906	139	"--------- appendFormula: on Frm + equ_nrls ----------------------";
neuper@37906	140	"--------- appendFormula: on Frm + equ_nrls ----------------------";
Walther@60549	141	States.reset ();
Walther@60571	142	CalcTree @{context} [(["equality (x+1=(2::real))", "solveFor x", "solutions L"],
walther@59997	143	("Test", ["sqroot-test", "univariate", "equation", "test"],
walther@59997	144	["Test", "squ-equ-test-subpbl1"]))];
neuper@37906	145	Iterator 1; moveActiveRoot 1;
wneuper@59248	146	autoCalculate 1 CompleteCalcHead;
Walther@60549	147	autoCalculate 1 (Steps 1); refFormula 1 (States.get_pos 1 1) (x + 1 = 2);
Walther@60549	148	appendFormula 1 "2+ - 1 + x = 2" (\|> Future.join); refFormula 1 (States.get_pos 1 1);
neuper@37906	149
neuper@37906	150	moveDown 1 ([],Pbl); refFormula 1 ([1],Frm) (x + 1 = 2);
neuper@37906	151
neuper@37906	152	moveDown 1 ([1 ],Frm); refFormula 1 ([1,1],Frm);
neuper@37906	153	moveDown 1 ([1,1],Frm); refFormula 1 ([1,1],Res);
neuper@37906	154	moveDown 1 ([1,1],Res); refFormula 1 ([1,2],Res);
neuper@37906	155	moveDown 1 ([1,2],Res); refFormula 1 ([1,3],Res);
neuper@37906	156	moveDown 1 ([1,3],Res); refFormula 1 ([1,4],Res);
neuper@37906	157	moveDown 1 ([1,4],Res); refFormula 1 ([1,5],Res);
neuper@37906	158	moveDown 1 ([1,5],Res); refFormula 1 ([1,6],Res);
Walther@60549	159	val ((pt,_),_) = States.get_calc 1;
walther@60324	160	if "2 + - 1 + x = 2" = UnparseC.term (fst (get_obj g_result pt [1,6])) then()
neuper@38031	161	else error "inform.sml: diff.behav.appendFormula: on Frm + equ 1";
neuper@37906	162
neuper@37906	163	fetchProposedTactic 1; (takes Iterator 1 _1_)
Walther@60549	164	val (_,(tac,_,_)::_) = States.get_calc 1;
wneuper@59253	165	case tac of Rewrite_Set "norm_equation" => ()
wneuper@59253	166	\| _ => error "inform.sml: diff.behav.appendFormula: on Frm + equ 2";
wneuper@59248	167	autoCalculate 1 CompleteCalc;
Walther@60549	168	val ((pt,_),_) = States.get_calc 1;
walther@59868	169	if "[x = 1]" = UnparseC.term (fst (get_obj g_result pt [])) then ()
neuper@38031	170	else error "inform.sml: diff.behav.appendFormula: on Frm + equ 3";
wneuper@59252	171	DEconstrCalcTree 1;
neuper@37906	172
neuper@37906	173	"--------- appendFormula: on Res + NO deriv ----------------------";
neuper@37906	174	"--------- appendFormula: on Res + NO deriv ----------------------";
neuper@37906	175	"--------- appendFormula: on Res + NO deriv ----------------------";
Walther@60549	176	States.reset ();
Walther@60571	177	CalcTree @{context} [(["equality (x+1=(2::real))", "solveFor x", "solutions L"],
walther@59997	178	("Test", ["sqroot-test", "univariate", "equation", "test"],
walther@59997	179	["Test", "squ-equ-test-subpbl1"]))];
neuper@37906	180	Iterator 1; moveActiveRoot 1;
wneuper@59248	181	autoCalculate 1 CompleteCalcHead;
Walther@60549	182	autoCalculate 1 (Steps 1); refFormula 1 (States.get_pos 1 1);(x + 1 = 2)
Walther@60549	183	autoCalculate 1 (Steps 1); refFormula 1 (States.get_pos 1 1);(x + 1 + - 1 2 = 0*);
neuper@37906	184
wneuper@59123	185	appendFormula 1 "x = 2" (\|> Future.join);
Walther@60549	186	val ((pt,p),_) = States.get_calc 1;
Walther@60608	187	val str = pr_ctree ctxt pr_short pt;
neuper@37906	188	writeln str;
neuper@37906	189	if str = ". ----- pblobj -----\n1. x + 1 = 2\n" andalso p = ([1], Res)
neuper@37906	190	then ()
neuper@38031	191	else error "inform.sml: diff.behav.appendFormula: Res + NOder 1";
neuper@37906	192
neuper@37906	193	fetchProposedTactic 1;
Walther@60549	194	val (_,(tac,_,_)::_) = States.get_calc 1;
wneuper@59253	195	case tac of Rewrite_Set "Test_simplify" => ()
wneuper@59253	196	\| _ => error "inform.sml: diff.behav.appendFormula: Res + NOder 2";
wneuper@59248	197	autoCalculate 1 CompleteCalc;
Walther@60549	198	val ((pt,_),_) = States.get_calc 1;
walther@59868	199	if "[x = 1]" = UnparseC.term (fst (get_obj g_result pt [])) then ()
neuper@38031	200	else error "inform.sml: diff.behav.appendFormula: on Frm + equ 3";
wneuper@59252	201	DEconstrCalcTree 1;
neuper@37906	202
neuper@37906	203	"--------- appendFormula: on Res + late deriv --------------------";
neuper@37906	204	"--------- appendFormula: on Res + late deriv --------------------";
neuper@37906	205	"--------- appendFormula: on Res + late deriv --------------------";
walther@59794	206	(*cp with "fun me" to test/../lucas-interpreter.sml:
walther@59794	207	re-build: fun locate_input_term ---------------------------------------------------";
walther@59794	208	*)
Walther@60549	209	States.reset ();
Walther@60571	210	CalcTree @{context} [(["equality (x+1=(2::real))", "solveFor x", "solutions L"],
walther@59997	211	("Test", ["sqroot-test", "univariate", "equation", "test"],
walther@59997	212	["Test", "squ-equ-test-subpbl1"]))];
neuper@37906	213	Iterator 1; moveActiveRoot 1;
wneuper@59248	214	autoCalculate 1 CompleteCalcHead;
Walther@60549	215	autoCalculate 1 (Steps 1); refFormula 1 (States.get_pos 1 1);(x + 1 = 2)
Walther@60549	216	autoCalculate 1 (Steps 1); refFormula 1 (States.get_pos 1 1);(x + 1 + - 1 2 = 0*);
neuper@37906	217
wneuper@59123	218	appendFormula 1 "x = 1" (\|> Future.join);
Walther@60549	219	val ((pt,p),_) = States.get_calc 1;
Walther@60608	220	val str = pr_ctree ctxt pr_short pt;
neuper@37906	221	writeln str;
walther@60324	222	if str = ". ----- pblobj -----\n1. x + 1 = 2\n2. x + 1 + - 1 * 2 = 0\n3. ----- pblobj -----\n3.1. - 1 + x = 0\n3.2. x = 0 + - 1 * - 1\n3.2.1. x = 0 + - 1 * - 1\n3.2.2. x = 0 + 1\n" andalso p = ([3,2], Res)
neuper@37906	223	then () (finds 1 step too early: ([3,2], Res) "x = 1" also by script !!!)
neuper@38031	224	else error "inform.sml: diff.behav.appendFormula: Res + late d 1";
akargl@42176	225
neuper@37906	226	fetchProposedTactic 1;
Walther@60549	227	val (_,(tac,_,_)::_) = States.get_calc 1;
wneuper@59253	228	case tac of Check_Postcond ["LINEAR", "univariate", "equation", "test"] => ()
wneuper@59253	229	\| _ => error "inform.sml: diff.behav.appendFormula: Res + late d 2";
wneuper@59248	230	autoCalculate 1 CompleteCalc;
Walther@60549	231	val ((pt,_),_) = States.get_calc 1;
walther@59868	232	if "[x = 1]" = UnparseC.term (fst (get_obj g_result pt [])) then ()
neuper@38031	233	else error "inform.sml: diff.behav.appendFormula: Res + late d 3";
wneuper@59252	234	DEconstrCalcTree 1;
neuper@37906	235
walther@60324	236	"--------- appendFormula: on Res + late deriv [x = 3 + - 2]---///--";
walther@60324	237	"--------- appendFormula: on Res + late deriv [x = 3 + - 2]---///--";
walther@60324	238	"--------- appendFormula: on Res + late deriv [x = 3 + - 2]---///--";
Walther@60549	239	States.reset ();
Walther@60571	240	CalcTree @{context} [(["equality (x+1=(2::real))", "solveFor x", "solutions L"],
walther@59997	241	("Test", ["sqroot-test", "univariate", "equation", "test"],
walther@59997	242	["Test", "squ-equ-test-subpbl1"]))];
neuper@37906	243	Iterator 1; moveActiveRoot 1;
wneuper@59248	244	autoCalculate 1 CompleteCalcHead;
Walther@60549	245	autoCalculate 1 (Steps 1); refFormula 1 (States.get_pos 1 1);(x + 1 = 2)
Walther@60549	246	autoCalculate 1 (Steps 1); refFormula 1 (States.get_pos 1 1);(x + 1 + - 1 2 = 0*);
wneuper@59123	247	appendFormula 1 "[x = 3 + -21]" (\|> Future.join*);
Walther@60549	248	val ((pt,p),_) = States.get_calc 1;
Walther@60608	249	val str = pr_ctree ctxt pr_short pt;
neuper@37906	250	writeln str;
walther@60324	251	if str=". ----- pblobj -----\n1. x + 1 = 2\n2. x + 1 + - 1 * 2 = 0\n3. ----- pblobj -----\n3.1. - 1 + x = 0\n3.2. x = 0 + - 1 * - 1\n4. [x = 1]\n4.1. [x = 1]\n4.2. [x = - 2 + 3]\n4.3. [x = 3 + - 2]\n" then ()
neuper@38031	252	else error "inform.sml: diff.behav.appendFormula: Res + latEE 1";
wneuper@59248	253	autoCalculate 1 CompleteCalc;
Walther@60549	254	val ((pt,p),_) = States.get_calc 1;
walther@60324	255	if "[x = 3 + - 2 * 1]" = UnparseC.term (fst (get_obj g_result pt [])) then ()
neuper@37906	256	(* ~~~~~~~~~~ simplify as last step in any script ?!*)
neuper@38031	257	else error "inform.sml: diff.behav.appendFormula: Res + latEE 2";
wneuper@59252	258	DEconstrCalcTree 1;
neuper@37906	259
neuper@37906	260	"--------- replaceFormula: on Res + = ----------------------------";
neuper@37906	261	"--------- replaceFormula: on Res + = ----------------------------";
neuper@37906	262	"--------- replaceFormula: on Res + = ----------------------------";
Walther@60549	263	States.reset ();
Walther@60571	264	CalcTree @{context} [(["equality (x+1=(2::real))", "solveFor x", "solutions L"],
walther@59997	265	("Test", ["sqroot-test", "univariate", "equation", "test"],
walther@59997	266	["Test", "squ-equ-test-subpbl1"]))];
neuper@37906	267	Iterator 1; moveActiveRoot 1;
wneuper@59248	268	autoCalculate 1 CompleteCalcHead;
Walther@60549	269	autoCalculate 1 (Steps 1); refFormula 1 (States.get_pos 1 1);(x + 1 = 2)
Walther@60549	270	autoCalculate 1 (Steps 1); refFormula 1 (States.get_pos 1 1);(x + 1 + - 1 2 = 0*);
Walther@60549	271	autoCalculate 1 (Steps 1); refFormula 1 (States.get_pos 1 1);(- 1 + x);
neuper@37906	272
Walther@60549	273	replaceFormula 1 "-2 * 1 + (1 + x) = 0"; refFormula 1 (States.get_pos 1 1);
Walther@60549	274	val ((pt,_),_) = States.get_calc 1;
Walther@60608	275	val str = pr_ctree ctxt pr_short pt;
akargl@42176	276
neuper@48895	277	(* before AK110725 this was
neuper@48895	278	". ----- pblobj -----\n
neuper@48895	279	1. x + 1 = 2\n
walther@60324	280	2. x + 1 + - 1 * 2 = 0\n
walther@60324	281	2.1. x + 1 + - 1 * 2 = 0\n
walther@60324	282	2.2. 1 + x + - 1 * 2 = 0\n
walther@60324	283	2.3. 1 + (x + - 1 * 2) = 0\n
neuper@48895	284	2.4. 1 + (x + -2) = 0\n
neuper@48895	285	2.5. 1 + (x + -2 * 1) = 0\n
neuper@48895	286	2.6. 1 + x + -2 * 1 = 0\n";
neuper@48895	287	*)
Walther@60523	288	if str =
neuper@48895	289	". ----- pblobj -----\n"^
neuper@48895	290	"1. x + 1 = 2\n"^
walther@60324	291	"2. x + 1 + - 1 * 2 = 0\n"^
walther@60324	292	"2.1. x + 1 + - 1 * 2 = 0\n"^
walther@60324	293	"2.2. 1 + x + - 1 * 2 = 0\n"^
walther@60324	294	"2.3. 1 + (x + - 1 * 2) = 0\n"^
walther@60324	295	"2.4. 1 + (x + - 2) = 0\n"^
walther@60324	296	"2.5. 1 + (x + - 2 * 1) = 0\n"^
walther@60324	297	"2.6. 1 + x + - 2 * 1 = 0\n" then()
neuper@48895	298	else error "inform.sml: diff.behav.replaceFormula: on Res += 1";
akargl@42176	299
wneuper@59248	300	autoCalculate 1 CompleteCalc;
Walther@60549	301	val ((pt,pos as (p,_)),_) = States.get_calc 1;
walther@59868	302	if pos = ([],Res) andalso "[x = 1]" = (UnparseC.term o fst) (get_obj g_result pt p) then()
neuper@38031	303	else error "inform.sml: diff.behav.replaceFormula: on Res + = 2";
wneuper@59252	304	DEconstrCalcTree 1;
neuper@37906	305
neuper@37906	306	"--------- replaceFormula: on Res + = 1st Nd ---------------------";
neuper@37906	307	"--------- replaceFormula: on Res + = 1st Nd ---------------------";
neuper@37906	308	"--------- replaceFormula: on Res + = 1st Nd ---------------------";
Walther@60549	309	States.reset ();
Walther@60571	310	CalcTree @{context} [(["equality (x+1=(2::real))", "solveFor x", "solutions L"],
walther@59997	311	("Test", ["sqroot-test", "univariate", "equation", "test"],
walther@59997	312	["Test", "squ-equ-test-subpbl1"]))];
neuper@37906	313	Iterator 1; moveActiveRoot 1;
wneuper@59248	314	autoCalculate 1 CompleteCalcHead;
Walther@60549	315	autoCalculate 1 (Steps 1); refFormula 1 (States.get_pos 1 1);(x + 1 = 2)
Walther@60549	316	autoCalculate 1 (Steps 1); refFormula 1 (States.get_pos 1 1);(x + 1 + - 1 2 = 0*);
neuper@37906	317
Walther@60549	318	replaceFormula 1 "x + 1 = 4 + -2"; refFormula 1 (States.get_pos 1 1);
Walther@60549	319	val ((pt,_),_) = States.get_calc 1;
Walther@60608	320	val str = pr_ctree ctxt pr_short pt;
neuper@37906	321	writeln str;
walther@60324	322	if str= ". ----- pblobj -----\n1. x + 1 = 2\n1.1. x + 1 = 2\n1.2. 1 + x = 2\n1.3. 1 + x = - 2 + 4\n1.4. x + 1 = - 2 + 4\n" then ()
neuper@38031	323	else error "inform.sml: diff.behav.replaceFormula: on Res 1 + = 1";
wneuper@59248	324	autoCalculate 1 CompleteCalc;
Walther@60549	325	val ((pt,pos as (p,_)),_) = States.get_calc 1;
walther@59868	326	if pos = ([],Res) andalso "[x = 1]" = (UnparseC.term o fst)(get_obj g_result pt p) then()
neuper@38031	327	else error "inform.sml: diff.behav.replaceFormula: on Res + = 2";
wneuper@59252	328	DEconstrCalcTree 1;
neuper@37906	329
neuper@37906	330	"--------- replaceFormula: on Frm + = 1st Nd ---------------------";
neuper@37906	331	"--------- replaceFormula: on Frm + = 1st Nd ---------------------";
neuper@37906	332	"--------- replaceFormula: on Frm + = 1st Nd ---------------------";
Walther@60549	333	States.reset ();
Walther@60571	334	CalcTree @{context} [(["equality (x+1=(2::real))", "solveFor x", "solutions L"],
walther@59997	335	("Test", ["sqroot-test", "univariate", "equation", "test"],
walther@59997	336	["Test", "squ-equ-test-subpbl1"]))];
neuper@37906	337	Iterator 1; moveActiveRoot 1;
wneuper@59248	338	autoCalculate 1 CompleteCalcHead;
Walther@60549	339	autoCalculate 1 (Steps 1); refFormula 1 (States.get_pos 1 1);(x + 1 = 2)
neuper@37906	340
Walther@60549	341	replaceFormula 1 "x + 1 = 4 + -2"; refFormula 1 (States.get_pos 1 1);
Walther@60549	342	val ((pt,_),_) = States.get_calc 1;
Walther@60608	343	val str = pr_ctree ctxt pr_short pt;
walther@60340	344	writeln str;
walther@60324	345	if str= ". ----- pblobj -----\n1. x + 1 = 2\n1.1. x + 1 = 2\n1.2. 1 + x = 2\n1.3. 1 + x = - 2 + 4\n1.4. x + 1 = - 2 + 4\n" then ()
neuper@38031	346	else error "inform.sml: diff.behav.replaceFormula: on Frm 1 + = 1";
wneuper@59248	347	autoCalculate 1 CompleteCalc;
Walther@60549	348	val ((pt,pos as (p,_)),_) = States.get_calc 1;
walther@59868	349	if pos = ([],Res) andalso "[x = 1]" = (UnparseC.term o fst)(get_obj g_result pt p) then()
neuper@38031	350	else error "inform.sml: diff.behav.replaceFormula: on Frm 1 + = 2";
wneuper@59252	351	DEconstrCalcTree 1;
neuper@37906	352
neuper@37906	353	"--------- replaceFormula: cut calculation -----------------------";
neuper@37906	354	"--------- replaceFormula: cut calculation -----------------------";
neuper@37906	355	"--------- replaceFormula: cut calculation -----------------------";
Walther@60549	356	States.reset ();
Walther@60571	357	CalcTree @{context} [(["equality (x+1=(2::real))", "solveFor x", "solutions L"],
walther@59997	358	("Test", ["sqroot-test", "univariate", "equation", "test"],
walther@59997	359	["Test", "squ-equ-test-subpbl1"]))];
neuper@37906	360	Iterator 1; moveActiveRoot 1;
wneuper@59248	361	autoCalculate 1 CompleteCalc;
neuper@37906	362	moveActiveRoot 1; moveActiveDown 1;
Walther@60549	363	if States.get_pos 1 1 = ([1], Frm) then ()
neuper@38031	364	else error "inform.sml: diff.behav. cut calculation 1";
neuper@37906	365
Walther@60549	366	replaceFormula 1 "x + 1 = 4 + -2"; refFormula 1 (States.get_pos 1 1);
Walther@60549	367	val ((pt,p),_) = States.get_calc 1;
Walther@60608	368	val str = pr_ctree ctxt pr_short pt;
neuper@37906	369	writeln str;
neuper@37906	370	if p = ([1], Res) then ()
neuper@38031	371	else error "inform.sml: diff.behav. cut calculation 2";
neuper@37906	372
neuper@37906	373
neuper@37906	374	(* 040307 copied from informtest.sml; ... old version
neuper@37906	375	"---------------- maximum-example, UC: Modeling / modifyCalcHead -";
neuper@37906	376	"---------------- maximum-example, UC: Modeling / modifyCalcHead -";
neuper@37906	377	"---------------- maximum-example, UC: Modeling / modifyCalcHead -";
neuper@37906	378
neuper@37906	379	val p = ([],Pbl);
walther@59997	380	val elems = ["fixedValues [r=Arbfix]", "maximum A", "valuesFor [a,b]",
walther@60242	381	"relations [A=a*b, (a/2) \<up> 2 + (b/2) \<up> 2 = r \<up> 2]",
walther@60242	382	"relations [A=a*b, (a/2) \<up> 2 + (b/2) \<up> 2 = r \<up> 2]",
wneuper@59582	383	"relations [A=ab, a/2=rsin alpha, b/2=r*cos (alpha::real)]",
walther@60242	384	(* \<up> these are the elements for the root-problem (in variants)*)
neuper@37906	385	(vvv these are elements required for subproblems)
walther@59997	386	"boundVariable a", "boundVariable b", "boundVariable alpha",
neuper@37906	387	"interval {x::real. 0 <= x & x <= 2*r}",
neuper@37906	388	"interval {x::real. 0 <= x & x <= 2*r}",
neuper@37906	389	"interval {x::real. 0 <= x & x <= pi}",
neuper@37906	390	"errorBound (eps=(0::real))"]
neuper@37906	391	(specifying is not interesting for this example)
Walther@60458	392	val spec = ("Diff_App", ["maximum_of", "function"],
Walther@60458	393	["Diff_App", "max_by_calculus"]);
neuper@37906	394	(the empty model with descriptions for user-guidance by Model_Problem)
neuper@37906	395	val empty_model = [Given ["fixedValues []"],
neuper@37906	396	Find ["maximum", "valuesFor"],
neuper@37906	397	Relate ["relations []"]];
neuper@37906	398
neuper@37906	399
neuper@37906	400	(!!!!!!!!!!!!!!!!! DON'T USE me FOR FINDING nxt !!!!!!!!!!!!!!!!!!)
Walther@60571	401	val (p,_,f,nxt,_,pt) = Test_Code.init_calc @{context} [(elems, spec)];
neuper@37906	402	(val nxt = ("Model_Problem", ...)
walther@59942	403	val pbl = get_obj g_pbl pt (fst p); (writeln o (I_Model.to_string ctxt)) pbl;
neuper@37906	404
neuper@37906	405	val (p,_,f,nxt,_,pt) = me nxt p c pt;
neuper@37906	406	(nxt = Add_Given "fixedValues [r = Arbfix]")
walther@59942	407	val pbl = get_obj g_pbl pt (fst p); (writeln o (I_Model.to_string ctxt)) pbl;
neuper@37906	408	(*[
neuper@37906	409	(0 ,[] ,false ,#Given ,Inc fixedValues [] ,(??.empty, [])),
neuper@37906	410	(0 ,[] ,false ,#Find ,Inc maximum ,(??.empty, [])),
neuper@37906	411	(0 ,[] ,false ,#Find ,Inc valuesFor ,(??.empty, [])),
neuper@37906	412	(0 ,[] ,false ,#Relate ,Inc relations [] ,(??.empty, []))]*)
neuper@37906	413
neuper@37906	414	(the empty CalcHead is checked w.r.t the model and re-established as such)
walther@59976	415	val (b,pt,ocalhd) = input_icalhd pt (p,"", empty_model, Pbl, References.empty);
walther@59942	416	val pbl = get_obj g_pbl pt (fst p); (writeln o (I_Model.to_string ctxt)) pbl;
walther@59879	417	if ocalhd2str ocalhd = "(Pbl, ??.empty, [\n(0 ,[] ,false ,#Given ,Inc fixedValues [] ,(??.empty, [])),\n(0 ,[] ,false ,#Find ,Inc maximum ,(??.empty, [])),\n(0 ,[] ,false ,#Find ,Inc valuesFor ,(??.empty, [])),\n(0 ,[] ,false ,#Relate ,Inc relations [] ,(??.empty, []))], [], \n(\"ThyC.id_empty\", [\"e_pblID\"], [\"e_metID\"]) )" then () else error "informtest.sml: diff.behav. max 1";
neuper@37906	418
neuper@37906	419	(there is one input to the model (could be more))
neuper@37906	420	val (b,pt,ocalhd) =
neuper@37906	421	input_icalhd pt (p,"", [Given ["fixedValues [r=Arbfix]"],
neuper@37906	422	Find ["maximum", "valuesFor"],
walther@59976	423	Relate ["relations"]], Pbl, References.empty);
walther@59942	424	val pbl = get_obj g_pbl pt (fst p); (writeln o (I_Model.to_string ctxt)) pbl;
walther@59879	425	if ocalhd2str ocalhd = "(Pbl, ??.empty, [\n(1 ,[1,2,3] ,true ,#Given ,Cor fixedValues [r = Arbfix] ,(fix_, [[r = Arbfix]])),\n(0 ,[] ,false ,#Find ,Inc maximum ,(??.empty, [])),\n(0 ,[] ,false ,#Find ,Inc valuesFor ,(??.empty, [])),\n(0 ,[] ,false ,#Relate ,Inc relations [] ,(??.empty, []))], [], \n(\"ThyC.id_empty\", [\"e_pblID\"], [\"e_metID\"]) )" then ()
neuper@38031	426	else error "informtest.sml: diff.behav. max 2";
neuper@37906	427
neuper@37906	428	(*this input is complete in variant 3, but the ME doesn't recognize FIXXXXME
neuper@37906	429	val (b,pt''''',ocalhd) =
neuper@37906	430	input_icalhd pt (p,"", [Given ["fixedValues [r=Arbfix]"],
neuper@37906	431	Find ["maximum A", "valuesFor [a,b]"],
neuper@37906	432	Relate ["relations [A=ab, a/2=rsin alpha, \
walther@59976	433	\b/2=r*cos alpha]"]], Pbl, References.empty);
walther@59942	434	val pbl = get_obj g_pbl pt''''' (fst p); (writeln o (I_Model.to_string ctxt)) pbl;
walther@60242	435	if ocalhd2str ocalhd = ------------ \<up> \<up> \<up> ^ missing !!!*)
neuper@37906	436
neuper@37906	437	(this input is complete in variant 1 (variant 3 does not work yet))
neuper@37906	438	val (b,pt''''',ocalhd) =
neuper@37906	439	input_icalhd pt (p,"", [Given ["fixedValues [r=Arbfix]"],
neuper@37906	440	Find ["maximum A", "valuesFor [a,b]"],
neuper@37906	441	Relate ["relations [A=a*b, \
walther@60242	442	\(a/2) \<up> 2 + (b/2) \<up> 2 = r \<up> 2]"]],
walther@59976	443	Pbl, References.empty);
walther@59942	444	val pbl = get_obj g_pbl pt''''' (fst p); (writeln o (I_Model.to_string ctxt)) pbl;
neuper@37906	445
neuper@37906	446	modifycalcheadOK2xml 111 (bool2str b) ocalhd;
neuper@37906	447	*)
wneuper@59252	448	DEconstrCalcTree 1;
neuper@37906	449
neuper@37906	450	"--------- syntax error ------------------------------------------";
neuper@37906	451	"--------- syntax error ------------------------------------------";
neuper@37906	452	"--------- syntax error ------------------------------------------";
Walther@60549	453	States.reset ();
Walther@60571	454	CalcTree @{context} [(["equality (x+1=(2::real))", "solveFor x", "solutions L"],
walther@59997	455	("Test", ["sqroot-test", "univariate", "equation", "test"],
walther@59997	456	["Test", "squ-equ-test-subpbl1"]))];
neuper@37906	457	Iterator 1; moveActiveRoot 1;
wneuper@59248	458	autoCalculate 1 CompleteCalcHead;
Walther@60549	459	autoCalculate 1 (Steps 1); refFormula 1 (States.get_pos 1 1);(x + 1 = 2)
Walther@60549	460	autoCalculate 1 (Steps 1); refFormula 1 (States.get_pos 1 1);(x + 1 + - 1 2 = 0*);
neuper@37906	461
neuper@37906	462	appendFormula 1 " x - "; (<ERROR> syntax error in ' x - ' </ERROR>)
Walther@60549	463	val ((pt,_),_) = States.get_calc 1;
Walther@60608	464	val str = pr_ctree ctxt pr_short pt;
neuper@37906	465	writeln str;
neuper@37906	466	if str = ". ----- pblobj -----\n1. x + 1 = 2\n" then ()
neuper@38031	467	else error "inform.sml: diff.behav.appendFormula: syntax error";
wneuper@59252	468	DEconstrCalcTree 1;
neuper@37906	469
Walther@60571	470	(*POSTPONE CORRECTION AT END OF TRANSITION TO Isabelle/PIDE/Isac (~ Cas_Cmd)
neuper@37906	471	"--------- CAS-command on ([],Pbl) -------------------------------";
neuper@37906	472	"--------- CAS-command on ([],Pbl) -------------------------------";
neuper@37906	473	"--------- CAS-command on ([],Pbl) -------------------------------";
neuper@37906	474	val (p,_,f,nxt,_,pt) =
Walther@60571	475	Test_Code.init_calc @{context} [([], References.empty)];
walther@60340	476	val ifo = "solve(x+1=2,x)";
walther@60340	477	val (_,(_,c,(pt,p))) = Step_Solve.by_term (pt,p) "solve(x+1=2,x)";
Walther@60571	478	( *
walther@60242	479	This trick \<up> \<up> \<up> micked input of \<up> \<up> \<up> \<up> \<up> ^^ in the front-end.
walther@59921	480	The trick worked in changeset fbaff8cf0179, it does not work in 59c5dd27d589 anymore
walther@59921	481	(TODO hg bisect ?) and raises the ERROR Undefined fact: "xfoldr_Nil".
walther@59921	482
walther@59921	483	Compare tests "CAS-command" in test/../inssort.sml etc.
walther@59921	484	---------------------------------------------------------------------------------------------
walther@59983	485	Test_Tool.show_pt pt;
walther@59997	486	val nxt = (Apply_Method ["Test", "squ-equ-test-subpbl1"]);
neuper@37906	487	val (p,_,f,nxt,_,pt) = me nxt p [] pt;
neuper@37906	488	if p = ([1], Frm) andalso f2str f = "x + 1 = 2" then ()
neuper@38031	489	else error "inform.sml: diff.behav. CAScmd ([],Pbl)";
wneuper@59252	490	DEconstrCalcTree 1;
walther@59921	491	-----------------------------------------------------------------------------------------------*)
neuper@37906	492
Walther@60571	493	(*POSTPONE CORRECTION AT END OF TRANSITION TO Isabelle/PIDE/Isac (~ Cas_Cmd)
neuper@37906	494	"--------- CAS-command on ([],Pbl) FE-interface ------------------";
neuper@37906	495	"--------- CAS-command on ([],Pbl) FE-interface ------------------";
neuper@37906	496	"--------- CAS-command on ([],Pbl) FE-interface ------------------";
Walther@60549	497	States.reset ();
Walther@60571	498	CalcTree @{context} [([], References.empty)];
neuper@37906	499	Iterator 1;
neuper@37906	500	moveActiveRoot 1;
walther@60340	501	replaceFormula 1 "solve(x+1=2,x)";
wneuper@59248	502	autoCalculate 1 CompleteCalc;
Walther@60549	503	val ((pt,p),_) = States.get_calc 1;
walther@59983	504	Test_Tool.show_pt pt;
neuper@37906	505	if p = ([], Res) then ()
neuper@38031	506	else error "inform.sml: diff.behav. CAScmd ([],Pbl) FE-interface";
wneuper@59252	507	DEconstrCalcTree 1;
Walther@60571	508	-----------------------------------------------------------------------------------------------*)
neuper@37906	509
wneuper@59562	510	"--------- inform [rational,simplification] ----------------------";
wneuper@59562	511	"--------- inform [rational,simplification] ----------------------";
wneuper@59562	512	"--------- inform [rational,simplification] ----------------------";
Walther@60549	513	States.reset ();
Walther@60571	514	CalcTree @{context} [(["Term (a * x / (b * x) + c * x / (d * x) + e / f)", "normalform N"],
neuper@52105	515	("Rational", ["rational", "simplification"], ["simplification", "of_rationals"]))];
neuper@37906	516	Iterator 1; moveActiveRoot 1;
wneuper@59248	517	autoCalculate 1 CompleteCalcHead;
neuper@52105	518
walther@60324	519	"--- (- 1) give a preview on the calculation without any input";
neuper@52105	520	(*
wneuper@59248	521	autoCalculate 1 CompleteCalc;
Walther@60549	522	val ((pt, p), _) = States.get_calc 1;
walther@59983	523	Test_Tool.show_pt pt;
neuper@52105	524	[
neuper@52105	525	(([], Frm), Simplify (a * x / (b * x) + c * x / (d * x) + e / f)),
neuper@52105	526	(([1], Frm), a * x / (b * x) + c * x / (d * x) + e / f),
neuper@52105	527	(([1], Res), a / b + c / d + e / f), <--- (1) input arbitrary
neuper@52105	528	(([2], Res), (b * d * e + b * c * f + a * d * f) / (b * d * f)),
neuper@52105	529	(([3], Res), (a * (d * f) + b * (c * f) + b * (d * e)) / (b * (d * f))),
neuper@52105	530	(([4], Res), (a * d * f + b * c * f + b * d * e) / (b * d * f)), <--- (2) input next
neuper@52105	531	(([], Res), (a * d * f + b * c * f + b * d * e) / (b * d * f))] <--- (3) is also final result
neuper@52105	532	EXAMPLE NOT OPTIMAL
neuper@52105	533	*)
neuper@52105	534	"--- (0) user input as the first step does not work, thus impdo at least 1 step";
walther@59747	535	autoCalculate 1 (Steps 1);
walther@59747	536	autoCalculate 1 (Steps 1);
Walther@60549	537	val ((pt, p), _) = States.get_calc 1;
walther@59983	538	(*Test_Tool.show_pt pt;
neuper@52105	539	[
neuper@52105	540	(([], Frm), Simplify (a * x / (b * x) + c * x / (d * x) + e / f)),
neuper@52105	541	(([1], Frm), a * x / (b * x) + c * x / (d * x) + e / f),
neuper@52105	542	(([1], Res), a / b + c / d + e / f)]
neuper@52105	543	*)
neuper@52105	544	"--- (1) input an arbitrary next formula";
wneuper@59123	545	appendFormula 1 "((a * d) + (c * b)) / (b * d) + e / f" (\|> Future.join);
Walther@60549	546	val ((pt, p), _) = States.get_calc 1;
walther@59983	547	(*Test_Tool.show_pt pt;
neuper@52105	548	[
neuper@52105	549	(([], Frm), Simplify (a * x / (b * x) + c * x / (d * x) + e / f)),
neuper@52105	550	(([1], Frm), a * x / (b * x) + c * x / (d * x) + e / f),
neuper@52105	551	(([1], Res), a / b + c / d + e / f),
neuper@52105	552	(([2,1], Frm), a / b + c / d + e / f),
neuper@52105	553	(([2,1], Res), (b * d * e + b * c * f + a * d * f) / (b * d * f)),
neuper@52105	554	(([2,2], Res), (a * d + c * b) / (b * d) + e / f),
neuper@52105	555	(([2], Res), (a * d + c * b) / (b * d) + e / f)]
neuper@52105	556	*)
Walther@60549	557	val ((pt,p),_) = States.get_calc 1;
neuper@52105	558	if p = ([2], Res) andalso (length o children o (get_nd pt)) (fst p) = 2 then ()
neuper@38031	559	else error ("inform.sml: [rational,simplification] 1");
neuper@37906	560
neuper@52105	561	"--- (2) input the next formula that would be presented by mat-engine";
neuper@52105	562	(* generate a preview:
walther@59747	563	autoCalculate 1 (Steps 1);
Walther@60549	564	val ((pt, p), _) = States.get_calc 1;
walther@59983	565	Test_Tool.show_pt pt;
neuper@52105	566	[
neuper@52105	567	(([], Frm), Simplify (a * x / (b * x) + c * x / (d * x) + e / f)),
neuper@52105	568	(([1], Frm), a * x / (b * x) + c * x / (d * x) + e / f),
neuper@52105	569	(([1], Res), a / b + c / d + e / f),
neuper@52105	570	(([2,1], Frm), a / b + c / d + e / f),
neuper@52105	571	(([2,1], Res), (b * d * e + b * c * f + a * d * f) / (b * d * f)),
neuper@52105	572	(([2,2], Res), (a * d + c * b) / (b * d) + e / f),
neuper@52105	573	(([2], Res), (a * d + c * b) / (b * d) + e / f),
neuper@52105	574	(([3], Res), (b * d * e + b * c * f + a * d * f) / (b * d * f))] <--- input this
neuper@52105	575	*)
wneuper@59123	576	appendFormula 1 "(b * d * e + b * c * f + a * d * f) / (b * d * f)" (\|> Future.join);
Walther@60549	577	val ((pt, p), _) = States.get_calc 1;
walther@59983	578	(*Test_Tool.show_pt pt;
neuper@52105	579	[
neuper@52105	580	(([], Frm), Simplify (a * x / (b * x) + c * x / (d * x) + e / f)),
neuper@52105	581	(([1], Frm), a * x / (b * x) + c * x / (d * x) + e / f),
neuper@52105	582	(([1], Res), a / b + c / d + e / f),
neuper@52105	583	(([2,1], Frm), a / b + c / d + e / f),
neuper@52105	584	(([2,1], Res), (b * d * e + b * c * f + a * d * f) / (b * d * f)),
neuper@52105	585	(([2,2], Res), (a * d + c * b) / (b * d) + e / f),
neuper@52105	586	(([2], Res), (a * d + c * b) / (b * d) + e / f),
neuper@52105	587	(([3], Res), (b * d * e + b * c * f + a * d * f) / (b * d * f))]
neuper@52105	588	*)
neuper@52105	589	if p = ([3], Res) andalso (length o children o (get_nd pt)) (fst p) = 0 then ()
neuper@38031	590	else error ("inform.sml: [rational,simplification] 2");
neuper@37906	591
neuper@52105	592	"--- (3) input the exact final result";
wneuper@59123	593	appendFormula 1 "(b * d * e + b * c * f + a * d * f) / (b * d * f)" (\|> Future.join);
Walther@60549	594	val ((pt, p), _) = States.get_calc 1;
walther@59983	595	(*Test_Tool.show_pt pt;
neuper@52105	596	[
neuper@52105	597	(([], Frm), Simplify (a * x / (b * x) + c * x / (d * x) + e / f)),
neuper@52105	598	(([1], Frm), a * x / (b * x) + c * x / (d * x) + e / f),
neuper@52105	599	(([1], Res), a / b + c / d + e / f),
neuper@52105	600	(([2,1], Frm), a / b + c / d + e / f),
neuper@52105	601	(([2,1], Res), (b * d * e + b * c * f + a * d * f) / (b * d * f)),
neuper@52105	602	(([2,2], Res), (a * d + c * b) / (b * d) + e / f),
neuper@52105	603	(([2], Res), (a * d + c * b) / (b * d) + e / f),
neuper@52105	604	(([3], Res), (b * d * e + b * c * f + a * d * f) / (b * d * f)),
neuper@52105	605	(([4,1], Frm), (b * d * e + b * c * f + a * d * f) / (b * d * f)),
neuper@52105	606	(([4,1], Res), (a * (d * f) + b * (c * f) + b * (d * e)) / (b * (d * f))),
neuper@52105	607	(([4,2], Res), (b * d * e + b * c * f + a * d * f) / (b * d * f)),
neuper@52105	608	(([4], Res), (b * d * e + b * c * f + a * d * f) / (b * d * f))]
neuper@52105	609	*)
neuper@52105	610	if p = ([4], Res) andalso (length o children o (get_nd pt)) (fst p) = 2 then ()
neuper@38031	611	else error ("inform.sml: [rational,simplification] 3");
neuper@52105	612
neuper@52105	613	"--- (4) finish the calculation + check the postcondition (in the future)";
wneuper@59248	614	autoCalculate 1 CompleteCalc;
Walther@60549	615	val ((pt, p), _) = States.get_calc 1;
neuper@52105	616	val (t, asm) = get_obj g_result pt [];
walther@59868	617	if UnparseC.term t = "(a * d * f + b * c * f + b * d * e) / (b * d * f)" andalso
walther@59921	618	UnparseC.terms asm =("[\"b d * f \<noteq> 0\",\"d \<noteq> 0\",\"b \<noteq> 0\",\"a * x / (b * x) + c * x / (d * x) + e / f is_ratpolyexp\"]"*)
walther@59921	619	"[]" (..found broken in child of 33913fe24685, error covered by CAS-command )
neuper@52105	620	then () else error "inform [rational,simplification] changed at end";
walther@59983	621	(*Test_Tool.show_pt pt;
neuper@52105	622	[
neuper@52105	623	(([], Frm), Simplify (a * x / (b * x) + c * x / (d * x) + e / f)),
neuper@52105	624	(([1], Frm), a * x / (b * x) + c * x / (d * x) + e / f),
neuper@52105	625	(([1], Res), a / b + c / d + e / f),
neuper@52105	626	(([2,1], Frm), a / b + c / d + e / f),
neuper@52105	627	(([2,1], Res), (b * d * e + b * c * f + a * d * f) / (b * d * f)),
neuper@52105	628	(([2,2], Res), (a * d + c * b) / (b * d) + e / f),
neuper@52105	629	(([2], Res), (a * d + c * b) / (b * d) + e / f),
neuper@52105	630	(([3], Res), (b * d * e + b * c * f + a * d * f) / (b * d * f)),
neuper@52105	631	(([4,1], Frm), (b * d * e + b * c * f + a * d * f) / (b * d * f)),
neuper@52105	632	(([4,1], Res), (a * (d * f) + b * (c * f) + b * (d * e)) / (b * (d * f))),
neuper@52105	633	(([4,2], Res), (b * d * e + b * c * f + a * d * f) / (b * d * f)),
neuper@52105	634	(([4], Res), (b * d * e + b * c * f + a * d * f) / (b * d * f)),
neuper@52105	635	(([5], Res), (a * (d * f) + b * (c * f) + b * (d * e)) / (b * (d * f))),
neuper@52105	636	(([6], Res), (a * d * f + b * c * f + b * d * e) / (b * d * f)),
neuper@52105	637	(([], Res), (a * d * f + b * c * f + b * d * e) / (b * d * f))]
neuper@52105	638	*)
wneuper@59252	639	DEconstrCalcTree 1;
neuper@37906	640
Walther@60571	641	(*POSTPONE CORRECTION AT END OF TRANSITION TO Isabelle/PIDE/Isac (~ Cas_Cmd)
neuper@37906	642	"--------- Take as 1st tac, start with <NEW> (CAS input) ---------";
neuper@37906	643	"--------- Take as 1st tac, start with <NEW> (CAS input) ---------";
neuper@37906	644	"--------- Take as 1st tac, start with <NEW> (CAS input) ---------";
Walther@60565	645	val t = TermC.parse_test @{context} "Diff (x \<up> 2 + x + 1, x)";
walther@60336	646	case t of Const (\<^const_name>\<open>Diff\<close>, _) $ _ => ()
neuper@37906	647	\| _ => raise
neuper@37906	648	error "diff.sml behav.changed for CAS Diff (..., x)";
Walther@60650	649	TermC.atom_trace_detail @{context} t;
neuper@37906	650	"-----------------------------------------------------------------";
Walther@60549	651	(1>)States.reset ();
Walther@60571	652	(2>)CalcTree @{context} [([], References.empty)];
neuper@37906	653	(3>)Iterator 1;moveActiveRoot 1;
neuper@37906	654	"----- here the Headline has been finished";
neuper@37906	655	(4>)moveActiveFormula 1 ([],Pbl);
walther@60242	656	(5>)replaceFormula 1 "Diff (x \<up> 2 + x + 1, x)";
Walther@60549	657	val ((pt,_),_) = States.get_calc 1;
walther@59921	658	val PblObj {probl, meth, spec, fmz, loc, ...} = get_obj I pt [];
neuper@37926	659	val (SOME istate, NONE) = loc;
wneuper@59348	660	(default_print_depth 5;)
neuper@37906	661	writeln"-----------------------------------------------------------";
neuper@37906	662	spec;
walther@59942	663	writeln (I_Model.to_string ctxt probl);
walther@59942	664	writeln (I_Model.to_string ctxt meth);
Walther@60646	665	writeln (Istate.string_of ctxt (fst istate));
neuper@37906	666
neuper@37906	667	refFormula 1 ([],Pbl) (--> correct CalcHead);
neuper@37906	668	(081016 NOT necessary (but leave it in Java):)
wneuper@59248	669	(6>)(completeCalcHead)autoCalculate 1 CompleteCalcHead;
neuper@37906	670	"----- here the CalcHead has been completed --- ONCE MORE ?????";
neuper@37906	671
neuper@37906	672	(*difference II*)
Walther@60549	673	val ((pt,p),_) = States.get_calc 1;
neuper@37906	674	(val p = ([], Pbl))
walther@59921	675	val PblObj {probl, meth, spec, fmz, loc, ...} = get_obj I pt [];
neuper@37926	676	val (SOME istate, NONE) = loc;
Walther@60646	677	(default_print_depth 5;) writeln (Istate.string_of ctxt (fst istate)); (default_print_depth 3;)
wneuper@59583	678	(*Pstate ([],
neuper@37926	679	[], NONE,
neuper@37906	680	??.empty, Sundef, false)*)
wneuper@59348	681	(default_print_depth 5;) spec; (default_print_depth 3;)
wneuper@59592	682	(*("Isac_Knowledge",
neuper@37906	683	["derivative_of", "function"],
neuper@37906	684	["diff", "differentiate_on_R"]) : spec*)
walther@59942	685	writeln (I_Model.to_string ctxt probl);
neuper@37906	686	(*[
walther@60242	687	(1 ,[1] ,true ,#Given ,Cor functionTerm (x \<up> 2 + x + 1) ,(f_, [x \<up> 2 + x + 1])),
neuper@37906	688	(2 ,[1] ,true ,#Given ,Cor differentiateFor x ,(v_, [x])),
akargl@42176	689	(3 ,[1] ,true ,#Find ,Cor derivative f_'_f ,(f_'_f, [f_'_f]))]*)
walther@59942	690	writeln (I_Model.to_string ctxt meth);
neuper@37906	691	(*[
walther@60242	692	(1 ,[1] ,true ,#Given ,Cor functionTerm (x \<up> 2 + x + 1) ,(f_, [x \<up> 2 + x + 1])),
neuper@37906	693	(2 ,[1] ,true ,#Given ,Cor differentiateFor x ,(v_, [x])),
akargl@42176	694	(3 ,[1] ,true ,#Find ,Cor derivative f_'_f ,(f_'_f, [f_'_f]))]*)
neuper@37906	695	writeln"-----------------------------------------------------------";
neuper@37906	696	(7>)fetchProposedTactic 1 (--> Apply_Method);
neuper@37906	697	(WN081028 fixed <ERROR> helpless </ERROR> by inform returning ...(.,Met))
wneuper@59248	698	autoCalculate 1 CompleteCalc;
Walther@60549	699	val ((pt,p),_) = States.get_calc 1;
walther@59983	700	val Form res = (#1 o ME_Misc.pt_extract) (pt, ([],Res));
walther@59983	701	Test_Tool.show_pt pt;
walther@60242	702
walther@59868	703	if p = ([], Res) andalso UnparseC.term res = "1 + 2 * x" then ()
walther@60242	704	else error "diff.sml behav.changed for Diff (x \<up> 2 + x + 1, x)";
wneuper@59252	705	DEconstrCalcTree 1;
Walther@60571	706	-----------------------------------------------------------------------------------------------*)
neuper@37906	707
neuper@37906	708	"--------- Take as 1st tac, start from exp -----------------------";
neuper@37906	709	"--------- Take as 1st tac, start from exp -----------------------";
neuper@37906	710	"--------- Take as 1st tac, start from exp -----------------------";
neuper@37906	711	(*the following input is copied from BridgeLog Java <==> SML,
neuper@37906	712	omitting unnecessary inputs*)
Walther@60549	713	(1>)States.reset ();
Walther@60571	714	(2>)CalcTree @{context} [(["functionTerm (x \<up> 2 + x + 1)", "differentiateFor x", "derivative f_'_f"],("Isac_Knowledge",["derivative_of", "function"],["diff", "differentiate_on_R"]))];
neuper@37906	715	(3>)Iterator 1; moveActiveRoot 1;
neuper@37906	716
wneuper@59248	717	(6>)(completeCalcHead)autoCalculate 1 CompleteCalcHead;
neuper@37906	718	(*difference II*)
Walther@60549	719	val ((pt,_),_) = States.get_calc 1;
walther@59921	720	val PblObj {probl, meth, spec, fmz, loc, ...} = get_obj I pt [];
neuper@37926	721	val (SOME istate, NONE) = loc;
Walther@60646	722	(default_print_depth 5;) writeln (Istate.string_of ctxt (fst istate)); (default_print_depth 3;)
wneuper@59583	723	(*Pstate ([],
neuper@37926	724	[], NONE,
neuper@37906	725	??.empty, Sundef, false)*)
wneuper@59348	726	(default_print_depth 5;) spec; (default_print_depth 3;)
wneuper@59592	727	(*("Isac_Knowledge",
neuper@37906	728	["derivative_of", "function"],
neuper@37906	729	["diff", "differentiate_on_R"]) : spec*)
walther@59942	730	writeln (I_Model.to_string ctxt probl);
neuper@37906	731	(*[
walther@60242	732	(1 ,[1] ,true ,#Given ,Cor functionTerm (x \<up> 2 + x + 1) ,(f_, [x \<up> 2 + x + 1])),
neuper@37906	733	(2 ,[1] ,true ,#Given ,Cor differentiateFor x ,(v_, [x])),
akargl@42176	734	(3 ,[1] ,true ,#Find ,Cor derivative f_'_f ,(f_'_f, [f_'_f]))]*)
walther@59942	735	writeln (I_Model.to_string ctxt meth);
neuper@37906	736	(*[
walther@60242	737	(1 ,[1] ,true ,#Given ,Cor functionTerm (x \<up> 2 + x + 1) ,(f_, [x \<up> 2 + x + 1])),
neuper@37906	738	(2 ,[1] ,true ,#Given ,Cor differentiateFor x ,(v_, [x])),
akargl@42176	739	(3 ,[1] ,true ,#Find ,Cor derivative f_'_f ,(f_'_f, [f_'_f]))]*)
neuper@37906	740	writeln"-----------------------------------------------------------";
neuper@37906	741	(7>)fetchProposedTactic 1 (--> Apply_Method);
walther@59747	742	autoCalculate 1 (Steps 1);
Walther@60549	743	val ((pt,p),_) = States.get_calc 1;
Walther@60577	744	val Form res = (#1 o (ME_Misc.pt_extract ctxt)) (pt, p);
walther@60242	745	if UnparseC.term res = "d_d x (x \<up> 2 + x + 1)" then ()
walther@60242	746	else error "diff.sml Diff (x \<up> 2 + x + 1, x) from exp";
wneuper@59252	747	DEconstrCalcTree 1;
neuper@37906	748
Walther@60571	749	(*POSTPONE CORRECTION AT END OF TRANSITION TO Isabelle/PIDE/Isac (~ Cas_Cmd)
walther@59845	750	"--------- implicit_take, start with <NEW> (CAS input) ---------------";
walther@59845	751	"--------- implicit_take, start with <NEW> (CAS input) ---------------";
walther@59845	752	"--------- implicit_take, start with <NEW> (CAS input) ---------------";
Walther@60549	753	States.reset ();
Walther@60571	754	CalcTree @{context} [([], References.empty)];
neuper@37906	755	(*[[from sml: > @@@@@begin@@@@@
neuper@37906	756	[[from sml: 1
neuper@37906	757	[[from sml: <CALCTREE>
neuper@37906	758	[[from sml: <CALCID> 1 </CALCID>
neuper@37906	759	[[from sml: </CALCTREE>
neuper@37906	760	[[from sml: @@@@@end@@@@@*)
neuper@37906	761	Iterator 1;
neuper@37906	762	(*[[from sml: > @@@@@begin@@@@@
neuper@37906	763	[[from sml: 1
neuper@37906	764	[[from sml: <ADDUSER>
neuper@37906	765	[[from sml: <CALCID> 1 </CALCID>
neuper@37906	766	[[from sml: <USERID> 1 </USERID>
neuper@37906	767	[[from sml: </ADDUSER>
neuper@37906	768	[[from sml: @@@@@end@@@@@*)
neuper@37906	769	moveActiveRoot 1;
neuper@37906	770	(*[[from sml: > @@@@@begin@@@@@
neuper@37906	771	[[from sml: 1
neuper@37906	772	[[from sml: <CALCITERATOR>
neuper@37906	773	[[from sml: <CALCID> 1 </CALCID>
neuper@37906	774	[[from sml: <POSITION>
neuper@37906	775	[[from sml: <INTLIST>
neuper@37906	776	[[from sml: </INTLIST>
neuper@37906	777	[[from sml: <POS> Pbl </POS>
neuper@37906	778	[[from sml: </POSITION>
neuper@37906	779	[[from sml: </CALCITERATOR>
neuper@37906	780	[[from sml: @@@@@end@@@@@*)
neuper@37906	781	getFormulaeFromTo 1 ([],Pbl) ([],Pbl) 0 false;
neuper@37906	782	(*[[from sml: > @@@@@begin@@@@@ STILL CORRECT
neuper@37906	783	[[from sml: 1
neuper@37906	784	[[from sml: <GETELEMENTSFROMTO>
neuper@37906	785	[[from sml: <CALCID> 1 </CALCID>
neuper@37906	786	[[from sml: <FORMHEADS>
neuper@37906	787	[[from sml: <CALCFORMULA>
neuper@37906	788	[[from sml: <POSITION>
neuper@37906	789	[[from sml: <INTLIST>
neuper@37906	790	[[from sml: </INTLIST>
neuper@37906	791	[[from sml: <POS> Pbl </POS>
neuper@37906	792	[[from sml: </POSITION>
neuper@37906	793	[[from sml: <FORMULA>
neuper@37906	794	[[from sml: <MATHML>
neuper@37906	795	[[from sml: <ISA> ________________________________________________ </ISA>
neuper@37906	796	[[from sml: </MATHML>
neuper@37906	797	[[from sml:
neuper@37906	798	[[from sml: </FORMULA>
neuper@37906	799	[[from sml: </CALCFORMULA>
neuper@37906	800	[[from sml: </FORMHEADS>
neuper@37906	801	[[from sml: </GETELEMENTSFROMTO>
neuper@37906	802	[[from sml: @@@@@end@@@@@*)
neuper@37906	803	refFormula 1 ([],Pbl);
neuper@37906	804	(*[[from sml: > @@@@@begin@@@@@ STILL CORRECT
neuper@37906	805	[[from sml: 1
neuper@37906	806	[[from sml: <REFFORMULA>
neuper@37906	807	[[from sml: <CALCID> 1 </CALCID>
neuper@37906	808	[[from sml: <CALCHEAD status = "incorrect">
neuper@37906	809	[[from sml: <POSITION>
neuper@37906	810	[[from sml: <INTLIST>
neuper@37906	811	[[from sml: </INTLIST>
neuper@37906	812	[[from sml: <POS> Pbl </POS>
neuper@37906	813	[[from sml: </POSITION>
neuper@37906	814	[[from sml: <HEAD>
neuper@37906	815	[[from sml: <MATHML>
walther@59879	816	[[from sml: <ISA> Problem (ThyC.id_empty, [e_pblID]) </ISA>
neuper@37906	817	[[from sml: </MATHML>
neuper@37906	818	[[from sml: </HEAD>
neuper@37906	819	[[from sml: <MODEL>
neuper@37906	820	[[from sml: <GIVEN> </GIVEN>
neuper@37906	821	[[from sml: <WHERE> </WHERE>
neuper@37906	822	[[from sml: <FIND> </FIND>
neuper@37906	823	[[from sml: <RELATE> </RELATE>
neuper@37906	824	[[from sml: </MODEL>
neuper@37906	825	[[from sml: <BELONGSTO> Pbl </BELONGSTO>
neuper@37906	826	[[from sml: <SPECIFICATION>
walther@59879	827	[[from sml: <THEORYID> ThyC.id_empty </THEORYID>
neuper@37906	828	[[from sml: <PROBLEMID>
neuper@37906	829	[[from sml: <STRINGLIST>
walther@59903	830	[[from sml: <STRING> Problem.id_empty </STRING>
neuper@37906	831	[[from sml: </STRINGLIST>
neuper@37906	832	[[from sml: </PROBLEMID>
neuper@37906	833	[[from sml: <METHODID>
neuper@37906	834	[[from sml: <STRINGLIST>
neuper@37906	835	[[from sml: <STRING> e_metID </STRING>
neuper@37906	836	[[from sml: </STRINGLIST>
neuper@37906	837	[[from sml: </METHODID>
neuper@37906	838	[[from sml: </SPECIFICATION>
neuper@37906	839	[[from sml: </CALCHEAD>
neuper@37906	840	[[from sml: </REFFORMULA>
neuper@37906	841	[[from sml: @@@@@end@@@@@*)
neuper@37906	842	moveActiveFormula 1 ([],Pbl);
neuper@37906	843	(*[[from sml: > @@@@@begin@@@@@
neuper@37906	844	[[from sml: 1
neuper@37906	845	[[from sml: <CALCITERATOR>
neuper@37906	846	[[from sml: <CALCID> 1 </CALCID>
neuper@37906	847	[[from sml: <POSITION>
neuper@37906	848	[[from sml: <INTLIST>
neuper@37906	849	[[from sml: </INTLIST>
neuper@37906	850	[[from sml: <POS> Pbl </POS>
neuper@37906	851	[[from sml: </POSITION>
neuper@37906	852	[[from sml: </CALCITERATOR>
neuper@37906	853	[[from sml: @@@@@end@@@@@*)
neuper@37906	854	replaceFormula 1 "Simplify (1+2)";
neuper@37906	855	(*[[from sml: > @@@@@begin@@@@@
neuper@37906	856	[[from sml: 1
neuper@37906	857	[[from sml: <REPLACEFORMULA>
neuper@37906	858	[[from sml: <CALCID> 1 </CALCID>
neuper@37906	859	[[from sml: <CALCCHANGED>
neuper@37906	860	[[from sml: <UNCHANGED>
neuper@37906	861	[[from sml: <INTLIST>
neuper@37906	862	[[from sml: </INTLIST>
neuper@37906	863	[[from sml: <POS> Pbl </POS>
neuper@37906	864	[[from sml: </UNCHANGED>
neuper@37906	865	[[from sml: <DELETED>
neuper@37906	866	[[from sml: <INTLIST>
neuper@37906	867	[[from sml: </INTLIST>
neuper@37906	868	[[from sml: <POS> Pbl </POS>
neuper@37906	869	[[from sml: </DELETED>
neuper@37906	870	[[from sml: <GENERATED>
neuper@37906	871	[[from sml: <INTLIST>
neuper@37906	872	[[from sml: </INTLIST>
neuper@37906	873	[[from sml: <POS> Met </POS> DIFFERENCE: Pbl
neuper@37906	874	[[from sml: </GENERATED>
neuper@37906	875	[[from sml: </CALCCHANGED>
neuper@37906	876	[[from sml: </REPLACEFORMULA>
neuper@37906	877	[[from sml: @@@@@end@@@@@*)
neuper@37906	878	getFormulaeFromTo 1 ([],Pbl) ([],Pbl) 0 false(* DIFFERENCE: Pbl*);
neuper@37906	879	(*@@@@@begin@@@@@
neuper@37906	880	1
neuper@37906	881	<GETELEMENTSFROMTO>
neuper@37906	882	<CALCID> 1 </CALCID>
neuper@37906	883	<FORMHEADS>
neuper@37906	884	<CALCFORMULA>
neuper@37906	885	<POSITION>
neuper@37906	886	<INTLIST>
neuper@37906	887	</INTLIST>
neuper@37906	888	<POS> Pbl </POS>
neuper@37906	889	</POSITION>
neuper@37906	890	<FORMULA>
neuper@37906	891	<MATHML>
neuper@37906	892	<ISA> Simplify (1 + 2) </ISA> WORKS !!!!!
neuper@37906	893	</MATHML>
neuper@37906	894	</FORMULA>
neuper@37906	895	</CALCFORMULA>
neuper@37906	896	</FORMHEADS>
neuper@37906	897	</GETELEMENTSFROMTO>
neuper@37906	898	@@@@@end@@@@@*)
neuper@37906	899	getFormulaeFromTo 1 ([],Pbl) ([],Met) 0 false;
neuper@37906	900	(*[[from sml: > @@@@@begin@@@@@
neuper@37906	901	[[from sml: 1
neuper@37906	902	[[from sml: <SYSERROR>
neuper@37906	903	[[from sml: <CALCID> 1 </CALCID>
neuper@37906	904	[[from sml: <ERROR> error in getFormulaeFromTo </ERROR>
neuper@37906	905	[[from sml: </SYSERROR>
neuper@37906	906	[[from sml: @@@@@end@@@@@*)
neuper@37906	907	(step into getFormulaeFromTo --- bug corrected...)
Walther@60571	908	-----------------------------------------------------------------------------------------------*)
neuper@42423	909
walther@59909	910	"--------- build fun check_for' ------------------------------";
walther@59909	911	"--------- build fun check_for' ------------------------------";
walther@59909	912	"--------- build fun check_for' ------------------------------";
Walther@60565	913	val subst = [(TermC.parse_test @{context} "bdv", TermC.parse_test @{context} "x")]: subst;
neuper@42423	914	val rls = norm_Rational
walther@60230	915	val pat = TermC.parse_patt @{theory} "(?a + ?b)/(?b + ?c) = ?a / ?c";
Walther@60565	916	val (res, inf) = (TermC.parse_test @{context} "(2 + 3)/(3 + 4)", TermC.parse_test @{context} "2 / 4");
Walther@60565	917	val (res, inf) = (TermC.parse_test @{context} "(2 + 3)/(3 + 4)", TermC.parse_test @{context} "1 / 2");
neuper@42423	918
walther@60230	919	val (res', _, _, rewritten) = (rewritten: the lhs of the pattern TermC.matches in res)
Walther@60509	920	rew_sub ctxt 1 [] Rewrite_Ord.function_empty Rule_Set.empty false [] (HOLogic.Trueprop $ pat) res;
neuper@42423	921	if rewritten then NONE else SOME "e_errpatID";
neuper@42423	922
Walther@60500	923	val norm_res = case rewrite_set_ ctxt false rls res' of
neuper@42423	924	NONE => res'
neuper@42423	925	\| SOME (norm_res, _) => norm_res
neuper@42423	926
Walther@60500	927	val norm_inf = case rewrite_set_ ctxt false rls inf of
neuper@42423	928	NONE => inf
neuper@42423	929	\| SOME (norm_inf, _) => norm_inf;
neuper@42423	930
neuper@42423	931	res' = inf;
neuper@42423	932	norm_res = norm_inf;
neuper@42423	933
walther@60230	934	val pat = TermC.parse_patt @{theory} "(?a + ?b)/?a = ?b";
Walther@60565	935	val (res, inf) = (TermC.parse_test @{context} "(2 + 3)/2", TermC.parse_test @{context} "3");
Walther@60523	936	if check_for' ctxt (res, inf) subst ("errpatID", pat) rls = SOME "errpatID"
neuper@42423	937	then () else error "error patt example1 changed";
neuper@42423	938
walther@60230	939	val pat = TermC.parse_patt @{theory} "(?a + ?b)/(?a + ?c) = ?b / ?c";
Walther@60565	940	val (res, inf) = (TermC.parse_test @{context} "(2 + 3)/(2 + 4)", TermC.parse_test @{context} "3 / 4");
Walther@60523	941	if check_for' ctxt (res, inf) subst ("errpatID", pat) rls = SOME "errpatID"
neuper@42423	942	then () else error "error patt example2 changed";
neuper@42423	943
walther@60230	944	val pat = TermC.parse_patt @{theory} "(?a + ?b)/(?b + ?c) = ?a / ?c";
Walther@60565	945	val (res, inf) = (TermC.parse_test @{context} "(2 + 3)/(3 + 4)", TermC.parse_test @{context} "2 / 4");
Walther@60523	946	if check_for' ctxt (res, inf) subst ("errpatID", pat) rls = SOME "errpatID"
neuper@42423	947	then () else error "error patt example3 changed";
neuper@42423	948
Walther@60565	949	val inf = TermC.parse_test @{context} "1 / 2";
Walther@60523	950	if check_for' ctxt (res, inf) subst ("errpatID", pat) rls = SOME "errpatID"
neuper@42423	951	then () else error "error patt example3 changed";
neuper@42423	952
walther@59909	953	"--------- build fun check_for' ?bdv -------------------------";
walther@59909	954	"--------- build fun check_for' ?bdv -------------------------";
walther@59909	955	"--------- build fun check_for' ?bdv -------------------------";
Walther@60500	956	val ctxt = Proof_Context.init_global @{theory}
Walther@60565	957	val subst = [(TermC.parse_test @{context} "bdv", TermC.parse_test @{context} "x")]: subst;
Walther@60565	958	val t = TermC.parse_test @{context} "d_d x (x \<up> 2 + sin (x \<up> 4))";
Walther@60500	959	val SOME (t, _) = rewrite_set_inst_ ctxt false subst norm_diff t;
walther@60242	960	if UnparseC.term t = "2 * x + cos (x \<up> 4) * 4 * x \<up> 3" then ()
walther@59909	961	else error "build fun check_for' ?bdv changed 1";
neuper@42423	962
neuper@42426	963	val rls = norm_diff
walther@60230	964	val pat = TermC.parse_patt @{theory} "d_d ?bdv (sin ?u) = cos (d_d ?bdv ?u)";
Walther@60565	965	val (res, inf) = (TermC.parse_test @{context} "2 * x + d_d x (sin (x \<up> 4))", TermC.parse_test @{context} "2 * x + cos (4 * x \<up> 3)");
neuper@42426	966
walther@60230	967	val (res', _, _, rewritten) = (rewritten: the lhs of the pattern TermC.matches in res)
Walther@60509	968	rew_sub ctxt 1 subst Rewrite_Ord.function_empty Rule_Set.empty false [] (HOLogic.Trueprop $ pat) res;
walther@60242	969	if UnparseC.term res' = "2 * x + cos (d_d x (x \<up> 4))" andalso rewritten then ()
walther@59909	970	else error "build fun check_for' ?bdv changed 2";
neuper@42426	971
Walther@60500	972	val norm_res = case rewrite_set_inst_ ctxt false subst rls res' of
neuper@42426	973	NONE => res'
neuper@42426	974	\| SOME (norm_res, _) => norm_res;
walther@60242	975	if UnparseC.term norm_res = "2 * x + cos (4 * x \<up> 3)" then ()
walther@59909	976	else error "build fun check_for' ?bdv changed 3";
neuper@42426	977
Walther@60500	978	val norm_inf = case rewrite_set_inst_ ctxt false subst rls inf of
neuper@42426	979	NONE => inf
neuper@42426	980	\| SOME (norm_inf, _) => norm_inf;
walther@60242	981	if UnparseC.term norm_inf = "2 * x + cos (4 * x \<up> 3)" then ()
walther@59909	982	else error "build fun check_for' ?bdv changed 4";
neuper@42426	983
neuper@42426	984	res' = inf;
neuper@42426	985	if norm_res = norm_inf then ()
walther@59909	986	else error "build fun check_for' ?bdv changed 5";
neuper@42426	987
Walther@60523	988	if Error_Pattern.check_for' ctxt (res, inf) (subst: subst) ("errpatID": Error_Pattern.id, pat) rls = SOME "errpatID"
neuper@42426	989	then () else error "error patt example1 changed";
neuper@42426	990
walther@59909	991	"--------- build fun check_for ------------------------";
walther@59909	992	"--------- build fun check_for ------------------------";
walther@59909	993	"--------- build fun check_for ------------------------";
neuper@42428	994	val (res, inf) =
Walther@60565	995	(TermC.parse_test @{context} "d_d x (x \<up> 2) + d_d x (sin (x \<up> 4))",
Walther@60565	996	TermC.parse_test @{context} "d_d x (x \<up> 2) + cos (4 * x \<up> 3)");
Walther@60586	997	val {errpats, rew_rls = rls, program = Prog prog, ...} = MethodC.from_store ctxt ["diff", "differentiate_on_R"]
neuper@42426	998
Walther@60565	999	val env = [(TermC.parse_test @{context} "v_v", TermC.parse_test @{context} "x")];
neuper@42428	1000	val errpats =
walther@59971	1001	[Error_Pattern.empty, (generalised for testing)
neuper@42428	1002	("chain-rule-diff-both",
walther@60230	1003	[TermC.parse_patt @{theory} "d_d ?bdv (sin ?u) = cos (d_d ?bdv ?u)",
walther@60230	1004	TermC.parse_patt @{theory} "d_d ?bdv (cos ?u) = - sin (d_d ?bdv ?u)",
walther@60242	1005	TermC.parse_patt @{theory} "d_d ?bdv (?u \<up> ?n) = ?n * ?u \<up> (?n - 1)",
walther@60230	1006	TermC.parse_patt @{theory} "d_d ?bdv (LogExp.ln ?u) = 1 / ?u",
walther@60230	1007	TermC.parse_patt @{theory} "d_d ?bdv (LogExp.ln ?u) = 1 / d_d ?bdv ?u"],
neuper@42428	1008	[@{thm diff_sin_chain}, @{thm diff_cos_chain}, @{thm diff_pow_chain},
walther@59921	1009	@{thm diff_ln_chain}, @{thm diff_exp_chain}])];
Walther@60523	1010	case Error_Pattern.check_for ctxt (res, inf) (prog, env) (errpats, rls) of SOME _ => ()
walther@59844	1011	\| NONE => error "Error_Pattern.check_for broken";
wneuper@59252	1012	DEconstrCalcTree 1;
neuper@42428	1013
walther@59909	1014	"--------- embed fun check_for ------------------------";
walther@59909	1015	"--------- embed fun check_for ------------------------";
walther@59909	1016	"--------- embed fun check_for ------------------------";
Walther@60549	1017	States.reset ();
Walther@60571	1018	CalcTree @{context}
walther@60242	1019	[(["functionTerm (x \<up> 2 + sin (x \<up> 4))", "differentiateFor x", "derivative f_f'"],
walther@59997	1020	("Isac_Knowledge", ["derivative_of", "function"], ["diff", "differentiate_on_R"]))];
neuper@42428	1021	Iterator 1;
neuper@42428	1022	moveActiveRoot 1;
wneuper@59248	1023	autoCalculate 1 CompleteCalcHead;
walther@59747	1024	autoCalculate 1 (Steps 1);
walther@60242	1025	autoCalculate 1 (Steps 1);(([1], Res), d_d x (x \<up> 2) + d_d x (sin (x \<up> 4)))
walther@60242	1026	(autoCalculate 1 (Steps 1);([2], Res), d_d x (x \<up> 2) + cos (x \<up> 4) d_d x (x \<up> \<up> 4)*)
neuper@42428	1027
walther@60242	1028	"~~~~~ fun appendFormula , args:"; val (cI, (ifo:TermC.as_string)) = (1, "d_d x (x \<up> 2) + cos (4 * x \<up> 3)");
walther@59868	1029	"~~~~~ fun appendFormula' , args:"; val (cI, (ifo: TermC.as_string)) = (cI, ifo);
Walther@60549	1030	val cs = States.get_calc cI
Walther@60549	1031	val pos = States.get_pos cI 1;
walther@59844	1032	(+)if pos = ([1], Res) then () else error "inform with (positive) Error_Pattern.check_for broken 1";
walther@59798	1033	val ("ok", cs' as (_, _, ptp)) = (case) Step.do_next pos cs (of);
walther@59798	1034	(case) Step_Solve.by_term ptp (encode ifo) (of); (ERROR WAS: "no derivation found")
walther@59981	1035	"~~~~~ fun Step_Solve.by_term , args:"; val (((next_)cs as (_, _, (pt, pos as (p, _))): Calc.state_post), istr)
wneuper@59562	1036	= (cs', (encode ifo));
wneuper@59562	1037	val ctxt = get_ctxt pt pos (see TODO.thy)
Walther@60424	1038	val SOME f_in = (case) TermC.parseNEW ctxt istr (of);
wneuper@59562	1039	val pos_pred = lev_back' pos
wneuper@59562	1040	val f_pred = Ctree.get_curr_formula (pt, pos_pred);
wneuper@59562	1041	(if) f_pred = f_in; (else)
walther@59982	1042	val NONE = (case) CAS_Cmd.input f_in (of);
walther@59795	1043	(old )val (_, _, metID) = get_obj g_spec pt (par_pblobj pt p)
Walther@60586	1044	(old)val {program = prog, ...} = MethodC.from_store ctxt metID
walther@59807	1045	(old)val istate = get_istate_LI pt pos
walther@59795	1046	(old)val ctxt = get_ctxt pt pos
walther@59795	1047	( old)
walther@59795	1048	val LI.Not_Derivable =
walther@59795	1049	(case) LI.locate_input_term (pt, pos) f_in (of);
Walther@60631	1050	val met_id = Ctree.get_obj Ctree.g_metID pt (Ctree.par_pblobj pt p)
Walther@60631	1051	val (errpats, rew_rls, prog) = case MethodC.from_store' (Know_Store.get_via_last_thy "Build_Thydata") met_id of
Walther@60586	1052	{errpats, rew_rls, program = Rule.Prog prog, ...} => (errpats, rew_rls, prog)
Walther@60559	1053	\| _ => error "inform: uncovered case of MethodC.from_store ctxt"
wneuper@59562	1054	;
Walther@60648	1055	(+)if Error_Pattern.s_to_string ctxt errpats = "[(\"chain-rule-diff-both\",\n[d_d ?bdv (sin ?u) = cos (d_d ?bdv ?u), d_d ?bdv (cos ?u) = - sin (d_d ?bdv ?u), d_d ?bdv (?u \<up> ?n) = ?n * ?u \<up> (?n - 1)],\n[\"d_d ?bdv (sin ?u) = cos ?u * d_d ?bdv ?u\", \"d_d ?bdv (cos ?u) = - sin ?u * d_d ?bdv ?u\", \"d_d ?bdv (?u \<up> ?n) = ?n * ?u \<up> (?n - 1) * d_d ?bdv ?u\"]]"
walther@59844	1056	(+)then () else error "inform with (positive) Error_Pattern.check_for broken 3";
neuper@42428	1057
walther@59807	1058	val {env, ...} = Ctree.get_istate_LI pt pos \|> Istate.the_pstate
wneuper@59562	1059	;
walther@60242	1060	(+)if UnparseC.term f_pred = "d_d x (x \<up> 2) + d_d x (sin (x \<up> 4))" andalso
walther@60242	1061	(+) UnparseC.term f_in = "d_d x (x \<up> 2) + cos (4 * x \<up> 3)"
walther@59844	1062	(+)then () else error "inform with (positive) Error_Pattern.check_for broken 2";
neuper@42428	1063
Walther@60586	1064	val SOME "chain-rule-diff-both" = (case) Error_Pattern.check_for ctxt (f_pred, f_in) (prog, env) (errpats, rew_rls) (of);
neuper@42428	1065
neuper@42428	1066	"--- final check:";
walther@59798	1067	(+)val (_, _, ptp') = cs';
walther@59798	1068	case Step_Solve.by_term ptp' (encode ifo) of
neuper@42428	1069	("error pattern #chain-rule-diff-both#", calcstate') => ()
walther@59844	1070	\| _ => error "inform with (positive) Error_Pattern.check_for broken"
neuper@42428	1071
neuper@48895	1072
Walther@60631	1073	"----------- re-build: fill_from_store without thy-hierarchy -----------------------------------";
Walther@60631	1074	"----------- re-build: fill_from_store without thy-hierarchy -----------------------------------";
Walther@60631	1075	"----------- re-build: fill_from_store without thy-hierarchy -----------------------------------";
Walther@60631	1076	open Error_Pattern
Walther@60631	1077	val c = []: int list
Walther@60631	1078	val (p,_,f,nxt,_,pt) = Test_Code.init_calc @{context}
Walther@60631	1079	[(["functionTerm (x \<up> 2 + sin (x \<up> 4))", "differentiateFor x", "derivative f_f'"],
Walther@60631	1080	("Isac_Knowledge", ["derivative_of", "function"], ["diff", "differentiate_on_R"]))];
Walther@60631	1081	val (p,_,f,nxt,_,pt) = me nxt p c pt;
Walther@60631	1082	val (p,_,f,nxt,_,pt) = me nxt p c pt;
Walther@60631	1083	val (p,_,f,nxt,_,pt) = me nxt p c pt;
Walther@60631	1084	val (p,_,f,nxt,_,pt) = me nxt p c pt;
Walther@60631	1085	val (p,_,f,nxt,_,pt) = me nxt p c pt;
Walther@60631	1086	val (p,_,f,nxt,_,pt) = me nxt p c pt;
Walther@60631	1087	val (p,_,f,nxt,_,pt) = me nxt p c pt; (nxt = Apply_Method ["diff", "differentiate_on_R"])
Walther@60631	1088	val (p,_,f,nxt,_,pt) = me nxt p c pt; (nxt = Rewrite_Inst (["(''bdv'', x)"], ("diff_sum", "d_d ?bdv (?u + ?v) = d_d ?bdv ?u + d_d ?bdv ?v")))
Walther@60631	1089	val ([1], Frm) = p;
Walther@60631	1090	val "d_d x (x \<up> 2 + sin (x \<up> 4))" = f2str f;
Walther@60631	1091	val (p,_,f,nxt,_,pt) = me nxt p c pt; (nxt = Rewrite_Inst (["(''bdv'', x)"], ("diff_sin_chain", "d_d ?bdv (sin ?u) = cos ?u d_d ?bdv ?u"))*)
Walther@60631	1092	val ([1], Res) = p;
Walther@60631	1093	val "d_d x (x \<up> 2) + d_d x (sin (x \<up> 4))" = f2str f
Walther@60631	1094
Walther@60631	1095	val return_of_me = me nxt p c pt; (nxt = Rewrite_Inst (["(''bdv'', x)"], ("diff_pow", "d_d ?bdv (?bdv \<up> ?n) = ?n ?bdv \<up> (?n - 1)"))*)
Walther@60631	1096	val ([1], Res) = p
Walther@60631	1097	val "d_d x (x \<up> 2) + d_d x (sin (x \<up> 4))" = f2str f;
Walther@60631	1098	(* "d_d x (x \<up> 2) + cos (x \<up> 4)" .. wrong user input within next step *)
Walther@60631	1099	(//------------------ step into find_fill_patterns ----------------------------------------\\)
Walther@60631	1100	(* INSTEAD OF STEPPING INTO me WE DO SO FOR Kernel.findFillpatterns cI errpatID =
Walther@60631	1101	let
Walther@60631	1102	val ((pt, _), _) = States.get_calc cI
Walther@60631	1103	val pos = States.get_pos cI 1;
Walther@60631	1104	val fillpats = Error_Pattern.find_fill_patterns (pt, pos) errpatID
Walther@60631	1105	*)
Walther@60631	1106	"~~~~~ fun findFillpatterns , args:"; val (pt, p, errpatID) = (pt, p, "chain-rule-diff-both");
Walther@60631	1107	"~~~~~ fun find_fill_patterns , args:"; val ((pt, pos as (p, _)), id) = ((pt, p), errpatID);
Walther@60631	1108	(old-------\ )
Walther@60631	1109	val f_curr = Ctree.get_curr_formula (pt, pos);
Walther@60631	1110	val pp = Ctree.par_pblobj pt p
Walther@60631	1111	val (errpats, prog) = case MethodC.from_store ctxt (Ctree.get_obj Ctree.g_metID pt pp) of
Walther@60631	1112	{errpats, program = Rule.Prog prog, ...} => (errpats, prog)
Walther@60631	1113	\| _ => error "find_fill_patterns: uncovered case of MethodC.from_store ctxt"
Walther@60631	1114	( new-------\)
Walther@60631	1115	val ctxt = Ctree.get_ctxt pt pos
Walther@60631	1116	val f_curr = Ctree.get_curr_formula (pt, pos)
Walther@60631	1117	val met_id = Ctree.get_obj Ctree.g_metID pt (Ctree.par_pblobj pt p)
Walther@60631	1118	val (errpats, prog) = case MethodC.from_store' (Know_Store.get_via_last_thy "Build_Thydata") met_id of
Walther@60631	1119	{errpats, program = Rule.Prog prog, ...} => (errpats, prog)
Walther@60631	1120	\| _ => error "find_fill_patterns: uncovered case of MethodC.from_store ctxt"
Walther@60631	1121	(new-------/)
Walther@60631	1122
Walther@60631	1123	(+)val 1 = length errpats(ONLY WITH from_store' @{theory (!!!)Build_Thydata})
Walther@60631	1124	val {env, ...} = Ctree.get_istate_LI pt pos \|> Istate.the_pstate
Walther@60631	1125	val subst = Subst.for_bdv ctxt prog env
Walther@60631	1126	val errpatthms = errpats
Walther@60631	1127	\|> filter ((curry op = errpatID) o (#1: Error_Pattern.T -> Error_Pattern.id))
Walther@60631	1128	\|> map (#3: Error_Pattern.T -> thm list)
Walther@60631	1129	\|> flat;
Walther@60631	1130
Walther@60631	1131	(+)val 3 = length errpatthms;
Walther@60631	1132	(+)val 5 = length (get_fill_ins @{theory} "diff_sin_chain");
Walther@60631	1133
Walther@60631	1134	(case) map (
Walther@60631	1135	fill_from_store ctxt subst f_curr errpatID) errpatthms \|> flat (of);
Walther@60631	1136	"~~~~~ fun fill_from_store , args:"; val (ctxt, subst, form, (id)errpat_id, thm) =
Walther@60631	1137	(ctxt, subst, f_curr, errpatID, hd errpatthms);
Walther@60631	1138	val thm_id_long = Thm.get_name_hint thm
Walther@60631	1139
Walther@60631	1140	(+)val "Diff.diff_sin_chain" = thm_id_long;
Walther@60631	1141	(+)val "diff_sin_chain" = ThmC.cut_id thm_id_long;
Walther@60631	1142
Walther@60631	1143	val thm_id = ThmC.cut_id thm_id_long
Walther@60631	1144	val fill_ins =
Walther@60631	1145
Walther@60631	1146	Error_Pattern.get_fill_ins (Proof_Context.theory_of ctxt) thm_id;
Walther@60631	1147	"~~~~~ fun get_fill_ins , args:"; val (thy, thm_id) =
Walther@60631	1148	((Proof_Context.theory_of ctxt), thm_id);
Walther@60631	1149	(case) AList.lookup (op =) (get_fill_inss thy) thm_id (of);
Walther@60631	1150	val ERROR "fill_ins for thm \"diff_sin_chain\" missing in theory \"Isac_Knowledge\" (and ancestors)\nTODO exception hierarchy needs to be established." =
Walther@60631	1151	ERROR ("fill_ins for thm \"" ^ thm_id ^ "\" missing in theory \"" ^
Walther@60631	1152	(thy \|> ThyC.id_of) ^ "\" (and ancestors)" ^
Walther@60631	1153	"\nTODO exception hierarchy needs to be established.");
Walther@60631	1154
Walther@60631	1155	(return to fill_from_store..)
Walther@60631	1156	val some = map (fill_form ctxt subst (thm, form) errpat_id) fill_ins;
Walther@60631	1157	val return_fill_from_store = some \|> filter is_some \|> map the;
Walther@60631	1158
Walther@60631	1159	(* final test ... ----------------------------------------------------------------------------*)
Walther@60631	1160	(+)if length return_fill_from_store = 5 then
Walther@60631	1161	(+) case return_fill_from_store of
Walther@60631	1162	(+) ("fill-d_d-arg", tm, thm, subsopt) :: _ => if UnparseC.term tm =
Walther@60631	1163	(+) "d_d x (x \<up> 2) + d_d x (sin (x \<up> 4)) =\nd_d x (x \<up> 2) + cos (x \<up> 4) * d_d x ?_dummy_1"
Walther@60631	1164	(+) then () else error "find_fill_patterns changed 2a"
Walther@60631	1165	(+) \| _ => error "find_fill_patterns changed 2b"
Walther@60631	1166	(+)else error "find_fill_patterns changed 2c";
Walther@60631	1167	(-------------------- stop step into find_fill_patterns -------------------------------------)
Walther@60631	1168	(\\------------------ step into find_fill_patterns ----------------------------------------//)
Walther@60631	1169
Walther@60631	1170	val (p,_,f,nxt,_,pt) = return_of_me
Walther@60631	1171	val (p,_,f,nxt,_,pt) = me nxt p c pt; (nxt = Rewrite_Inst (["(''bdv'', x)"], ("diff_pow", "d_d ?bdv (?bdv \<up> ?n) = ?n ?bdv \<up> (?n - 1)"))*)
Walther@60631	1172	val ([3], Res) = p
Walther@60631	1173	val "d_d x (x \<up> 2) + cos (x \<up> 4) * (4 * x \<up> (4 - 1))" = f2str f;
Walther@60631	1174	val (p,_,f,nxt,_,pt) = me nxt p c pt;
Walther@60631	1175	val (p,_,f,nxt,_,pt) = me nxt p c pt; (nxt = Check_Postcond ["derivative_of", "function"])
Walther@60631	1176	val (p,_,f,nxt,_,pt) = me nxt p c pt;
Walther@60631	1177	val ([], Res) = p;
Walther@60631	1178	val "2 * x + cos (x \<up> 4) * 4 * x \<up> 3" = f2str f
Walther@60631	1179	val End_Proof' = nxt;
Walther@60631	1180
Walther@60631	1181
walther@59909	1182	"--------- embed fun find_fill_patterns ---------------------------";
walther@59909	1183	"--------- embed fun find_fill_patterns ---------------------------";
walther@59909	1184	"--------- embed fun find_fill_patterns ---------------------------";
Walther@60549	1185	States.reset ();
Walther@60571	1186	CalcTree @{context}
walther@60242	1187	[(["functionTerm (x \<up> 2 + sin (x \<up> 4))", "differentiateFor x", "derivative f_f'"],
walther@59997	1188	("Isac_Knowledge", ["derivative_of", "function"], ["diff", "differentiate_on_R"]))];
neuper@42430	1189	Iterator 1;
neuper@42430	1190	moveActiveRoot 1;
wneuper@59248	1191	autoCalculate 1 CompleteCalcHead;
walther@59747	1192	autoCalculate 1 (Steps 1);
walther@60242	1193	autoCalculate 1 (Steps 1);(([1], Res), d_d x (x \<up> 2) + d_d x (sin (x \<up> 4)))
Walther@60631	1194	appendFormula 1 "d_d x (x \<up> 2) + cos (4 * x \<up> 3)";
neuper@42430	1195	(<CALCMESSAGE> error pattern #chain-rule-diff-both# </CALCMESSAGE>)
neuper@42432	1196	(*or
neuper@42432	1197	<CALCMESSAGE> no derivation found </CALCMESSAGE>*)
neuper@42433	1198	"~~~~~ fun findFillpatterns, args:"; val (cI, errpatID) = (1, "chain-rule-diff-both");
Walther@60549	1199	val ((pt, _), _) = States.get_calc cI
Walther@60549	1200	val pos = States.get_pos cI 1;
neuper@42430	1201
Walther@60631	1202	val return_from_find_fill_patterns = find_fill_patterns (pt, pos) errpatID;
Walther@60631	1203	DEconstrCalcTree 1;
neuper@42430	1204
Walther@60631	1205	(* final test ... ----------------------------------------------------------------------------*)
Walther@60631	1206	val 6 = length return_from_find_fill_patterns
Walther@60631	1207	val (fill_in_id, term, thm, subst) :: _ = return_from_find_fill_patterns
neuper@42430	1208
Walther@60631	1209	val "fill-d_d-arg" = fill_in_id
Walther@60631	1210	val "d_d x (x \<up> 2) + d_d x (sin (x \<up> 4)) =\nd_d x (x \<up> 2) + cos (x \<up> 4) * d_d x ?_dummy_1" =
Walther@60631	1211	UnparseC.term_in_ctxt @{context} term
Walther@60631	1212	val "Diff.diff_sin_chain" = Thm.get_name_hint thm
Walther@60631	1213	val "[(''bdv'', x)]" = subst \|> the \|> Subst.string_of_input;
neuper@42430	1214
neuper@42450	1215
neuper@42437	1216	"--------- build fun is_exactly_equal, inputFillFormula ----------";
neuper@42437	1217	"--------- build fun is_exactly_equal, inputFillFormula ----------";
neuper@42437	1218	"--------- build fun is_exactly_equal, inputFillFormula ----------";
Walther@60549	1219	States.reset ();
Walther@60571	1220	CalcTree @{context}
walther@60242	1221	[(["functionTerm (x \<up> 2 + sin (x \<up> 4))", "differentiateFor x", "derivative f_f'"],
walther@59997	1222	("Isac_Knowledge", ["derivative_of", "function"], ["diff", "differentiate_on_R"]))];
neuper@42437	1223	Iterator 1;
neuper@42437	1224	moveActiveRoot 1;
wneuper@59248	1225	autoCalculate 1 CompleteCalcHead;
walther@59747	1226	autoCalculate 1 (Steps 1);
walther@60242	1227	autoCalculate 1 (Steps 1);(([1], Res), d_d x (x \<up> 2) + d_d x (sin (x \<up> 4)))
walther@60242	1228	appendFormula 1 "d_d x (x \<up> 2) + cos (4 * x \<up> 3)" (\|> Future.join); (<<<<<<<=========================)
Walther@60586	1229	(* the check for errpat is maximally liberal (whole term modulo "rew_rls" from "type met"),
walther@60242	1230	would recognize "cos (4 * x \<up> (4 - 1)) + 2 * x" as well.
neuper@42437	1231	results in <CALCMESSAGE> error pattern #chain-rule-diff-both# </CALCMESSAGE>
neuper@42437	1232	instead of <CALCMESSAGE> no derivation found </CALCMESSAGE> *)
Walther@60549	1233	val ((pt,pos), _) = States.get_calc 1;
Walther@60549	1234	val p = States.get_pos 1 1;
Walther@60577	1235	val (Form f, _, asms) = ME_Misc.pt_extract ctxt (pt, p);
neuper@42437	1236
walther@60242	1237	if p = ([1], Res) andalso UnparseC.term f = "d_d x (x \<up> 2) + d_d x (sin (x \<up> 4))" then
wneuper@59497	1238	case get_obj g_tac pt (fst p) of Rewrite_Inst (["(''bdv'', x)"],
wneuper@59253	1239	("diff_sum", thm)) =>
walther@59868	1240	if (UnparseC.term o Thm.prop_of) thm = "d_d ?bdv (?u + ?v) = d_d ?bdv ?u + d_d ?bdv ?v" then ()
walther@59909	1241	else error "embed fun fill_form changed 11"
walther@59909	1242	\| _ => error "embed fun fill_form changed 12"
walther@59909	1243	else error "embed fun fill_form changed 13";
neuper@42437	1244
neuper@42437	1245	findFillpatterns 1 "chain-rule-diff-both"; (<<<<<<<=================================)
walther@60242	1246	(*<CALCMESSAGE> fill patterns #fill-d_d-arg#d_d x (x \<up> 2) + d_d x (sin (x \<up> 4)) =
walther@60242	1247	d_d x (x \<up> 2) + cos (x \<up> 4) * d_d x ?_dummy_1#fill-both-args#...#...#... *)
Walther@60549	1248	val ((pt,pos),_) = States.get_calc 1;
Walther@60549	1249	val p = States.get_pos 1 1;
neuper@42437	1250
Walther@60577	1251	val (Form f, _, asms) = ME_Misc.pt_extract ctxt (pt, p);
walther@60242	1252	if p = ([1], Res) andalso UnparseC.term f = "d_d x (x \<up> 2) + d_d x (sin (x \<up> 4))" then
wneuper@59497	1253	case get_obj g_tac pt (fst p) of Rewrite_Inst (["(''bdv'', x)"],
wneuper@59253	1254	("diff_sum", thm)) =>
walther@59868	1255	if (UnparseC.term o Thm.prop_of) thm = "d_d ?bdv (?u + ?v) = d_d ?bdv ?u + d_d ?bdv ?v" then ()
walther@59909	1256	else error "embed fun fill_form changed 21"
walther@59909	1257	\| _ => error "embed fun fill_form changed 22"
walther@59909	1258	else error "embed fun fill_form changed 23";
neuper@42437	1259
neuper@42437	1260	requestFillformula 1 ("chain-rule-diff-both", "fill-both-args");(<<<<<<<============)
neuper@42437	1261	(<AUTOCALC> ([1], Res) ([2], Res) ([2], Res) </AUTOCALC>)
Walther@60549	1262	val ((pt,pos),_) = States.get_calc 1;
Walther@60549	1263	val p = States.get_pos 1 1;
Walther@60577	1264	val (Form f, _, asms) = ME_Misc.pt_extract ctxt (pt, p);
wneuper@59253	1265	if p = ([1], Res) andalso existpt [2] pt
walther@60242	1266	andalso UnparseC.term f = "d_d x (x \<up> 2) + d_d x (sin (x \<up> 4))"
wneuper@59497	1267	then case get_obj g_tac pt (fst p) of Rewrite_Inst (["(''bdv'', x)"],
wneuper@59253	1268	("diff_sum", thm)) =>
walther@59868	1269	if (UnparseC.term o Thm.prop_of) thm = "d_d ?bdv (?u + ?v) = d_d ?bdv ?u + d_d ?bdv ?v" then ()
walther@59909	1270	else error "embed fun fill_form changed 31"
walther@59909	1271	\| _ => error "embed fun fill_form changed 32"
walther@59909	1272	else error "embed fun fill_form changed 33";
neuper@42437	1273
neuper@42437	1274	(* input a formula which exactly fills the gaps in a "fillformula"
neuper@42437	1275	presented to the learner immediately before by "requestFillformula (errpatID, fillpatID)":
neuper@42437	1276	errpatID: lhs of the respective thm = lhs of fillformula with fillpatID.
neuper@42437	1277	the respective thm is in the ctree ................
neuper@42437	1278	*)
neuper@42437	1279	"~~~~~ fun inputFillFormula, args:"; val (cI, ifo) =
walther@60242	1280	(1, "d_d x (x \<up> 2) + cos (x \<up> 4) * d_d x (x \<up> 4)");
Walther@60549	1281	val ((pt, _), _) = States.get_calc cI
Walther@60549	1282	val pos = States.get_pos cI 1;
neuper@42437	1283
neuper@42437	1284	"~~~~~ fun is_exactly_equal, args:"; val ((pt, pos as (p, p_)), istr) = ((pt, pos), ifo);
walther@60360	1285	val SOME ifo = parseNEW (ThyC.get_theory "Isac_Knowledge" \|> Proof_Context.init_global) istr
neuper@42437	1286	val p' = lev_on p;
neuper@42437	1287	val tac = get_obj g_tac pt p';
wneuper@59497	1288	val Rewrite_Inst ([bbb as "(''bdv'', x)"], ("diff_sin_chain", ttt)) = tac;
walther@59868	1289	if (UnparseC.term o Thm.prop_of) ttt = "d_d ?bdv (sin ?u) = cos ?u * d_d ?bdv ?u" then ()
wneuper@59252	1290	else error "inputFillFormula changed 10";
walther@59921	1291	val Applicable.Yes rew = Step.check tac (pt, pos);
neuper@42437	1292	val Rewrite_Inst' (_, _, _, _, _, _, _, (res, _)) = rew;
neuper@42437	1293
neuper@42437	1294	"~~~~~ to inputFillFormula return val:"; val ("ok", tac) = ("ok", tac);
walther@59804	1295	val ("ok", (_, c, ptp as (_,p'))) = Step.by_tactic tac (pt, pos);
Walther@60549	1296	States.upd_calc cI (ptp, []);
Walther@60549	1297	States.upd_ipos cI 1 p';
neuper@42437	1298	autocalculateOK2xml cI pos (if null c then p' else last_elem c) p';
neuper@42437	1299
neuper@42437	1300	"~~~~~ final check:";
Walther@60549	1301	val ((pt, _),_) = States.get_calc 1;
Walther@60549	1302	val p = States.get_pos 1 1;
Walther@60577	1303	val (Form f, _, asms) = ME_Misc.pt_extract ctxt (pt, p);
walther@60242	1304	if p = ([2], Res) andalso UnparseC.term f = "d_d x (x \<up> 2) + cos (x \<up> 4) * d_d x (x \<up> 4)"
wneuper@59497	1305	then case get_obj g_tac pt (fst p) of Rewrite_Inst (["(''bdv'', x)"],
wneuper@59253	1306	("diff_sin_chain", thm)) =>
walther@59868	1307	if (UnparseC.term o Thm.prop_of) thm = "d_d ?bdv (sin ?u) = cos ?u * d_d ?bdv ?u" then ()
wneuper@59253	1308	else error "inputFillFormula changed 111"
wneuper@59253	1309	\| _ => error "inputFillFormula changed 112"
wneuper@59253	1310	else error "inputFillFormula changed 113";
neuper@42437	1311
wneuper@59262	1312	"--------- fun appl_adds -----------------------------------------";
wneuper@59262	1313	"--------- fun appl_adds -----------------------------------------";
wneuper@59262	1314	"--------- fun appl_adds -----------------------------------------";
Walther@60586	1315	(* val (dI, oris, model, pbt, selct::ss) =
Walther@60586	1316	(dI, pors, probl, model, map itms2fstr probl);
wneuper@59262	1317	...vvv
wneuper@59262	1318	*)
Walther@60586	1319	(* val (dI, oris, model, pbt, (selct::ss))=
Walther@60494	1320	(#1 (References.select_input ospec spec), oris, []:I_Model.T,
Walther@60586	1321	((#model o Problem.from_store) (#2 (References.select_input ospec spec))),(imodel2fstr imodel));
Walther@60586	1322	val iii = appl_adds dI oris model pbt (selct::ss);
walther@59942	1323	tracing(I_Model.to_string thy iii);
wneuper@59262	1324
Walther@60586	1325	val itm = add_single' dI oris model pbt selct;
Walther@60586	1326	val model = I_Model.add itm model;
wneuper@59262	1327
wneuper@59262	1328	val _::selct::ss = (selct::ss);
Walther@60586	1329	val itm = add_single' dI oris model pbt selct;
Walther@60586	1330	val model = I_Model.add itm model;
wneuper@59262	1331
wneuper@59262	1332	val _::selct::ss = (selct::ss);
Walther@60586	1333	val itm = add_single' dI oris model pbt selct;
Walther@60586	1334	val model = I_Model.add itm model;
Walther@60586	1335	tracing(I_Model.to_string thy model);
wneuper@59262	1336
wneuper@59262	1337	val _::selct::ss = (selct::ss);
Walther@60586	1338	val itm = add_single' dI oris model pbt selct;
Walther@60586	1339	val model = I_Model.add itm model;
wneuper@59262	1340	*)
wneuper@59264	1341	"--------- fun concat_deriv --------------------------------------";
wneuper@59264	1342	"--------- fun concat_deriv --------------------------------------";
wneuper@59264	1343	"--------- fun concat_deriv --------------------------------------";
wneuper@59264	1344	(*
Walther@60586	1345	val ({rew_ord, asm_rls, rules,...}, fo, ifo) =
Walther@60565	1346	(Rule_Set.rep Test_simplify, TermC.parse_test @{context} "x+1+ - 12=0", TermC.parse_test @{context} "-21+(x+1)=0");
walther@59906	1347	(tracing o Derive.trtas2str) fod';
wneuper@59264	1348	> ["
walther@60324	1349	(x + 1 + - 1 * 2 = 0, Thm ("radd_commute", "?m + ?n = ?n + ?m"), (- 1 * 2 + (x + 1) = 0, []))", "
walther@60324	1350	(- 1 * 2 + (x + 1) = 0, Thm ("radd_commute", "?m + ?n = ?n + ?m"), (- 1 * 2 + (1 + x) = 0, []))", "
walther@60324	1351	(- 1 * 2 + (1 + x) = 0, Thm ("radd_left_commute", "?x + (?y + ?z) = ?y + (?x + ?z)"), (1 + (- 1 * 2 + x) = 0, []))", "
walther@60324	1352	(1 + (- 1 * 2 + x) = 0, Thm ("#mult_Float ((~1,0), (0,0)) __ ((2,0), (0,0))", "- 1 * 2 = -2"), (1 + (-2 + x) = 0, []))"]
wneuper@59264	1353	val it = () : unit
walther@59906	1354	(tracing o Derive.trtas2str) (map Derive.rev_deriv' rifod');
wneuper@59264	1355	> ["
walther@59997	1356	(1 + (-2 + x) = 0, Thm ("sym_#mult_Float ((~2,0), (0,0)) __ ((1,0), (0,0))", "-2 = -2 * 1"), (1 + (-2 * 1 + x) = 0, []))", "
walther@59997	1357	(1 + (-2 * 1 + x) = 0, Thm ("sym_radd_left_commute", "?y + (?x + ?z) = ?x + (?y + ?z)"), (-2 * 1 + (1 + x) = 0, []))", "
walther@59997	1358	(-2 * 1 + (1 + x) = 0, Thm ("sym_radd_commute", "?n + ?m = ?m + ?n"), (-2 * 1 + (x + 1) = 0, []))"]
wneuper@59264	1359	val it = () : unit
wneuper@59264	1360	*)
wneuper@59264	1361	"--------- handle an input formula -------------------------------";
wneuper@59264	1362	"--------- handle an input formula -------------------------------";
wneuper@59264	1363	"--------- handle an input formula -------------------------------";
wneuper@59264	1364	(*
wneuper@59264	1365	Untersuchung zur Formeleingabe (appendFormula, replaceFormla) zu einer Anregung von Alan Krempler:
wneuper@59264	1366	Welche RICHTIGEN Formeln koennen NICHT abgeleitet werden,
wneuper@59264	1367	wenn Abteilungen nur auf gleichem Level gesucht werden ?
wneuper@59264	1368	WN.040216
wneuper@59264	1369
wneuper@59264	1370	Beispiele zum Equationsolver von Richard Lang aus /src/sml/kbtest/rlang.sml
wneuper@59264	1371
wneuper@59264	1372	------------------------------------------------------------------------------
wneuper@59264	1373	"Schalk I s.87 Bsp 52a ((5*x)/(x - 2) - x/(x+2)=4)";
wneuper@59264	1374	------------------------------------------------------------------------------
wneuper@59264	1375	1. "5 * x / (x - 2) - x / (x + 2) = 4"
wneuper@59264	1376	...
walther@60242	1377	4. "12 * x + 4 * x \<up> 2 = 4 * (-4 + x \<up> 2)",Subproblem["normalise", "poly"..
wneuper@59264	1378	...
wneuper@59264	1379	4.3. "16 + 12 * x = 0", Subproblem["degree_1", "polynomial", "univariate"..
wneuper@59264	1380	...
wneuper@59264	1381	4.3.3. "[x = -4 / 3]")), Check_elementwise "Assumptions"
wneuper@59264	1382	...
wneuper@59264	1383	"[x = -4 / 3]"
wneuper@59264	1384	------------------------------------------------------------------------------
wneuper@59264	1385	(1)..(6): keine 'richtige' Eingabe kann abgeleitet werden, die einen Summanden auf die andere Seite verschiebt [Ableitung ware in 4.3.n]
wneuper@59264	1386
wneuper@59264	1387	(4.1)..(4.3): keine 'richtige' Eingabe kann abgeleitet werden, die einen Summanden auf die andere Seite verschiebt [Ableitung ware in 4.3.n]
wneuper@59264	1388	------------------------------------------------------------------------------
wneuper@59264	1389
wneuper@59264	1390
wneuper@59264	1391	------------------------------------------------------------------------------
walther@60242	1392	"Schalk I s.87 Bsp 55b (x/(x \<up> 2 - 6x+9) - 1/(x \<up> 2 - 3x) =1/x)";
wneuper@59264	1393	------------------------------------------------------------------------------
walther@60242	1394	1. "x / (x \<up> 2 - 6 * x + 9) - 1 / (x \<up> 2 - 3 * x) = 1 / x"
wneuper@59264	1395	...
walther@60324	1396	4. "(3 + (- 1 * x + x \<up> 2)) * x = 1 * (9 * x + (x \<up> 3 + -6 * x \<up> 2))"
wneuper@59367	1397	Subproblem["normalise", "polynomial", "univariate"..
wneuper@59264	1398	...
walther@60242	1399	4.4. "-6 * x + 5 * x \<up> 2 = 0", Subproblem["bdv_only", "degree_2", "poly"..
wneuper@59264	1400	...
wneuper@59264	1401	4.4.4. "[x = 0, x = 6 / 5]", Check_elementwise "Assumptions"
wneuper@59264	1402	4.4.5. "[x = 0, x = 6 / 5]"
wneuper@59264	1403	...
wneuper@59264	1404	5. "[x = 0, x = 6 / 5]", Check_elementwise "Assumptions"
wneuper@59264	1405	"[x = 6 / 5]"
wneuper@59264	1406	------------------------------------------------------------------------------
wneuper@59264	1407	(1)..(4): keine 'richtige' Eingabe kann abgeleitet werden, die einen Summanden auf die andere Seite schiebt [Ableitung waere in 4.4.x]
wneuper@59264	1408
wneuper@59264	1409	(4.1)..(4.4.5): keine 'richtige' Eingabe kann abgeleitet werden, die dem Ergebnis "[x = 6 / 5]" aequivalent ist [Ableitung waere in 5.]
wneuper@59264	1410	------------------------------------------------------------------------------
wneuper@59264	1411
wneuper@59264	1412
wneuper@59264	1413	------------------------------------------------------------------------------
wneuper@59264	1414	"Schalk II s.56 Bsp 73b (sqrt(x+1)+sqrt(4x+4)=sqrt(9x+9))";
wneuper@59264	1415	------------------------------------------------------------------------------
wneuper@59264	1416	1. "sqrt (x + 1) + sqrt (4 * x + 4) = sqrt (9 * x + 9)"
wneuper@59264	1417	...
wneuper@59264	1418	6. "13 + 13 * x + -2 * sqrt ((4 + 4 * x) * (9 + 9 * x)) = 1 + x"
wneuper@59489	1419	Subproblem["sq", "rootX", "univariate", "equation"]
wneuper@59264	1420	...
walther@60242	1421	6.6. "144 + 288 * x + 144 * x \<up> 2 = 144 + x \<up> 2 + 288 * x + 143 * x \<up> 2"
wneuper@59367	1422	Subproblem["normalise", "polynomial", "univariate", "equation"]
walther@60242	1423	...6.6.3 "0 = 0" Subproblem["degree_0", "polynomial", "univariate", "equation"]
wneuper@59264	1424	... Or_to_List
wneuper@59264	1425	6.6.3.2 "UniversalList"
wneuper@59264	1426	------------------------------------------------------------------------------
wneuper@59264	1427	(1)..(6): keine 'richtige' Eingabe kann abgeleitet werden, die eine der Wurzeln auf die andere Seite verschieb [Ableitung ware in 6.6.n]
wneuper@59264	1428
wneuper@59264	1429	(6.1)..(6.3): keine 'richtige' Eingabe kann abgeleitet werden, die einen Summanden auf die andere Seite verschiebt [Ableitung ware in 6.6.n]
wneuper@59264	1430	------------------------------------------------------------------------------
wneuper@59264	1431	*)
wneuper@59264	1432	(sh. comments auf 498)
wneuper@59264	1433	"--------- fun dropwhile' ----------------------------------------";
wneuper@59264	1434	"--------- fun dropwhile' ----------------------------------------";
wneuper@59264	1435	"--------- fun dropwhile' ----------------------------------------";
wneuper@59264	1436	(*
wneuper@59264	1437	fun equal a b = a=b;
wneuper@59264	1438	val foder = [0,1,2,3,4,5]; val ifoder = [11,12,3,4,5];
wneuper@59264	1439	val r_foder = rev foder; val r_ifoder = rev ifoder;
wneuper@59264	1440	dropwhile' equal r_foder r_ifoder;
wneuper@59264	1441	> vval it = ([0, 1, 2, 3], [3, 12, 11]) : int list * int list
wneuper@59264	1442
wneuper@59264	1443	val foder = [3,4,5]; val ifoder = [11,12,3,4,5];
wneuper@59264	1444	val r_foder = rev foder; val r_ifoder = rev ifoder;
wneuper@59264	1445	dropwhile' equal r_foder r_ifoder;
wneuper@59264	1446	> val it = ([3], [3, 12, 11]) : int list * int list
wneuper@59264	1447
wneuper@59264	1448	val foder = [5]; val ifoder = [11,12,3,4,5];
wneuper@59264	1449	val r_foder = rev foder; val r_ifoder = rev ifoder;
wneuper@59264	1450	dropwhile' equal r_foder r_ifoder;
wneuper@59264	1451	> val it = ([5], [5, 4, 3, 12, 11]) : int list * int list
wneuper@59264	1452
wneuper@59264	1453	val foder = [10,11,12,13,14,15]; val ifoder = [11,12,3,4,5];
wneuper@59264	1454	val r_foder = rev foder; val r_ifoder = rev ifoder;
wneuper@59264	1455	dropwhile' equal r_foder r_ifoder;
wneuper@59264	1456	> *** dropwhile': did not start with equal elements*)

author	wneuper <Walther.Neuper@jku.at>
	Wed, 11 Jan 2023 11:38:01 +0100
changeset 60650	06ec8abfd3bc
parent 60648	976b99bcfc96
child 60658	1c089105f581
permissions	-rw-r--r--