Let's call everyone by their initial, except that since there are two As we'll use N for Alyin and A for Alayna. Then the answer is
A,B,L,R,S tell the truth; E,F,I,J,M,N lie
Derivation:
Begin
R = ~N & ~E
R = (S = (~A | (F|L)))
J = ~E & ~S & A
R = ~I | ~L | B
F = ~A | ~B
I = ~A & ~F & E
F = J
M = ~B & ~J & ~R
Eliminate J (=F)
R = ~N & ~E
R = (S = (~A | (F|L)))
F = ~E & ~S & A
R = ~I | ~L | B
F = ~A | ~B
I = ~A & ~F & E
M = ~B & ~F & ~R
Eliminate F (=~A|~B)
R = ~N & ~E
R = (S = (~A|~B|L))
~A|~B = ~E & ~S & A
R = ~I | ~L | B
I = ~A & A & B & E
M = ~B & A & B & ~R
Eliminate I (=false) and M (=false, not actually used elsewhere)
R = ~N & ~E
R = (S = (~A|~B|L))
~A|~B = ~E & ~S & A
R = true | ~L | B
Eliminate R (=true)
~N & ~E
S = (~A|~B|L)
~A|~B = ~E & ~S & A
Eliminate N (=false) and E (=false)
S = (~A|~B|L)
~A|~B = ~S & A
Note that if ~A then LHS of second of those is true, hence RHS is, hence A, contradiction
Eliminate A (=true)
S = (~B|L)
~B = ~S
Eliminate B (=S)
S = (~S|L)
Note that if ~S then RHS is true so LHS is so S is, contradiction
Eliminate S (=true)
false|L
Conclude that L is true
If you want to check my work, put the following into a Python interpreter and verify that you get a bunch of True
s out (I do):
a,b,l,r,s = True,True,True,True,True; e,f,i,j,m,n = False,False,False,False,False,False
r == ((not n) and (not e))
r == (s == ((not a) or f or l))
j == ((not e) and (not s) and a)
r == ((not i) or (not l) or b)
f == ((not b) or (not a))
i == ((not a) and (not f) and e)
f == j
m == ((not j) and (not b) and (not r))