/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: nil, cons
Checking type order >>OK
Checking positivity of constructors >>OK
Checking function dependency >>OK
Checking  (1) dapply(X,F,G) => F[G[X]]
 (meta F)[is acc in X,F,G] [is acc in F] 
 (meta G)[is acc in X,F,G] [is acc in G] 
 (meta X)[is acc in X,F,G] [is acc in X]  >>True
Checking  (2) lapply(X,nil) => X
 (meta X)[is acc in X,nil] [is acc in X]  >>True
Checking  (3) lapply(X,cons(F,Lf)) => F[lapply(X,Lf)]
 (meta F)[is acc in X,cons(F,Lf)] [is positive in cons(F,Lf)] [is acc in F] 
 (fun lapply=lapply) subterm comparison of args w. LR LR
 (meta X)[is acc in X,cons(F,Lf)] [is acc in X] 
 (meta Lf)[is acc in X,cons(F,Lf)] [is positive in cons(F,Lf)] [is acc in Lf]  >>True
#SN!
******** Signature ********
 nil : listf
 cons : ((a -> a),listf) -> listf
 dapply : (a,(a -> a),(a -> a)) -> a
 lapply : (a,listf) -> a
******** Computation Rules ********
 (1)  dapply(X,F,G) => F[G[X]]
 (2)  lapply(X,nil) => X
 (3)  lapply(X,cons(F,Lf)) => F[lapply(X,Lf)]

YES