/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files


--------------------------------------------------------------------------------


YES

******** General Schema criterion ********
Found constructors: 0, nil, cons, s
Checking type order >>OK
Checking positivity of constructors >>OK
Checking function dependency >>OK
Checking  (1) foldr(F,X,nil) => X
 (meta X)[is acc in F,X,nil] [is acc in X]  >>True
Checking  (2) foldr(F,X,cons(Y,Ys)) => F[Y,foldr(F,X,Ys)]
 (meta F)[is acc in F,X,cons(Y,Ys)] [is acc in F] 
 (meta Y)[is acc in F,X,cons(Y,Ys)] [is positive in cons(Y,Ys)] [is acc in Y] 
 (fun foldr=foldr) subterm comparison of args w. LR LR
 (meta F)[is acc in F,X,cons(Y,Ys)] [is acc in F] 
 (meta X)[is acc in F,X,cons(Y,Ys)] [is acc in X] 
 (meta Ys)[is acc in F,X,cons(Y,Ys)] [is positive in cons(Y,Ys)] [is acc in Ys]  >>True
Checking  (3) length(Xs) => foldr(x.n.s(n),0,Xs)
 (fun length>foldr)
 (fun length>s)
 (fun length>0)
 (meta Xs)[is acc in Xs] [is acc in Xs]  >>True
#SN!
******** Signature ********
 0 : nat
 nil : list
 cons : (nat,list) -> list
 foldr : (((nat,nat) -> nat),nat,list) -> nat
 length : list -> nat
 s : nat -> nat
******** Computation Rules ********
 (1)  foldr(F,X,nil) => X
 (2)  foldr(F,X,cons(Y,Ys)) => F[Y,foldr(F,X,Ys)]
 (3)  length(Xs) => foldr(x.n.s(n),0,Xs)

YES