/*  This is a proof plan for theorem:
    revqrev: []==>l:int list=>m:int list=>app(rev(l),m)=qrev(l,m)in int list
    planner = dplan, clam_version(2.7.0), oyster_version(1.20)

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

/* This is the pretty-printed form
ind_strat([(l:int list)-v1::v0])

*/

proof_plan([]==>l:int list=>m:int list=>app(rev(l),m)=qrev(l,m)in int list,revqrev,910,ind_strat(induction(lemma(list_primitive)-[(l:int list)-v1::v0])then[base_case(sym_eval(normalize_term([reduction([1,1,1],[rev1,equ(int list,left)]),reduction([1,1],[app1,equ(int list,left)]),reduction([2,1],[qrev1,equ(int list,left)])]))then[elementary(intro(new[m])then[identity,wfftacs])]),step_case(ripple(direction_out,wave(direction_out,[2,1],[qrev2,equ(int list,left)],[])then[wave(direction_out,[1,1,1],[rev2,equ(int list,left)],[])then[wave(direction_out,[1,1],[assapp,equ(int list,right)],[])]])then[unblock_then_fertilize(strong,unblock_fertilize_lazy([unblock(sink,[2,1,1],[app2,equ(int list,left)]),unblock(sink,[2,2,1,1],[app1,equ(int list,left)]),idtac])then fertilize(strong,v2))])]),dplan).
