/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, cons, nil, s
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
Checking  (3) plusc(X1,0) => X1
 (meta X1)[is acc in X1,0] [is acc in X1]  >>True
Checking  (4) plusc(Y1,s(U1)) => s(plusc(Y1,U1))
 (fun plusc>s)
 (fun plusc=plusc) subterm comparison of args w. RL RL
 (meta Y1)[is acc in Y1,s(U1)] [is acc in Y1] 
 (meta U1)[is acc in Y1,s(U1)] [is positive in s(U1)] [is acc in U1]  >>True
Checking  (5) sum(V1) => foldl(%G.%F.plusc(%G,%F),0,V1)
 (fun sum>foldl)
 (fun sum>plusc)
 (fun sum>0)
 (meta V1)[is acc in V1] [is acc in V1]  >>True
#SN!
******** Signature ********
 0 : nat
 cons : (nat,list) -> list
 foldl : (((nat,nat) -> nat),nat,list) -> nat
 nil : list
 plusc : (nat,nat) -> nat
 s : nat -> nat
 sum : list -> nat
******** 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)
 (3)  plusc(X1,0) => X1
 (4)  plusc(Y1,s(U1)) => s(plusc(Y1,U1))
 (5)  sum(V1) => foldl(%G.%F.plusc(%G,%F),0,V1)

YES