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

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

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

*/

proof_plan([]==>n:pnat=>nth(n,nil)=nil in int list,nthnil,20,base_case(sym_eval(normalize_term([reduction([1,1],[nth2,equ(int list,left)])]))then[elementary(intro(new[n])then[identity,wfftacs])]),dplan).
