/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 (18-21)   or, (19-21)   or, (20-21)   or, (21-18)   or, (21-19)   or, (21-20) 
a subterm of the rhs is matched with its lhs using forward closure of the rules.

******** Signature ********
 0 : b
 cons : (b,c) -> c
 eq : (b,b) -> a
 false : a
 hamming : c
 if : (a,c,c) -> c
 list1 : c
 list2 : c
 list3 : c
 lt : (b,b) -> a
 map : ((b -> b),c) -> c
 merge : (c,c) -> c
 mult : (b,b) -> b
 nil : c
 plus : (b,b) -> b
 s : b -> b
 true : a
******** Computation Rules ********
 (1)  if(true,X,Y) => X
 (2)  if(false,U,V) => V
 (3)  lt(s(W),s(P)) => lt(W,P)
 (4)  lt(0,s(X1)) => true
 (5)  lt(Y1,0) => false
 (6)  eq(U1,U1) => true
 (7)  eq(s(V1),0) => false
 (8)  eq(0,s(W1)) => false
 (9)  merge(P1,nil) => P1
 (10)  merge(nil,X2) => X2
 (11)  merge(cons(Y2,U2),cons(V2,W2)) => if(lt(Y2,V2),cons(Y2,merge(U2,cons(V2,W2))),if(eq(Y2,V2),cons(Y2,merge(U2,W2)),cons(V2,merge(cons(Y2,U2),W2))))
 (12)  map(J2,nil) => nil
 (13)  map(F3,cons(Y3,U3)) => cons(F3[Y3],map(F3,U3))
 (14)  mult(0,V3) => 0
 (15)  mult(s(W3),P3) => P3 + mult(W3,P3)
 (16)  0 + X4 => 0
 (17)  s(Y4) + U4 => s(Y4 + U4)
 (18)  list1 => map(mult(s(s(0))),hamming)
 (19)  list2 => map(mult(s(s(s(0)))),hamming)
 (20)  list3 => map(mult(s(s(s(s(s(0)))))),hamming)
 (21)  hamming => cons(s(0),merge(list1,merge(list2,list3)))

NO