neuper@42394
|
1 |
(* Title: Test for rational equations
|
neuper@42394
|
2 |
Author: Richard Lang 2009
|
neuper@42394
|
3 |
(c) copyright due to lincense terms.
|
neuper@42394
|
4 |
*)
|
neuper@37906
|
5 |
|
neuper@42394
|
6 |
"-----------------------------------------------------------------";
|
neuper@42394
|
7 |
"table of contents -----------------------------------------------";
|
neuper@42394
|
8 |
"-----------------------------------------------------------------";
|
neuper@42394
|
9 |
"------------ pbl: rational, univariate, equation ----------------";
|
neuper@42394
|
10 |
"------------ solve (1/x = 5, x) by me ---------------------------";
|
neuper@42394
|
11 |
"------------ S.68, Bsp.: 40, ((x)/(x - 8) + (x - 8)/(x) = 26/5)--";
|
neuper@42394
|
12 |
"------------ x / (x ^ 2 - 6 * x + 9) - 1 / (x ^ 2 - 3 * x) = 1 /x";
|
neuper@42394
|
13 |
"-----------------------------------------------------------------";
|
neuper@42394
|
14 |
"-----------------------------------------------------------------";
|
neuper@37906
|
15 |
|
neuper@42394
|
16 |
val thy = @{theory "RatEq"};
|
neuper@42394
|
17 |
val ctxt = ProofContext.init_global thy;
|
neuper@37906
|
18 |
|
neuper@42394
|
19 |
"------------ pbl: rational, univariate, equation ----------------";
|
neuper@42394
|
20 |
"------------ pbl: rational, univariate, equation ----------------";
|
neuper@42394
|
21 |
"------------ pbl: rational, univariate, equation ----------------";
|
neuper@42394
|
22 |
val t = (term_of o the o (parse thy)) "(1/b+1/x=1) is_ratequation_in x";
|
neuper@42394
|
23 |
val SOME (t_, _) = rewrite_set_ thy false RatEq_prls t;
|
neuper@42394
|
24 |
val result = term2str t_;
|
neuper@42394
|
25 |
if result <> "True" then error "rateq.sml: new behaviour 1:" else ();
|
neuper@41943
|
26 |
|
neuper@42394
|
27 |
val t = (term_of o the o (parse thy)) "(sqrt(x)=1) is_ratequation_in x";
|
neuper@42394
|
28 |
val SOME (t_, _) = rewrite_set_ thy false RatEq_prls t;
|
neuper@37906
|
29 |
val result = term2str t_;
|
neuper@42394
|
30 |
if result <> "False" then error "rateq.sml: new behaviour 2:" else ();
|
neuper@37906
|
31 |
|
neuper@42394
|
32 |
val t = (term_of o the o (parse thy)) "(x=-1) is_ratequation_in x";
|
neuper@42394
|
33 |
val SOME (t_,_) = rewrite_set_ thy false RatEq_prls t;
|
neuper@37906
|
34 |
val result = term2str t_;
|
neuper@42394
|
35 |
if result <> "False" then error "rateq.sml: new behaviour 3:" else ();
|
neuper@37906
|
36 |
|
neuper@42394
|
37 |
val t = (term_of o the o (parse thy)) "(3 + x^^^2 + 1/(x^^^2+3)=1) is_ratequation_in x";
|
neuper@42394
|
38 |
val SOME (t_,_) = rewrite_set_ thy false RatEq_prls t;
|
neuper@37906
|
39 |
val result = term2str t_;
|
neuper@42394
|
40 |
if result <> "True" then error "rateq.sml: new behaviour 4:" else ();
|
neuper@37906
|
41 |
|
neuper@42394
|
42 |
val result = match_pbl ["equality (x=(1::real))","solveFor x","solutions L"]
|
neuper@42394
|
43 |
(get_pbt ["rational","univariate","equation"]);
|
neuper@38031
|
44 |
case result of NoMatch' _ => () | _ => error "rateq.sml: new behaviour: 5";
|
neuper@37906
|
45 |
|
neuper@37906
|
46 |
val result = match_pbl ["equality (3 + x^^^2 + 1/(x^^^2+3)=1)","solveFor x","solutions L"]
|
neuper@42394
|
47 |
(get_pbt ["rational","univariate","equation"]);
|
neuper@38031
|
48 |
case result of Matches' _ => () | _ => error "rateq.sml: new behaviour: 6";
|
neuper@37906
|
49 |
|
neuper@42394
|
50 |
"------------ solve (1/x = 5, x) by me ---------------------------";
|
neuper@42394
|
51 |
"------------ solve (1/x = 5, x) by me ---------------------------";
|
neuper@42394
|
52 |
"------------ solve (1/x = 5, x) by me ---------------------------";
|
neuper@42394
|
53 |
val fmz = ["equality (1/x=(5::real))","solveFor x","solutions L"];
|
neuper@37991
|
54 |
val (dI',pI',mI') = ("RatEq",["univariate","equation"],["no_met"]);
|
neuper@37906
|
55 |
val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
|
neuper@42394
|
56 |
(* val (p,_,f,nxt,_,pt) = me nxt p [1] pt;------------- now Refine_Tacitly*)
|
neuper@37906
|
57 |
(* nxt = ("Model_Problem",Model_Problem ["rational","univariate","equation"]) *)
|
neuper@37906
|
58 |
val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
|
neuper@37906
|
59 |
val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
|
neuper@37906
|
60 |
val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
|
neuper@37906
|
61 |
val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
|
neuper@42394
|
62 |
|
neuper@42394
|
63 |
nxt = ("Rewrite_Set", Rewrite_Set "RatEq_eliminate");
|
neuper@37906
|
64 |
val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
|
neuper@42394
|
65 |
(*
|
neuper@42394
|
66 |
WN120317.TODO dropped rateq: here "x ~= 0 should go to ctxt, but it does not:
|
neuper@42394
|
67 |
--- repair NO asms from rls RatEq_eliminate --- shows why.
|
neuper@42394
|
68 |
so it needs more effort to find out, how Check_elementwise worked in 2002, see below.
|
neuper@42394
|
69 |
*)
|
neuper@42394
|
70 |
|
neuper@42394
|
71 |
(* val nxt = (_,Subproblem ("RatEq",["univariate","equation"] ======= *)
|
neuper@37906
|
72 |
val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
|
neuper@42394
|
73 |
(* val (p,_,f,nxt,_,pt) = me nxt p [1] pt;------------- now Refine_Tacitly*)
|
neuper@37906
|
74 |
(*val nxt = ("Model_Problem", Model_Problem ["normalize","polynomial","univariate","equation"])*)
|
neuper@37906
|
75 |
val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
|
neuper@37906
|
76 |
val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
|
neuper@37906
|
77 |
val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
|
neuper@37906
|
78 |
val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
|
neuper@37906
|
79 |
(*val nxt = Apply_Method ["PolyEq", "normalize_poly"])*)
|
neuper@37906
|
80 |
val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
|
neuper@37906
|
81 |
val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
|
neuper@42394
|
82 |
(* val nxt = (_,Subproblem ("PolyEq",["polynomial","univariate","equation"]=======*)
|
neuper@37906
|
83 |
val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
|
neuper@37906
|
84 |
val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
|
neuper@37906
|
85 |
(* ("Model_Problem", Model_Problem ["degree_1","polynomial","univariate","equation"])*)
|
neuper@37906
|
86 |
val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
|
neuper@37906
|
87 |
val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
|
neuper@37906
|
88 |
val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
|
neuper@37906
|
89 |
val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
|
neuper@37906
|
90 |
val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
|
neuper@37906
|
91 |
val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
|
neuper@42394
|
92 |
val (p''',_,f,nxt''',_,pt''') = me nxt p [1] pt;
|
neuper@42394
|
93 |
f2str f = "[x = 1 / 5]";
|
neuper@42394
|
94 |
nxt = ("Check_elementwise", Check_elementwise "Assumptions");
|
neuper@42394
|
95 |
"~~~~~ fun me, args:"; val (((_,tac):tac'_), (p:pos'), _, (pt:ptree)) = (nxt, p, c, pt);
|
neuper@42394
|
96 |
val (pt, p) = case locatetac tac (pt,p) of
|
neuper@42394
|
97 |
("ok", (_, _, ptp)) => ptp | _ => error "--- solve (1/x = 5.. locatetac";
|
neuper@42394
|
98 |
"~~~~~ fun step, args:"; val (ip as (_,p_), (ptp as (pt,p), tacis)) = (p, ((pt, e_pos'), []))
|
neuper@42394
|
99 |
val pIopt = get_pblID (pt,ip); (*= SOME ["rational", "univariate", "equation"]
|
neuper@42394
|
100 |
1-1 associated to metID ["RatEq", "solve_rat_equation"]*)
|
neuper@42394
|
101 |
tacis; (*= []*)
|
neuper@42394
|
102 |
member op = [Pbl,Met] p_ andalso is_none (get_obj g_env pt (fst p)); (*= false*)
|
neuper@42394
|
103 |
"~~~~~ fun nxt_solve_, args:"; val (ptp as (pt, pos as (p, p_))) = (pt, ip);
|
neuper@42394
|
104 |
val thy' = get_obj g_domID pt (par_pblobj pt p);
|
neuper@42394
|
105 |
val (srls, is, sc) = from_pblobj_or_detail' thy' (p,p_) pt; (*is: which ctxt?*)
|
neuper@42394
|
106 |
"~~~~~ fun next_tac, args:"; val (thy, (ptp as (pt, pos as (p, _)):ptree * pos'),
|
neuper@42394
|
107 |
(sc as Script (h $ body)),
|
neuper@42394
|
108 |
(ScrState (E,l,a,v,s,b), ctxt)) = ((thy',srls), (pt,pos), sc, is);
|
neuper@42394
|
109 |
"~~~~~ fun nstep_up, args:"; val (thy, ptp, (Script sc), E, l, ay, a, v) =
|
neuper@42394
|
110 |
(thy, ptp, sc, E, l, Skip_, a, v);
|
neuper@42394
|
111 |
1 < length l; (*true*)
|
neuper@42394
|
112 |
val up = drop_last l;
|
neuper@42394
|
113 |
go up sc; (* = Const ("HOL.Let", *)
|
neuper@42394
|
114 |
"~~~~~ fun nxt_up, args:"; val (thy, ptp, (scr as (Script sc)), E, l, ay,
|
neuper@42394
|
115 |
(t as Const ("HOL.Let",_) $ _), a, v) = (thy, ptp, (Script sc), E, up, ay, (go up sc), a, v);
|
neuper@42394
|
116 |
ay = Napp_; (*false*)
|
neuper@42394
|
117 |
val up = drop_last l;
|
neuper@42394
|
118 |
val (Const ("HOL.Let",_) $ e $ (Abs (i,T,body))) = go up sc; (*Const ("Script.SubProblem",..*)
|
neuper@42394
|
119 |
val i = mk_Free (i, T);
|
neuper@42394
|
120 |
val E = upd_env E (i, v);
|
neuper@42394
|
121 |
"~~~~~ fun appy, args:"; val ((thy as (th,sr)), (pt, p), E, l, t, a, v) =
|
neuper@42394
|
122 |
(thy, ptp, E, (up@[R,D]), body, a, v);
|
neuper@42394
|
123 |
"~~~~~ fun handle_leaf, args:"; val (call, thy, srls, E, a, v, t) = ("next ", th, sr, E, a, v, t);
|
neuper@42394
|
124 |
"~~~~~ fun subst_stacexpr, args:"; val (E, a, v,
|
neuper@42394
|
125 |
(t as (Const ("Script.Check'_elementwise",_) $ _ $ _ ))) = (E, a, v, t);
|
neuper@42394
|
126 |
val STac tm = STac (subst_atomic E t);
|
neuper@42394
|
127 |
term2str tm = "Check_elementwise [x = 1 / 5] {v_v. Assumptions}";
|
neuper@42394
|
128 |
(* ------ ^^^ ----- ? "x" ?*)
|
neuper@42394
|
129 |
"~~~~~ to handle_leaf return val:"; val ((a', STac stac)) = ((NONE, STac (subst_atomic E t)));
|
neuper@42394
|
130 |
val stac' = eval_listexpr_ (assoc_thy thy) srls (subst_atomic (upd_env_opt E (a,v)) stac);
|
neuper@42394
|
131 |
term2str stac' = "Check_elementwise [x = 1 / 5] {v_v. Assumptions}";
|
neuper@42394
|
132 |
"~~~~~ to appy return val:"; val ((a', STac stac)) = ((a', STac stac'));
|
neuper@42394
|
133 |
val (m,m') = stac2tac_ pt (assoc_thy th) stac;
|
neuper@42394
|
134 |
m = Check_elementwise "Assumptions"; (*m' = Empty_Tac_ ???!??? *);
|
neuper@42394
|
135 |
val (p''''', pt''''', m''''') = (p, pt, m);
|
neuper@42394
|
136 |
"~~~~~ fun applicable_in, args:"; val ((p,p_), pt, (m as Check_elementwise pred)) = (p, pt, m);
|
neuper@42394
|
137 |
member op = [Pbl,Met] p_; (* = false*)
|
neuper@42394
|
138 |
val pp = par_pblobj pt p;
|
neuper@42394
|
139 |
val thy' = (get_obj g_domID pt pp):theory';
|
neuper@42394
|
140 |
val thy = assoc_thy thy'
|
neuper@42394
|
141 |
val metID = (get_obj g_metID pt pp)
|
neuper@42394
|
142 |
val {crls,...} = get_met metID
|
neuper@42394
|
143 |
val (f,asm) = case p_ of Frm => (get_obj g_form pt p , [])
|
neuper@42394
|
144 |
| Res => get_obj g_result pt p;
|
neuper@42394
|
145 |
term2str f = "[x = 1 / 5]"; (*the current formula*)
|
neuper@42394
|
146 |
val vp = (thy2ctxt thy, pred) |-> parseNEW |> the |> mk_set thy pt p f;
|
neuper@42394
|
147 |
val (bdv, asms) = vp;
|
neuper@42394
|
148 |
|
neuper@42394
|
149 |
term2str bdv = "x";
|
neuper@42394
|
150 |
terms2str asms = (* GOON: asms from rewriting are missing : vvv *)
|
neuper@42394
|
151 |
("[\"~ matches (?a = 0) (1 = 5 * x) | ~ lhs (1 = 5 * x) is_poly_in x\",\"x = 1 / 5\"," ^
|
neuper@42394
|
152 |
"\"lhs (1 + -5 * x = 0) is_poly_in x\",\"lhs (1 + -5 * x = 0) has_degree_in x = 1\"," ^
|
neuper@42394
|
153 |
"\"1 / x = 5 is_ratequation_in x\"]");
|
neuper@42394
|
154 |
(*
|
neuper@42394
|
155 |
WN120317.TODO dropped rateq: ctxt should contain "x ~= 0 here, but it does not, see above.
|
neuper@42394
|
156 |
*)
|
neuper@42394
|
157 |
|
neuper@42394
|
158 |
val Appl (Check_elementwise' (curr_form, pred, (res, asms))) = applicable_in p''''' pt''''' m''''';
|
neuper@42394
|
159 |
term2str curr_form = "[x = 1 / 5]";
|
neuper@42394
|
160 |
pred = "Assumptions";
|
neuper@42394
|
161 |
res = str2term "[]::bool list";
|
neuper@42394
|
162 |
asms = [];
|
neuper@42394
|
163 |
|
neuper@42394
|
164 |
val (p,_,f,nxt,_,pt) = me nxt''' p''' [] pt'''; (*<<<----- this caused the error*)
|
neuper@42394
|
165 |
f2str f = "[]";
|
neuper@37906
|
166 |
val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
|
neuper@42394
|
167 |
|
neuper@42394
|
168 |
(*============ inhibit exn WN120316 ==============================================
|
neuper@42394
|
169 |
if p = ([], Res) andalso nxt = ("End_Proof'", End_Proof') andalso f2str f = "[x = 1 / 5]" then ()
|
neuper@42394
|
170 |
else error "rateq.sml: new behaviour: [x = 1 / 5]";
|
neuper@42394
|
171 |
(*WN120317.TODO dropped rateq*)
|
neuper@42394
|
172 |
============ inhibit exn WN120316 ==============================================*)
|
neuper@42394
|
173 |
if p = ([], Res) andalso nxt = ("End_Proof'", End_Proof') andalso f2str f = "[]" then ()
|
neuper@38031
|
174 |
else error "rateq.sml: new behaviour: [x = 1 / 5]";
|
neuper@37906
|
175 |
|
neuper@42394
|
176 |
"------------ S.68, Bsp.: 40, ((x)/(x - 8) + (x - 8)/(x) = 26/5)--";
|
neuper@42394
|
177 |
"------------ S.68, Bsp.: 40, ((x)/(x - 8) + (x - 8)/(x) = 26/5)--";
|
neuper@42394
|
178 |
"------------ S.68, Bsp.: 40, ((x)/(x - 8) + (x - 8)/(x) = 26/5)--";
|
neuper@37906
|
179 |
(*EP Schalk_II_p68_n40*)
|
neuper@42394
|
180 |
val fmz = ["equality ((x)/(x - 8) + (x - 8)/(x) = 26/(5::real))","solveFor x","solutions L"];
|
neuper@37991
|
181 |
val (dI',pI',mI') = ("RatEq",["univariate","equation"],["no_met"]);
|
neuper@37906
|
182 |
val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
|
neuper@37906
|
183 |
val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
|
neuper@37906
|
184 |
(* nxt = ("Model_Problem",Model_Problem ["rational","univariate","equation"])*)
|
neuper@37906
|
185 |
val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
|
neuper@37906
|
186 |
val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
|
neuper@37906
|
187 |
val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
|
neuper@37906
|
188 |
val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
|
neuper@37906
|
189 |
val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
|
neuper@37906
|
190 |
val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
|
neuper@37991
|
191 |
(* nxt = ("Subproblem",Subproblem ("RatEq",["univariate","equation"]))*)
|
neuper@37906
|
192 |
val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
|
neuper@37906
|
193 |
(* nxt = ("Model_Problem", Model_Problem ["normalize","polynomial","univariate","equation"])*)
|
neuper@37906
|
194 |
val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
|
neuper@37906
|
195 |
val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
|
neuper@37906
|
196 |
val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
|
neuper@37906
|
197 |
val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
|
neuper@37906
|
198 |
val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
|
neuper@37906
|
199 |
val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
|
neuper@37991
|
200 |
(* ("Subproblem", Subproblem ("PolyEq",["polynomial","univariate","equation"])) *)
|
neuper@37906
|
201 |
val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
|
neuper@37906
|
202 |
(* nxt = ("Model_Problem", Model_Problem
|
neuper@37906
|
203 |
["abcFormula","degree_2","polynomial","univariate","equation"])*)
|
neuper@37906
|
204 |
val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
|
neuper@37906
|
205 |
val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
|
neuper@37906
|
206 |
val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
|
neuper@37906
|
207 |
val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
|
neuper@37906
|
208 |
val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
|
neuper@37906
|
209 |
val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
|
neuper@37906
|
210 |
val (p,_,f,nxt,_,pt) = me nxt p [1] pt;val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
|
neuper@42394
|
211 |
(*============ inhibit exn WN120316 ==============================================
|
neuper@37906
|
212 |
if mout2str(f) = "Form' FormKF (~1,EdUndef,0,Nundef,([x = -2, x = 10])" then()
|
neuper@38031
|
213 |
else error "rateq.sml: new behaviour: [x = -2, x = 10]";
|
neuper@42394
|
214 |
(*WN120317.TODO dropped rateq*)
|
neuper@42394
|
215 |
============ inhibit exn WN120316 ==============================================*)
|
neuper@42394
|
216 |
if f2str f = "[]" then ()
|
neuper@42394
|
217 |
else error "rateq.sml: new behaviour: [x = -2, x = 10]";
|
neuper@37906
|
218 |
|
neuper@42394
|
219 |
"------------ x / (x ^ 2 - 6 * x + 9) - 1 / (x ^ 2 - 3 * x) = 1 /x";
|
neuper@42394
|
220 |
"------------ x / (x ^ 2 - 6 * x + 9) - 1 / (x ^ 2 - 3 * x) = 1 /x";
|
neuper@42394
|
221 |
"------------ x / (x ^ 2 - 6 * x + 9) - 1 / (x ^ 2 - 3 * x) = 1 /x";
|
neuper@42394
|
222 |
(*ER-7*) (*Schalk I s.87 Bsp 55b*)
|
neuper@42394
|
223 |
val fmz = ["equality (x/(x^^^2 - 6*x+9) - 1/(x^^^2 - 3*x) =1/x)",
|
neuper@42394
|
224 |
"solveFor x","solutions L"];
|
neuper@42394
|
225 |
val (dI',pI',mI') = ("RatEq",["univariate","equation"],["no_met"]);
|
neuper@42394
|
226 |
val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
|
neuper@42394
|
227 |
val (p,_,f,nxt,_,pt) = me nxt p [1] pt; val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
|
neuper@42394
|
228 |
val (p,_,f,nxt,_,pt) = me nxt p [1] pt; val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
|
neuper@42394
|
229 |
val (p,_,f,nxt,_,pt) = me nxt p [1] pt; val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
|
neuper@42394
|
230 |
val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
|
neuper@42394
|
231 |
if nxt = ("Apply_Method", Apply_Method ["RatEq", "solve_rat_equation"]) then ()
|
neuper@42394
|
232 |
else error "55b root specification broken";
|
neuper@42394
|
233 |
val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
|
neuper@42394
|
234 |
val (p,_,f,nxt,_,pt) = me nxt p [1] pt; val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
|
neuper@42394
|
235 |
val (p,_,f,nxt,_,pt) = me nxt p [1] pt; val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
|
neuper@42394
|
236 |
val (p,_,f,nxt,_,pt) = me nxt p [1] pt; val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
|
neuper@42394
|
237 |
val (p,_,f,nxt,_,pt) = me nxt p [1] pt; val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
|
neuper@42394
|
238 |
val (p,_,f,nxt,_,pt) = me nxt p [1] pt; val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
|
neuper@42394
|
239 |
val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
|
neuper@42394
|
240 |
if nxt = ("Apply_Method", Apply_Method ["PolyEq", "normalize_poly"]) then ()
|
neuper@42394
|
241 |
else error "55b normalize_poly specification broken";
|
neuper@42394
|
242 |
val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
|
neuper@42394
|
243 |
val (p,_,f,nxt,_,pt) = me nxt p [1] pt; val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
|
neuper@42394
|
244 |
val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
|
neuper@42394
|
245 |
if f= Form' (FormKF (~1, EdUndef, 0, Nundef, "-6 * x + 5 * x ^^^ 2 = 0")) then()
|
neuper@42394
|
246 |
else error "rlang.sml: diff.behav. in Schalk I s.87 Bsp 55b";
|
neuper@42394
|
247 |
val (p,_,f,nxt,_,pt) = me nxt p [1] pt; val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
|
neuper@42394
|
248 |
val (p,_,f,nxt,_,pt) = me nxt p [1] pt; val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
|
neuper@42394
|
249 |
val (p,_,f,nxt,_,pt) = me nxt p [1] pt; val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
|
neuper@42394
|
250 |
val (p,_,f,nxt,_,pt) = me nxt p [1] pt; val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
|
neuper@42394
|
251 |
if nxt = ("Apply_Method", Apply_Method ["PolyEq", "solve_d2_polyeq_bdvonly_equation"]) then ()
|
neuper@42394
|
252 |
else error "55b normalize_poly specification broken";
|
neuper@42394
|
253 |
val (p,_,f,nxt,_,pt) = me nxt p [1] pt; val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
|
neuper@42394
|
254 |
val (p,_,f,nxt,_,pt) = me nxt p [1] pt; val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
|
neuper@42394
|
255 |
val (p,_,f,nxt,_,pt) = me nxt p [1] pt; val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
|
neuper@42394
|
256 |
val (p,_,f,nxt,_,pt) = me nxt p [1] pt; val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
|
neuper@41943
|
257 |
|
neuper@42394
|
258 |
f2str f = "[x = 0, x = 6 / 5]"; (*= GUI*)
|
neuper@42394
|
259 |
snd nxt = Check_elementwise "Assumptions"; (*= GUI*)
|
neuper@42394
|
260 |
if terms2str (get_assumptions_ pt p) =
|
neuper@42394
|
261 |
("[\"~ matches (?a = 0)\n" ^
|
neuper@42394
|
262 |
" ((3 + -1 * x + x ^^^ 2) * x = 1 * (9 * x + -6 * x ^^^ 2 + x ^^^ 3)) |\n" ^
|
neuper@42394
|
263 |
"~ lhs ((3 + -1 * x + x ^^^ 2) * x =\n " ^
|
neuper@42394
|
264 |
" 1 * (9 * x + -6 * x ^^^ 2 + x ^^^ 3)) is_poly_in x\"," ^
|
neuper@42394
|
265 |
"\"x = 6 / 5\"," ^
|
neuper@42394
|
266 |
"\"x = 0\"," ^
|
neuper@42394
|
267 |
"\"lhs (-6 * x + 5 * x ^^^ 2 = 0) is_poly_in x\"," ^
|
neuper@42394
|
268 |
"\"lhs (-6 * x + 5 * x ^^^ 2 = 0) has_degree_in x = 2\"," ^
|
neuper@42394
|
269 |
"\"9 * x + -6 * x ^^^ 2 + x ^^^ 3 ~= 0\"," ^
|
neuper@42394
|
270 |
"\"x / (x ^^^ 2 - 6 * x + 9) - 1 / (x ^^^ 2 - 3 * x) =\n1 / x is_ratequation_in x\"]")
|
neuper@42394
|
271 |
then () else error "rateq.sml: diff.behav. in I s.87 Bsp 55b [x = 6 / 5], asms";
|
neuper@42394
|
272 |
|
neuper@42394
|
273 |
(*
|
neuper@42394
|
274 |
WN120317.TODO dropped rateq: ctxt should contain "x ~= 0 here, but it does not.
|
neuper@42394
|
275 |
|
neuper@42394
|
276 |
The step-into-source contains an error; this error can be detected by
|
neuper@42394
|
277 |
test --- 'trace_script' from outside 'fun me '---
|
neuper@42394
|
278 |
*)
|
neuper@42394
|
279 |
val (pt''', p''') = (pt, p);
|
neuper@42394
|
280 |
"~~~~~ fun me, args:"; val (((_,tac):tac'_), (p:pos'), _, (pt:ptree)) = (nxt, p, c, pt);
|
neuper@42394
|
281 |
val (pt, p) = case locatetac tac (pt,p) of
|
neuper@42394
|
282 |
("ok", (_, _, ptp)) => ptp | _ => error "error in test setup";
|
neuper@42394
|
283 |
"~~~~~ step, args:"; val (((ip as (_,p_)):pos'), ((ptp as (pt,p), tacis):calcstate)) =
|
neuper@42394
|
284 |
(p, ((pt, e_pos'),[]));
|
neuper@42394
|
285 |
val pIopt = get_pblID (pt,ip);
|
neuper@42394
|
286 |
ip = ([],Res); (* = false*)
|
neuper@42394
|
287 |
tacis; (* = []*)
|
neuper@42394
|
288 |
member op = [Pbl,Met] p_ andalso is_none (get_obj g_env pt (fst p)); (* = false*)
|
neuper@42394
|
289 |
"~~~~~ and nxt_solve_, args:"; val ((ptp as (pt, pos as (p,p_)))) = ((pt,ip));
|
neuper@42394
|
290 |
e_metID = get_obj g_metID pt (par_pblobj pt p); (* = false*)
|
neuper@42394
|
291 |
val thy' = get_obj g_domID pt (par_pblobj pt p);
|
neuper@42394
|
292 |
val (srls, is, sc) = from_pblobj_or_detail' thy' (p,p_) pt;
|
neuper@42394
|
293 |
"~~~~~ fun next_tac, args:"; val (thy, (ptp as (pt, pos as (p, _)):ptree * pos'),
|
neuper@42394
|
294 |
(sc as Script (h $ body)), (ScrState (E,l,a,v,s,b), ctxt)) = ((thy',srls), (pt,pos), sc, is);
|
neuper@42394
|
295 |
l = []; (* = false*)
|
neuper@42394
|
296 |
"~~~~~ and nstep_up, args:"; val (thy, ptp, (Script sc), E, l, ay, a, v) =
|
neuper@42394
|
297 |
(thy, ptp, sc, E, l, Skip_, a, v);
|
neuper@42394
|
298 |
1 < length l; (* = true*)
|
neuper@42394
|
299 |
val up = drop_last l;
|
neuper@42394
|
300 |
(*val (t as Abs (_,_,_)) = *)(go up sc);
|
neuper@42394
|
301 |
"~~~~~ fun nxt_up, args:"; val (thy, ptp, scr, E, l, ay, (t as Abs (_,_,_)), a, v) =
|
neuper@42394
|
302 |
(thy, ptp, (Script sc), E, up, ay, (go up sc), a, v);
|
neuper@42394
|
303 |
term2str t = "%L_La. Check_elementwise L_L {v_v. Assumptions}";
|
neuper@42394
|
304 |
"~~~~~ and nstep_up, args:"; val (thy, ptp, (Script sc), E, l, ay, a, v) =
|
neuper@42394
|
305 |
(thy, ptp, scr, E, l, ay, a, v);
|
neuper@42394
|
306 |
1 < length l; (* = true*)
|
neuper@42394
|
307 |
val up = drop_last l;
|
neuper@42394
|
308 |
(*val (t as Const ("HOL.Let",_) $ e $ (Abs (i,T,b))) = *)(go up sc);
|
neuper@42394
|
309 |
"~~~~~ fun nxt_up, args:"; val (thy, ptp, scr, E, l, ay,
|
neuper@42394
|
310 |
(t as Const ("HOL.Let",_) $ e $ (Abs (i,T,b))), a, v) = (thy, ptp, (Script sc), E, up, ay, (go up sc), a, v);
|
neuper@42394
|
311 |
|
neuper@42394
|
312 |
term2str t = "let L_La =\n SubProblem (RatEq', [univariate, equation], [no_met])\n [BOOL e_e, REAL v_v]\nin Check_elementwise L_L {v_v. Assumptions}";
|
neuper@42394
|
313 |
|
neuper@42394
|
314 |
(* comment from BEFORE Isabelle2002 --> 2011:
|
neuper@42394
|
315 |
nxt_up thy ptp (Script sc) E up ay (go up sc) a v;
|
neuper@42394
|
316 |
nstep_up thy ptp scr E l ay a v;
|
neuper@42394
|
317 |
nxt_up thy ptp (Script sc) E up ay (go up sc) a v;
|
neuper@42394
|
318 |
nstep_up thy ptp sc E l Skip_ a v;
|
neuper@42394
|
319 |
next_tac (thy',srls) (pt,pos) sc is;
|
neuper@42394
|
320 |
nxt_solve_ (pt,ip);
|
neuper@42394
|
321 |
step p ((pt, e_pos'),[]);
|
neuper@42394
|
322 |
*)
|
neuper@42394
|
323 |
val (p,_,f,nxt,_,pt) = me nxt p''' [1] pt''';
|
neuper@42394
|
324 |
val (p,_,f,nxt,_,pt) = me nxt p [1] pt;
|
neuper@42394
|
325 |
|
neuper@42394
|
326 |
(*============ inhibit exn WN120316 ==============================================
|
neuper@42394
|
327 |
if p = ([], Res) andalso nxt = ("End_Proof'", End_Proof') andalso f2str f = [x = 6 / 5] then ()
|
neuper@42394
|
328 |
else error "rlang.sml: diff.behav. in Schalk I s.87 Bsp 55b [x = 6 / 5]";
|
neuper@42394
|
329 |
(*WN120317.TODO dropped rateq*)
|
neuper@42394
|
330 |
============ inhibit exn WN120316 ==============================================*)
|
neuper@42394
|
331 |
if p = ([], Res) andalso nxt = ("End_Proof'", End_Proof') andalso f2str f = "[]" then ()
|
neuper@42394
|
332 |
else error "rlang.sml: diff.behav. in Schalk I s.87 Bsp 55b [x = 6 / 5]";
|
neuper@42394
|
333 |
|