/*  This is a proof plan for theorem:
    halfdouble: []==>n:pnat=>half(double(n))=n in pnat
    planner = dplan, clam_version(2.7.0), oyster_version(1.20)

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

/* This is the pretty-printed form
ind_strat([(n:pnat)-s(v0)])

*/

proof_plan([]==>n:pnat=>half(double(n))=n in pnat,halfdouble,410,ind_strat(induction(lemma(pnat_primitive)-[(n:pnat)-s(v0)])then[base_case(sym_eval(normalize_term([reduction([1,1,1],[double1,equ(pnat,left)]),reduction([1,1],[half1,equ(pnat,left)])]))then[elementary(identity)]),step_case(ripple(direction_out,wave(direction_out,[1,1,1],[double2,equ(pnat,left)],[])then[wave(direction_out,[1,1],[half3,equ(pnat,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],v1)]))then elementary(identity)))])]),dplan).
