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

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

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

*/

proof_plan([]==>a:int list=>n:int=>rev(app(a,n::nil))=n::rev(a)in int list,tailrev,1270,ind_strat(induction(lemma(list_primitive)-[(a:int list)-v1::v0])then[base_case(sym_eval(normalize_term([reduction([1,1,1],[app1,equ(int list,left)]),reduction([1,1],[rev2,equ(int list,left)]),reduction([1,1,1],[rev1,equ(int list,left)]),reduction([1,1],[app1,equ(int list,left)]),reduction([2,2,1],[rev1,equ(int list,left)])]))then[elementary(intro(new[n])then[identity,wfftacs])]),step_case(ripple(direction_out,wave(direction_out,[2,2,1],[rev2,equ(int list,left)],[])then[wave(direction_out,[2,1],[app2,equ(int list,right)],[])then[wave(direction_out,[1,1,1],[app2,equ(int list,left)],[])then[wave(direction_out,[1,1],[rev2,equ(int list,left)],[])]]])then[unblock_then_fertilize(weak,unblock_fertilize_lazy([idtac])then fertilize(weak,fertilize_then_ripple(fertilize_left_or_right(right,[weak_fertilize(right,in,[1],v2)]))then elementary(intro(new[n])then[identity,wfftacs])))])]),dplan).
