This paper explores two new inference rules for reasoning with quantifiers and theories in a saturation-based first-order theorem prover. The focus here is on non-ground clauses, complementing our recent work on AVATAR modulo theories for ground theory reasoning. The current implementation focuses on complete theories, e.g. various versions of arithmetic, but we also sketch how to work with incomplete theories.The first new rule utilises theory constraint solving (an SMT solver) to perform reasoning within a clause to find an instance where we can remove one or more theory literals. This utilises the power of SMT solvers for theory reasoning with non-ground clauses, reasoning which is currently achieved by the addition of prolific theory axioms.The second new rule is unification with abstraction where the notion of unification is extended to introduce constraints where theory terms may not otherwise unify e.g. <i>p(2)</i> may unify with <i>¬p(x+1) ⋁ q(x) to produce 2 ≄ x+1 ⋁ q(x)</i>. This abstraction is performed lazily, as needed, to allow the superposition theorem prover to make as much progress as possible without the search space growing too quickly.Additionally, the first rule can be used to discharge the constraints introduced by the second. These rules were implemented within the Vampire theorem prover and experimental results show that they are useful for solving a considerable number of previously unsolved problems.