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


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


YES

Uncurrying transformation.. done
******** General Schema criterion ********
Found constructors: 0, cons, nil, plus
Checking type order >>OK
Checking positivity of constructors >>OK
Checking function dependency >>OK
Checking  (1) foldl(%X.%Y.F[%X,%Y],Y,nil) => Y
 (meta Y)[is acc in %X.%Y.F[%X,%Y],Y,nil] [is acc in Y]  >>True
Checking  (2) foldl(%Z.%U.G[%Z,%U],V,cons(W,P)) => foldl(%V.%W.G[%V,%W],G[V,W],P)
 (fun foldl=foldl) subterm comparison of args w. LR LR >>False

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

YES