/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[s(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]] 
 (fun rec>s)
 (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
#SN!
******** Signature ********
 0 : a
 rec : (((a,b) -> b),b,a) -> b
 s : a -> a
******** Computation Rules ********
 (1)  rec(%Y.%X.F[%Y,%X],Y,0) => Y
 (2)  rec(%U.%Z.G[%U,%Z],V,s(W)) => G[s(W),rec(%W.%V.G[%W,%V],V,W)]

YES