/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: cons, nil
Checking type order >>OK
Checking positivity of constructors >>OK
Checking function dependency >>OK
Checking  (1) foldl(%Y.%X.F[%Y,%X],Y,nil) => Y
 (meta Y)[is acc in %Y.%X.F[%Y,%X],Y,nil] [is acc in Y]  >>True
Checking  (2) foldl(%U.%Z.G[%U,%Z],V,cons(W,P)) => foldl(%W.%V.G[%W,%V],G[V,W],P)
 (fun foldl=foldl) subterm comparison of args w. LR LR >>False

Try again using status RL
Checking  (1) foldl(%Y.%X.F[%Y,%X],Y,nil) => Y
 (meta Y)[is acc in %Y.%X.F[%Y,%X],Y,nil] [is acc in Y]  >>True
Checking  (2) foldl(%U.%Z.G[%U,%Z],V,cons(W,P)) => foldl(%W.%V.G[%W,%V],G[V,W],P)
 (fun foldl=foldl) subterm comparison of args w. RL RL
 (meta G)[is acc in %U.%Z.G[%U,%Z],V,cons(W,P)] [is acc in G[%U,%Z]] 
 (meta G)[is acc in %U.%Z.G[%U,%Z],V,cons(W,P)] [is acc in G[%U,%Z]] 
 (meta V)[is acc in %U.%Z.G[%U,%Z],V,cons(W,P)] [is acc in V] 
 (meta W)[is acc in %U.%Z.G[%U,%Z],V,cons(W,P)] [is positive in cons(W,P)] [is acc in W] 
 (meta P)[is acc in %U.%Z.G[%U,%Z],V,cons(W,P)] [is positive in cons(W,P)] [is acc in P]  >>True
#SN!
******** Signature ********
 cons : (a,alist) -> alist
 foldl : (((a,a) -> a),a,alist) -> a
 nil : alist
******** Computation Rules ********
 (1)  foldl(%Y.%X.F[%Y,%X],Y,nil) => Y
 (2)  foldl(%U.%Z.G[%U,%Z],V,cons(W,P)) => foldl(%W.%V.G[%W,%V],G[V,W],P)

YES