/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files


--------------------------------------------------------------------------------


YES

******** General Schema criterion ********
Found constructors: cons, nil
Checking type order >>OK
Checking positivity of constructors >>OK
Checking function dependency >>OK
Checking  (1) emap(F,nil) => nil
 (fun emap>nil) >>True
Checking  (2) emap(Z,cons(U,V)) => cons(Z[U],emap(%X.twice(Z,%X),V))
 (fun emap>cons)
 (meta Z)[is acc in Z,cons(U,V)] [is acc in Z] 
 (meta U)[is acc in Z,cons(U,V)] [is positive in cons(U,V)] [is acc in U] 
 (fun emap=emap) subterm comparison of args w. LR LR >>False

Try again using status RL
Checking  (1) emap(F,nil) => nil
 (fun emap>nil) >>True
Checking  (2) emap(Z,cons(U,V)) => cons(Z[U],emap(%X.twice(Z,%X),V))
 (fun emap>cons)
 (meta Z)[is acc in Z,cons(U,V)] [is acc in Z] 
 (meta U)[is acc in Z,cons(U,V)] [is positive in cons(U,V)] [is acc in U] 
 (fun emap=emap) subterm comparison of args w. RL RL
 (fun emap>twice)
 (meta Z)[is acc in Z,cons(U,V)] [is acc in Z] 
 (meta V)[is acc in Z,cons(U,V)] [is positive in cons(U,V)] [is acc in V]  >>True
Checking  (3) twice(I,P) => I[I[P]]
 (meta I)[is acc in I,P] [is acc in I] 
 (meta I)[is acc in I,P] [is acc in I] 
 (meta P)[is acc in I,P] [is acc in P]  >>True
#SN!
******** Signature ********
 cons : (nat,list) -> list
 emap : ((nat -> nat),list) -> list
 nil : list
 twice : ((nat -> nat),nat) -> nat
******** Computation Rules ********
 (1)  emap(F,nil) => nil
 (2)  emap(Z,cons(U,V)) => cons(Z[U],emap(%X.twice(Z,%X),V))
 (3)  twice(I,P) => I[I[P]]

YES