/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: xbplus, cons, false, nil, true
Checking type order >>OK
Checking positivity of constructors >>OK
Checking function dependency >>Regared as equal: filter2, filter
Checking  (1) xbtimes(X,xbplus(Y,U)) => xbplus(xbtimes(X,Y),xbtimes(X,U))
 (fun xbtimes>xbplus)
 (fun xbtimes=xbtimes) subterm comparison of args w. LR LR
 (meta X)[is acc in X,xbplus(Y,U)] [is acc in X] 
 (meta Y)[is acc in X,xbplus(Y,U)] [is positive in xbplus(Y,U)] [is acc in Y] 
 (fun xbtimes=xbtimes) subterm comparison of args w. LR LR
 (meta X)[is acc in X,xbplus(Y,U)] [is acc in X] 
 (meta U)[is acc in X,xbplus(Y,U)] [is positive in xbplus(Y,U)] [is acc in U]  >>True
Checking  (2) map(H,nil) => nil
 (fun map>nil) >>True
Checking  (3) map(I,cons(P,X1)) => cons(I[P],map(I,X1))
 (fun map>cons)
 (meta I)[is acc in I,cons(P,X1)] [is acc in I] 
 (meta P)[is acc in I,cons(P,X1)] [is positive in cons(P,X1)] [is acc in P] 
 (fun map=map) subterm comparison of args w. LR LR
 (meta I)[is acc in I,cons(P,X1)] [is acc in I] 
 (meta X1)[is acc in I,cons(P,X1)] [is positive in cons(P,X1)] [is acc in X1]  >>True
Checking  (4) filter(Z1,nil) => nil
 (fun filter>nil) >>True
Checking  (5) filter(G1,cons(V1,W1)) => filter2(G1[V1],G1,V1,W1)
 (fun filter=filter2) subterm comparison of args w. Arg [1,2] Arg [2,4,3,1]
 (meta G1)[is acc in G1,cons(V1,W1)] [is acc in G1] 
 (meta V1)[is acc in G1,cons(V1,W1)] [is positive in cons(V1,W1)] [is acc in V1] 
 (meta G1)[is acc in G1,cons(V1,W1)] [is acc in G1] 
 (meta V1)[is acc in G1,cons(V1,W1)] [is positive in cons(V1,W1)] [is acc in V1] 
 (meta W1)[is acc in G1,cons(V1,W1)] [is positive in cons(V1,W1)] [is acc in W1]  >>True
Checking  (6) filter2(true,J1,X2,Y2) => cons(X2,filter(J1,Y2))
 (fun filter2>cons)
 (meta X2)[is acc in true,J1,X2,Y2] [is positive in true] [is acc in X2] 
 (fun filter2=filter) subterm comparison of args w. Arg [2,4,3,1] Arg [1,2]
 (meta J1)[is acc in true,J1,X2,Y2] [is positive in true] [is acc in J1] 
 (meta Y2)[is acc in true,J1,X2,Y2] [is positive in true] [is acc in Y2]  >>True
Checking  (7) filter2(false,G2,V2,W2) => filter(G2,W2)
 (fun filter2=filter) subterm comparison of args w. Arg [2,4,3,1] Arg [1,2]
 (meta G2)[is acc in false,G2,V2,W2] [is positive in false] [is acc in G2] 
 (meta W2)[is acc in false,G2,V2,W2] [is positive in false] [is acc in W2]  >>True
#SN!
******** Signature ********
 xbplus : (b,b) -> b
 xbtimes : (a,b) -> b
 cons : (d,e) -> e
 false : c
 filter : ((d -> c),e) -> e
 filter2 : (c,(d -> c),d,e) -> e
 map : ((d -> d),e) -> e
 nil : e
 true : c
******** Computation Rules ********
 (1)  xbtimes(X,xbplus(Y,U)) => xbplus(xbtimes(X,Y),xbtimes(X,U))
 (2)  map(H,nil) => nil
 (3)  map(I,cons(P,X1)) => cons(I[P],map(I,X1))
 (4)  filter(Z1,nil) => nil
 (5)  filter(G1,cons(V1,W1)) => filter2(G1[V1],G1,V1,W1)
 (6)  filter2(true,J1,X2,Y2) => cons(X2,filter(J1,Y2))
 (7)  filter2(false,G2,V2,W2) => filter(G2,W2)

YES