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

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

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

*/

proof_plan([]==>x:int=>a:int list=>b:int list=>(member(x,a)#member(x,b))=>member(x,intersect(a,b)),memintersect,1850,ind_strat(induction(lemma(list_primitive)-[(a:int list)-v1::v0])then[base_case(sym_eval(normalize_term([reduction([1,1],[member1,equ(u(1),left)]),reduction([2,2],[intersect1,equ(int list,left)]),reduction([2],[member1,equ(u(1),left)])]))then[elementary(intro(new[x])then[intro(new[b])then[intro(new[v0])then[elim(v0)then hyp(v1),wfftacs],wfftacs],wfftacs])]),step_case(ripple(direction_out,casesplit(disjunction([member(v1,b)=>void,member(v1,b)]))then[wave(direction_out,[2,2],[intersect4,equ(int list,left)],[])then[casesplit(disjunction([x=v1 in int=>void,x=v1 in int]))then[wave(direction_out,[1,1],[member3,equ(u(1),left)],[]),wave(direction_out,[1,1],[member2,complementary,equ(u(1),left)],[])]],wave(direction_out,[2,2],[intersect3,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)],[])then[wave(direction_out,[1,1],[member3,equ(u(1),left)],[])],wave(direction_out,[2],[member2,complementary,equ(u(1),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)),idtac])])then[base_case(sym_eval(equal(v4,right))then[elementary(intro(new[v4])then[elim(v4)then elim(v3)then[hyp(v6),elim(v8)],wfftacs])]),base_case(elementary(intro(new[v5])then[istrue,wfftacs]))],dplan).
