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

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

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

*/

proof_plan([]==>x:int=>y:int list=>member(x,y)=>member(x,rev(y)),memrev,1380,ind_strat(induction(lemma(list_primitive)-[(y:int list)-v1::v0])then[base_case(sym_eval(normalize_term([reduction([1],[member1,equ(u(1),left)]),reduction([2,2],[rev1,equ(int list,left)]),reduction([2],[member1,equ(u(1),left)])]))then[elementary(intro(new[x])then[intro(new[v0])then[hyp(v0),wfftacs],wfftacs])]),step_case(ripple(direction_out,wave(direction_out,[2,2],[rev2,equ(int list,left)],[])then[wave(direction_out,[2],[memapp3,imp(right)],[])then[casesplit(disjunction([x=v1 in int=>void,x=v1 in int]))then[wave(direction_out,[1],[member3,equ(u(1),left)],[]),wave(direction_out,[1],[member2,complementary,equ(u(1),left)],[])]]])then[unblock_then_fertilize(weak,unblock_fertilize_lazy([idtac])then fertilize(weak,fertilize_then_ripple(fertilize_left_or_right(right,[weak_fertilize(right,=>,[1],v2)])then ripple_and_cancel([unblock(wave_front,[2,2],[member3,equ(u(1),left)]),unblock(wave_front,[2,2],[member1,equ(u(1),left)])]))then elementary(intro(new[v4])then[intro(left)then[hyp(v4),wfftacs],wfftacs]))),idtac])])then[base_case(sym_eval(equal(v3,right)then[normalize_term([reduction([2,2],[member2,equ(u(1),left)])])])then[elementary(intro(new[v3])then[intro(right)then[hyp(v3),wfftacs],wfftacs])])],dplan).
