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


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


YES

Uncurrying transformation.. done
******** General Schema criterion ********
Found constructors: 0, s
Checking type order >>OK
Checking positivity of constructors >>OK
Checking function dependency >>OK
Checking  (1) rec(0,X,%X.%Y.Z[%X,%Y]) => X
 (meta X)[is acc in 0,X,%X.%Y.Z[%X,%Y]] [is positive in 0] [is acc in X]  >>True
Checking  (2) rec(s(U),V,%Z.%U.I[%Z,%U]) => I[U,rec(U,V,%V.%W.I[%V,%W])]
 (meta I)[is acc in s(U),V,%Z.%U.I[%Z,%U]] [is positive in s(U)] [is acc in I[%Z,%U]] 
 (meta U)[is acc in s(U),V,%Z.%U.I[%Z,%U]] [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,%Z.%U.I[%Z,%U]] [is positive in s(U)] [is acc in U] 
 (meta V)[is acc in s(U),V,%Z.%U.I[%Z,%U]] [is positive in s(U)] [is acc in V] 
 (meta I)[is acc in s(U),V,%Z.%U.I[%Z,%U]] [is positive in s(U)] [is acc in I[%Z,%U]]  >>True
#SN!
******** Signature ********
 0 : nat
 rec : (nat,a,((nat,a) -> a)) -> a
 s : nat -> nat
******** Computation Rules ********
 (1)  rec(0,X,%X.%Y.Z[%X,%Y]) => X
 (2)  rec(s(U),V,%Z.%U.I[%Z,%U]) => I[U,rec(U,V,%V.%W.I[%V,%W])]

YES