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

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

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

*/

proof_plan([]==>a:pnat=>b:pnat=>leq(a,b)\leq(b,a),leqdupl,210,ind_strat(induction(lemma(pairs)-[(a:pnat)-s(v1),(b:pnat)-s(v0)])then[base_case(sym_eval(normalize_term([reduction([1],[leq1,equ(u(1),left)])]))then[elementary(intro(left)then[istrue,wfftacs])]),base_case(sym_eval(normalize_term([reduction([2],[leq1,equ(u(1),left)])]))then[elementary(intro(right)then[istrue,wfftacs])]),step_case(ripple(direction_out,wave(direction_out,[2],[leq3,equ(u(1),left)],[])then[wave(direction_out,[1],[leq3,equ(u(1),left)],[])])then[unblock_then_fertilize(strong,unblock_fertilize_lazy([idtac])then fertilize(strong,v2))])]),dplan).
