/*  This is a proof plan for theorem:
    mapcarapp: []==>f:(int=>int)=>l1:int list=>l2:int list=>mapcar(app(l1,l2),f)=app(mapcar(l1,f),mapcar(l2,f))in int list
    planner = dplan, clam_version(2.7.0), oyster_version(1.20)

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

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

*/

proof_plan([]==>f:(int=>int)=>l1:int list=>l2:int list=>mapcar(app(l1,l2),f)=app(mapcar(l1,f),mapcar(l2,f))in int list,mapcarapp,1630,ind_strat(induction(lemma(list_primitive)-[(l1:int list)-v1::v0])then[base_case(sym_eval(normalize_term([reduction([1,1,1],[app1,equ(int list,left)]),reduction([1,2,1],[mapcar1,equ(int list,left)]),reduction([2,1],[app1,equ(int list,left)])]))then[elementary(intro(new[f])then[intro(new[l2])then[identity,wfftacs],wfftacs])]),step_case(ripple(direction_out,wave(direction_out,[1,2,1],[mapcar2,equ(int list,left)],[])then[wave(direction_out,[2,1],[app2,equ(int list,left)],[])then[wave(direction_out,[1,1,1],[app2,equ(int list,left)],[])then[wave(direction_out,[1,1],[mapcar2,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,[2],v2)]))then elementary(intro(new[f])then[intro(new[l2])then[identity,wfftacs],wfftacs])))])]),dplan).
