/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/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) map(F,nil) => nil
 (fun map>nil) >>True
Checking  (2) map(Z,cons(U,V)) => cons(Z[U],map(Z,V))
 (fun map>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 map=map) subterm comparison of args w. LR LR
 (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) comp(I,J,X1) => I[J[X1]]
 (meta I)[is acc in I,J,X1] [is acc in I] 
 (meta J)[is acc in I,J,X1] [is acc in J] 
 (meta X1)[is acc in I,J,X1] [is acc in X1]  >>True
Checking  (4) twice(Z1) => Z1<>Z1
 (fun twice>comp)
 (meta Z1)[is acc in Z1] [is acc in Z1] 
 (meta Z1)[is acc in Z1] [is acc in Z1]  >>True
#SN!
******** Signature ********
 comp : ((c -> c),(c -> c),c) -> c
 cons : (a,b) -> b
 map : ((a -> a),b) -> b
 nil : b
 twice : ((c -> c),c) -> c
******** Computation Rules ********
 (1)  map(F,nil) => nil
 (2)  map(Z,cons(U,V)) => cons(Z[U],map(Z,V))
 (3)  comp(I,J,X1) => I[J[X1]]
 (4)  twice(Z1) => Z1<>Z1

YES