/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: 0, cons, nil, s
Checking type order >>OK
Checking positivity of constructors >>OK
Checking function dependency >>OK
Checking  (1) id(X) => X
 (meta X)[is acc in X] [is acc in X]  >>True
Checking  (2) add(0) => id
 (fun add>id) >>True
Checking  (3) add(s(Y),U) => s(add(Y,U))
 (fun add>s)
 (fun add=add) subterm comparison of args w. LR LR
 (meta Y)[is acc in s(Y),U] [is positive in s(Y)] [is acc in Y] 
 (meta U)[is acc in s(Y),U] [is positive in s(Y)] [is acc in U]  >>True
Checking  (4) map(H,nil) => nil
 (fun map>nil) >>True
Checking  (5) map(I,cons(P,X1)) => cons(I[P],map(I,X1))
 (fun map>cons)
 (meta I)[is acc in I,cons(P,X1)] [is acc in I] 
 (meta P)[is acc in I,cons(P,X1)] [is positive in cons(P,X1)] [is acc in P] 
 (fun map=map) subterm comparison of args w. LR LR
 (meta I)[is acc in I,cons(P,X1)] [is acc in I] 
 (meta X1)[is acc in I,cons(P,X1)] [is positive in cons(P,X1)] [is acc in X1]  >>True
#SN!
******** Signature ********
 0 : a
 add : (a,a) -> a
 cons : (b,c) -> c
 id : a -> a
 map : ((b -> b),c) -> c
 nil : c
 s : a -> a
******** Computation Rules ********
 (1)  id(X) => X
 (2)  add(0) => id
 (3)  add(s(Y),U) => s(add(Y,U))
 (4)  map(H,nil) => nil
 (5)  map(I,cons(P,X1)) => cons(I[P],map(I,X1))

YES