/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
Checking type order >>OK
Checking positivity of constructors >>OK
Checking function dependency >>OK
Checking  (1) rec(%Y.%X.F[%Y,%X],Y,0) => Y
 (meta Y)[is acc in %Y.%X.F[%Y,%X],Y,0] [is acc in Y]  >>True
Checking  (2) rec(%U.%Z.G[%U,%Z],V,s(W)) => G[W,rec(%W.%V.G[%W,%V],V,W)]
 (meta G)[is acc in %U.%Z.G[%U,%Z],V,s(W)] [is acc in G[%U,%Z]] 
 (meta W)[is acc in %U.%Z.G[%U,%Z],V,s(W)] [is positive in s(W)] [is acc in W] 
 (fun rec=rec) subterm comparison of args w. LR LR
 (meta G)[is acc in %U.%Z.G[%U,%Z],V,s(W)] [is acc in G[%U,%Z]] 
 (meta V)[is acc in %U.%Z.G[%U,%Z],V,s(W)] [is acc in V] 
 (meta W)[is acc in %U.%Z.G[%U,%Z],V,s(W)] [is positive in s(W)] [is acc in W]  >>True
Checking  (3) add(P,X1) => rec(%G.%F.s(%F),P,X1)
 (fun add>rec)
 (fun add>s)
 (meta P)[is acc in P,X1] [is acc in P] 
 (meta X1)[is acc in P,X1] [is acc in X1]  >>True
Checking  (4) add(Y1,0) => Y1
 (meta Y1)[is acc in Y1,0] [is acc in Y1]  >>True
Checking  (5) add(U1,s(V1)) => s(add(U1,V1))
 (fun add>s)
 (fun add=add) subterm comparison of args w. LR LR
 (meta U1)[is acc in U1,s(V1)] [is acc in U1] 
 (meta V1)[is acc in U1,s(V1)] [is positive in s(V1)] [is acc in V1]  >>True
#SN!
******** Signature ********
 0 : nat
 add : (nat,nat) -> nat
 rec : (((nat,nat) -> nat),nat,nat) -> nat
 s : nat -> nat
******** Computation Rules ********
 (1)  rec(%Y.%X.F[%Y,%X],Y,0) => Y
 (2)  rec(%U.%Z.G[%U,%Z],V,s(W)) => G[W,rec(%W.%V.G[%W,%V],V,W)]
 (3)  add(P,X1) => rec(%G.%F.s(%F),P,X1)
 (4)  add(Y1,0) => Y1
 (5)  add(U1,s(V1)) => s(add(U1,V1))

YES