$ The Send More Money Problem
$
$ solve the equation
$    S E N D
$  + M O R E
$  ----------
$  M O N E Y


language ESSENCE' 1.b.a

letting D1 be domain int(0..9)
letting D2 be domain int(1..9)

find e,n,d,o,r,y : D1, 
               s,m : D2

such that
          1000*s + 100*e + 10*n + d 
        + 1000*m + 100*o + 10*r + e =
10000*m + 1000*o + 100*n + 10*e + y,

alldifferent([s,e,n,d,m,o,r,y])