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


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


NO

Not SN because in (1-1) 
a subterm of the rhs is matched with its lhs using forward closure of the rules.

******** Signature ********
 0 : b
 1 : b
 cons : (e,f) -> f
 f : (b,c) -> a
 false : d
 filter : ((e -> d),f) -> f
 filter2 : (d,(e -> d),e,f) -> f
 g : b -> c
 map : ((e -> e),f) -> f
 nil : f
 true : d
******** Computation Rules ********
 (1)  f(X,g(X)) => f(1,g(X))
 (2)  g(1) => g(0)
 (3)  map(Z,nil) => nil
 (4)  map(G,cons(V,W)) => cons(G[V],map(G,W))
 (5)  filter(J,nil) => nil
 (6)  filter(F1,cons(Y1,U1)) => filter2(F1[Y1],F1,Y1,U1)
 (7)  filter2(true,H1,W1,P1) => cons(W1,filter(H1,P1))
 (8)  filter2(false,F2,Y2,U2) => filter(F2,U2)

NO