/*  This is a proof plan for theorem:
    tailrev2: []==>a:int list=>n:int=>app(rev(a),n::nil)=rev(n::a)in int list
    planner = dplan, clam_version(2.7.0), oyster_version(1.20)

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

/* This is the pretty-printed form
base_case(...)

*/

proof_plan([]==>a:int list=>n:int=>app(rev(a),n::nil)=rev(n::a)in int list,tailrev2,30,base_case(sym_eval(normalize_term([reduction([2,1],[rev2,equ(int list,left)])]))then[elementary(intro(new[a])then[intro(new[n])then[identity,wfftacs],wfftacs])]),dplan).
