/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, 1, add, cons, mul, nil, prod
Checking type order >>OK
Checking positivity of constructors >>OK
Checking function dependency >>OK
Checking  (1) fold(%Y.%X.F[%Y,%X],nil,Y) => Y
 (meta Y)[is acc in %Y.%X.F[%Y,%X],nil,Y] [is positive in nil] [is acc in Y]  >>True
Checking  (2) fold(%U.%Z.G[%U,%Z],cons(V,W),P) => fold(%W.%V.G[%W,%V],W,G[P,V])
 (fun fold=fold) subterm comparison of args w. LR LR
 (meta G)[is acc in %U.%Z.G[%U,%Z],cons(V,W),P] [is acc in G[%U,%Z]] 
 (meta W)[is acc in %U.%Z.G[%U,%Z],cons(V,W),P] [is positive in cons(V,W)] [is acc in W] 
 (meta G)[is acc in %U.%Z.G[%U,%Z],cons(V,W),P] [is acc in G[%U,%Z]] 
 (meta P)[is acc in %U.%Z.G[%U,%Z],cons(V,W),P] [is positive in cons(V,W)] [is acc in P] 
 (meta V)[is acc in %U.%Z.G[%U,%Z],cons(V,W),P] [is positive in cons(V,W)] [is acc in V]  >>True
Checking  (3) sum(X1) => fold(%G.%F.add(%G,%F),X1,0)
 (fun sum>fold)
 (fun sum>add)
 (meta X1)[is acc in X1] [is acc in X1] 
 (fun sum>0) >>True
Checking  (4) fold(%I.%H.mul(%I,%H),Y1,1) => prod(Y1)
 (fun fold>prod)
 (meta Y1)[is acc in %I.%H.mul(%I,%H),Y1,1] [is positive in mul(%I,%H)] [is acc in Y1]  >>True
#SN!
******** Signature ********
 0 : c
 1 : c
 add : (c,a) -> c
 cons : (a,b) -> b
 fold : (((c,a) -> c),b,c) -> c
 mul : (c,a) -> c
 nil : b
 prod : b -> c
 sum : b -> c
******** Computation Rules ********
 (1)  fold(%Y.%X.F[%Y,%X],nil,Y) => Y
 (2)  fold(%U.%Z.G[%U,%Z],cons(V,W),P) => fold(%W.%V.G[%W,%V],W,G[P,V])
 (3)  sum(X1) => fold(%G.%F.add(%G,%F),X1,0)
 (4)  fold(%I.%H.mul(%I,%H),Y1,1) => prod(Y1)

YES