[SMT-LIB] question on terminology: the kind of equisatisfiability that we actually want

[Johannes Waldmann]

Dear all,

excuse me for asking something
that's only tangentially related with SMT-LIB:

how do you call (in teaching, in papers)
this relation between formulas in propositional logic:

"F and G are equisatisfiable, and Var(F) \subseteq Var(G),
and the models of F are the restrictions of the models of G"

(that is, the specification for the Tseitin transform,
describing that you can introduce extra variables)

"reconstructibly equisatisfiable"?

Thanks, Johannes.

(If you email me privately, I can summarize to the list.)