We define the Super-Unique-Tarski problem, which is a Tarski instance in which all slices are required to have a unique fixed point. We show that Super-Unique-Tarski lies in UEOPL under promise-preserving reductions.

翻译：我们定义了超唯一塔尔斯基问题，该问题是塔尔斯基问题的一个实例，其中要求所有切片都具有唯一不动点。我们证明，在保持承诺的归约下，超唯一塔尔斯基问题属于UEOPL。