/*  This is a proof plan for theorem:
    singlerev: []==>n:int=>rev(n::nil)=n::nil 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([]==>n:int=>rev(n::nil)=n::nil in int list,singlerev,30,base_case(sym_eval(normalize_term([reduction([1,1],[rev2,equ(int list,left)]),reduction([1,1,1],[rev1,equ(int list,left)]),reduction([1,1],[app1,equ(int list,left)])]))then[elementary(intro(new[n])then[identity,wfftacs])]),dplan).
