/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) foldr(%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) foldr(%U.%Z.G[%U,%Z],V,cons(W,P)) => G[W,foldr(%W.%V.G[%W,%V],V,P)]
 (meta G)[is acc in %U.%Z.G[%U,%Z],V,cons(W,P)] [is acc in G[%U,%Z]] 
 (meta W)[is acc in %U.%Z.G[%U,%Z],V,cons(W,P)] [is positive in cons(W,P)] [is acc in W] 
 (fun foldr=foldr) subterm comparison of args w. LR LR
 (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 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) length(X1) => foldr(%G.%F.s(%F),0,X1)
 (fun length>foldr)
 (fun length>s)
 (fun length>0)
 (meta X1)[is acc in X1] [is acc in X1]  >>True
#SN!
******** Signature ********
 0 : nat
 cons : (nat,list) -> list
 foldr : (((nat,nat) -> nat),nat,list) -> nat
 length : list -> nat
 nil : list
 s : nat -> nat
******** Computation Rules ********
 (1)  foldr(%Y.%X.F[%Y,%X],Y,nil) => Y
 (2)  foldr(%U.%Z.G[%U,%Z],V,cons(W,P)) => G[W,foldr(%W.%V.G[%W,%V],V,P)]
 (3)  length(X1) => foldr(%G.%F.s(%F),0,X1)

YES