/*  This is a proof plan for theorem:
    evenodd1: []==>x:pnat=>even(x)=>odd(x)=>void
    planner = dplan, clam_version(2.7.0), oyster_version(1.20)

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

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

*/

proof_plan([]==>x:pnat=>even(x)=>odd(x)=>void,evenodd1,300,ind_strat(induction(lemma(twos)-[(x:pnat)-s(s(v0))])then[base_case(sym_eval(normalize_term([reduction([1],[even1,equ(u(1),left)]),reduction([1,2],[odd1,equ(u(1),left)])]))then[elementary(intro(new[v0])then[intro(new[v1])then[hyp(v1),wfftacs],wfftacs])]),base_case(sym_eval(normalize_term([reduction([1],[even2,equ(u(1),left)]),reduction([1,2],[odd2,equ(u(1),left)])]))then[elementary(intro(new[v0])then[elim(v0),wfftacs])]),step_case(ripple(direction_out,wave(direction_out,[1],[even3,equ(u(1),left)],[])then[wave(direction_out,[1,2],[odd3,equ(u(1),left)],[])])then[unblock_then_fertilize(strong,unblock_fertilize_lazy([idtac])then fertilize(strong,v1))])]),dplan).
