/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: 0, s, lim
Checking type order >>OK
Checking positivity of constructors >>OK
Checking function dependency >>OK
Checking  (1) rec(0,U,X,W) => U
 (meta U)[is acc in 0,U,X,W] [is positive in 0] [is acc in U]  >>True
Checking  (2) rec(s(X_),U,X,W) => X[X_,rec(X_,U,X,W)]
 (meta X)[is acc in s(X_),U,X,W] [is positive in s(X_)] [is acc in X] 
 (meta X_)[is acc in s(X_),U,X,W] [is positive in s(X_)] [is acc in X_] 
 (fun rec=rec) subterm comparison of args w. LR LR
 (meta X_)[is acc in s(X_),U,X,W] [is positive in s(X_)] [is acc in X_] 
 (meta U)[is acc in s(X_),U,X,W] [is positive in s(X_)] [is acc in U] 
 (meta X)[is acc in s(X_),U,X,W] [is positive in s(X_)] [is acc in X] 
 (meta W)[is acc in s(X_),U,X,W] [is positive in s(X_)] [is acc in W]  >>True
Checking  (3) rec(lim(F),U,X,W) => W[F,n.rec(F[n],U,X,W)]
 (meta W)[is acc in lim(F),U,X,W] [is positive in lim(F)] [is acc in W] 
 (meta F)[is acc in lim(F),U,X,W] [is positive in lim(F)] [is acc in F] 
 (fun rec=rec) subterm comparison of args w. LR LR
 (meta F)[is acc in lim(F),U,X,W] [is positive in lim(F)] [is acc in F] 
 (meta U)[is acc in lim(F),U,X,W] [is positive in lim(F)] [is acc in U] 
 (meta X)[is acc in lim(F),U,X,W] [is positive in lim(F)] [is acc in X] 
 (meta W)[is acc in lim(F),U,X,W] [is positive in lim(F)] [is acc in W]  >>True
#SN!
******** Signature ********
 0 : ord
 s : ord -> ord
 lim : (nat -> ord) -> ord
 rec : (ord,a,((ord,a) -> a),(((nat -> ord),(nat -> a)) -> a)) -> a
******** Computation Rules ********
 (1)  rec(0,U,X,W) => U
 (2)  rec(s(X_),U,X,W) => X[X_,rec(X_,U,X,W)]
 (3)  rec(lim(F),U,X,W) => W[F,n.rec(F[n],U,X,W)]

YES