(s => !r) && (r && !v => u) && (!t && !r => w or u) && (!x => !u) && (r => x xor s) && (v => t xor r) && (w => v) && (x => t) && (t => !v && r)

Doesn't work with or without a preceding "truth table". Is there a maximum length? I am trying to formalize the following equation:

(if s then (not r)) and ((if r and not v) then u) and ((if not t and not r) then w or u) and (if not x then not u) and (if r then either t or s) and (if v then either t or r) and (if w then v) and (if x then t) and (if t then (not v) and r)