/*  This is a proof plan for theorem:
    memunion2: []==>x:int=>a:int list=>b:int list=>member(x,b)=>member(x,union(a,b))
    planner = dplan, clam_version(2.7.0), oyster_version(1.20)

    Time taken to find plan: 900ms
    Environment:
    []
 */

/* This is the pretty-printed form
ind_strat([(a:int list)-v1::v0]) then 
  base_case(...)

*/

proof_plan([]==>x:int=>a:int list=>b:int list=>member(x,b)=>member(x,union(a,b)),memunion2,900,ind_strat(induction(lemma(list_primitive)-[(a:int list)-v1::v0])then[base_case(sym_eval(normalize_term([reduction([2,2],[union1,equ(int list,left)])]))then[elementary(intro(new[x])then[intro(new[b])then[intro(new[v0])then[hyp(v0),wfftacs],wfftacs],wfftacs])]),step_case(ripple(direction_out,casesplit(disjunction([member(v1,b)=>void,member(v1,b)]))then[wave(direction_out,[2,2],[union4,equ(int list,left)],[])then[casesplit(disjunction([x=v1 in int=>void,x=v1 in int]))then[wave(direction_out,[2],[member3,equ(u(1),left)],[]),wave(direction_out,[2],[member2,complementary,equ(u(1),left)],[])]],wave(direction_out,[2,2],[union3,equ(int list,left)],[])])then[unblock_then_fertilize(strong,unblock_fertilize_lazy([idtac])then fertilize(strong,v2)),idtac,unblock_then_fertilize(strong,unblock_fertilize_lazy([idtac])then fertilize(strong,v2))])])then[base_case(elementary(intro(new[v5])then[istrue,wfftacs]))],dplan).
