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

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

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

*/

proof_plan([]==>x:int list=>app(x,nil)=x in int list,app1right,390,ind_strat(induction(lemma(list_primitive)-[(x:int list)-v1::v0])then[base_case(sym_eval(normalize_term([reduction([1,1],[app1,equ(int list,left)])]))then[elementary(identity)]),step_case(ripple(direction_out,wave(direction_out,[1,1],[app2,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(identity)))])]),dplan).
