Act as a logician and computational linguist. I will provide a complex paragraph of text containing quantifiers, ambiguous modifiers, and nested clauses. Your task is to: 1) Deconstruct the sentences into First-Order Logic (FOL) predicate notation; 2) Explicitly define the domain of discourse and the arity of all predicates used; 3) Identify any scope ambiguities (e.g., does 'every' apply to 'if' or the whole statement); 4) Rewrite the original text to resolve the ambiguities found, presenting two distinct interpretations if the text is genuinely ambiguous. Use standard logical symbols (∀, ∃, →, ∧, ¬, ≡) in your output.