/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: s, z
Checking type order >>OK
Checking positivity of constructors >>OK
Checking function dependency >>OK
Checking  (1) rec(z,X,%X.Z[%X]) => X
 (meta X)[is acc in z,X,%X.Z[%X]] [is positive in z] [is acc in X]  >>True
Checking  (2) rec(s(U),V,%Y.I[%Y]) => I[U,rec(U,V,%Z.I[%Z])]
 (meta I)[is acc in s(U),V,%Y.I[%Y]] [is positive in s(U)] [is acc in I[%Y]] 
 (meta U)[is acc in s(U),V,%Y.I[%Y]] [is positive in s(U)] [is acc in U] 
 (fun rec=rec) subterm comparison of args w. LR LR
 (meta U)[is acc in s(U),V,%Y.I[%Y]] [is positive in s(U)] [is acc in U] 
 (meta V)[is acc in s(U),V,%Y.I[%Y]] [is positive in s(U)] [is acc in V] 
 (meta I)[is acc in s(U),V,%Y.I[%Y]] [is positive in s(U)] [is acc in I[%Y]]  >>True
#SN!
******** Signature ********
 rec : (N,a,((N,a) -> a)) -> a
 s : N -> N
 z : N
******** Computation Rules ********
 (1)  rec(z,X,%X.Z[%X]) => X
 (2)  rec(s(U),V,%Y.I[%Y]) => I[U,rec(U,V,%Z.I[%Z])]

YES