/*  This is a proof plan for theorem:
    maxhtminht: []==>t:int tree=>geq(maxht(t),minht(t))
    planner = dplan, clam_version(2.7.0), oyster_version(1.20)

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

/* This is the pretty-printed form
ind_strat([(t:int tree)-node(v1,v0)]) then 
  base_case(...)

*/

proof_plan([]==>t:int tree=>geq(maxht(t),minht(t)),maxhtminht,1660,ind_strat(induction(lemma(treeind)-[(t:int tree)-node(v1,v0)])then[base_case(sym_eval(normalize_term([reduction([1],[maxht1,equ(pnat,left)]),reduction([],[geqzero,equiv(left)]),reduction([1,1],[minht1,equ(pnat,left)])]))then[elementary(identity)]),step_case(ripple(direction_out,wave(direction_out,[2],[minht2,equ(pnat,left)],[])then[wave(direction_out,[1],[maxht2,equ(pnat,left)],[])then[wave(direction_out,[],[geq3,equ(u(1),left)],[])then[unblock_then_wave(direction_out,unblock_lazy([unblock(meta_ripple,unused,unused),unblock(meta_ripple,unused,unused),idtac])then wave(direction_out,[],[minmaxgeq,imp(right)],[]))]]])then[idtac])])then[base_case(elementary(intro then[hyp(v2),hyp(v3)]))],dplan).
