/*  This is a proof plan for theorem:
    leqsucc: []==>x:pnat=>leq(x,s(x))
    planner = dplan, clam_version(2.7.0), oyster_version(1.20)

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

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

*/

proof_plan([]==>x:pnat=>leq(x,s(x)),leqsucc,170,ind_strat(induction(lemma(pnat_primitive)-[(x:pnat)-s(v0)])then[base_case(sym_eval(normalize_term([reduction([],[leq1,equ(u(1),left)])]))then[elementary(istrue)]),step_case(ripple(direction_out,unblock_then_wave(direction_out,unblock_lazy([unblock(meta_ripple,unused,unused),idtac])then wave(direction_out,[],[leq3,equ(u(1),left)],[])))then[unblock_then_fertilize(strong,unblock_fertilize_lazy([idtac])then fertilize(strong,v1))])]),dplan).
