“…, where each support of interpreted sort is considered to be fixed. Following the terminology used in [8,9], we will refer to elements in the fixed domain of sort s ∈ S i as domain elements of sort s. Let F be a universal first-order formula over signature Π ′ = (S, Σ, Pred ∪ {P }). We can assume, without loss of generality, that F is a set of clauses of the form ∀x D(x) ∨ C(x), where D(x) is a clause over the signature Π and C(x) is a clause containing literals of the form (¬)P (x 1 , .…”