/*  This is a proof plan for theorem:
    geqnotlessp: []==>x:pnat=>y:pnat=>geq(x,y)=>less(x,y)=>void
    planner = dplan, clam_version(2.7.0), oyster_version(1.20)

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

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

*/

proof_plan([]==>x:pnat=>y:pnat=>geq(x,y)=>less(x,y)=>void,geqnotlessp,260,ind_strat(induction(lemma(pairs)-[(x:pnat)-s(v1),(y:pnat)-s(v0)])then[base_case(sym_eval(normalize_term([reduction([1],[geqzero,equiv(left)]),reduction([1,2],[lesszero,equiv(left)])]))then[elementary(intro(new[v1])then[intro(new[v2])then[elim(v2)then[hyp(v1),hyp(v3)],wfftacs],wfftacs])]),base_case(sym_eval(normalize_term([reduction([1],[geq1,equ(u(1),left)]),reduction([1,2],[less1,equ(u(1),left)])]))then[elementary(intro(new[v1])then[intro(new[v2])then[hyp(v2),wfftacs],wfftacs])]),step_case(ripple(direction_out,wave(direction_out,[1],[geq3,equ(u(1),left)],[])then[wave(direction_out,[1,2],[less3,equ(u(1),left)],[])])then[unblock_then_fertilize(strong,unblock_fertilize_lazy([idtac])then fertilize(strong,v2))])]),dplan).
