%------------------------------------------------------------------------------
% File : DT2H2X---1.9.5
% Problem : SEV159^5 : TPTP v9.2.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% Computer : n012.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Wed Feb 25 09:40:26 AM UTC 2026
% Result : Theorem 1.03s 0.96s
% Output : Refutation 1.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 2
% Syntax : Number of formulae : 9 ( 8 unt; 0 typ; 0 def)
% Number of atoms : 10 ( 9 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 9 ( 8 ~; 0 |; 0 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 1 ( 1 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 8 ( 5 !; 3 ?; 8 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
a: $tType ).
tff(func_def_0,type,
a: $tType ).
tff(func_def_1,type,
sK0: a ).
tff(f9,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[f8]) ).
tff(f8,plain,
sK0 != sK0,
inference(cnf_transformation,[status(thm)],[f7]) ).
tff(f7,plain,
sK0 != sK0,
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f5,f6]) ).
tff(f6,plain,
( ? [X0: a] : ( X0 != X0 )
=> ( sK0 != sK0 ) ),
introduced(definition,[],[choice_axiom]) ).
tff(f5,plain,
? [X0: a] : ( X0 != X0 ),
inference(rectify,[status(thm)],[f4]) ).
tff(f4,plain,
? [X1: a] : ( X1 != X1 ),
inference(ennf_transformation,[status(thm)],[f3]) ).
tff(f3,plain,
~ ! [X1: a] : ( X1 = X1 ),
inference(rectify,[status(thm)],[f2]) ).
tff(f2,negated_conjecture,
~ ! [X0: a,X1: a] : ( X1 = X1 ),
inference(negated_conjecture,[status(cth)],[f1]) ).
tff(f1,conjecture,
! [X0: a,X1: a] : ( X1 = X1 ),
file('/export/starexec/sandbox/tmp/tmp.lTq5ZFabWb/DTF2THF_15624.p',cTHM181_pme) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.07 % Problem : SEV159^5 : TPTP v9.2.1. Released v4.0.0.
% 0.00/0.08 % Command : /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.09/0.27 % Computer : n012.cluster.edu
% 0.09/0.27 % Model : x86_64 x86_64
% 0.09/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.27 % Memory : 8042.1875MB
% 0.09/0.27 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.27 % CPULimit : 300
% 0.09/0.27 % WCLimit : 300
% 0.09/0.27 % DateTime : Tue Feb 24 12:41:00 EST 2026
% 0.09/0.27 % CPUTime :
% 0.09/0.27 Running /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.14/0.34 ---- Original DTF file ---
% 0.14/0.34 thf(spec,logic,$$dhol).
% 0.14/0.34 %------------------------------------------------------------------------------
% 0.14/0.34 % File : SEV159^5 : TPTP v9.2.1. Released v4.0.0.
% 0.14/0.34 % Domain : Set Theory
% 0.14/0.34 % Problem : TPS problem THM181
% 0.14/0.34 % Version : Especial.
% 0.14/0.34 % English : Basic theorem about pairing.
% 0.14/0.34
% 0.14/0.34 % Refs : [Bro09] Brown (2009), Email to Geoff Sutcliffe
% 0.14/0.34 % Source : [Bro09]
% 0.14/0.34 % Names : tps_0020 [Bro09]
% 0.14/0.34 % : THM180 [TPS]
% 0.14/0.34 % : THM181 [TPS]
% 0.14/0.34
% 0.14/0.34 % Status : Theorem
% 0.14/0.34 % Rating : 0.00 v9.0.0, 0.10 v8.2.0, 0.00 v6.2.0, 0.14 v6.1.0, 0.00 v6.0.0, 0.14 v5.5.0, 0.17 v5.4.0, 0.20 v4.1.0, 0.00 v4.0.0
% 0.14/0.34 % Syntax : Number of formulae : 2 ( 1 unt; 1 typ; 0 def)
% 0.14/0.34 % Number of atoms : 1 ( 1 equ; 0 cnn)
% 0.14/0.34 % Maximal formula atoms : 1 ( 1 avg)
% 0.14/0.34 % Number of connectives : 0 ( 0 ~; 0 |; 0 &; 0 @)
% 0.14/0.34 % ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% 0.14/0.34 % Maximal formula depth : 3 ( 3 avg)
% 0.14/0.34 % Number of types : 1 ( 1 usr)
% 0.14/0.34 % Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% 0.14/0.34 % Number of symbols : 1 ( 0 usr; 0 con; 2-2 aty)
% 0.14/0.34 % Number of variables : 2 ( 0 ^; 2 !; 0 ?; 2 :)
% 0.14/0.34 % SPC : TH0_THM_EQU_NAR
% 0.14/0.34
% 0.14/0.34 % Comments : This problem is from the TPS library. Copyright (c) 2009 The TPS
% 0.14/0.34 % project in the Department of Mathematical Sciences at Carnegie
% 0.14/0.34 % Mellon University. Distributed under the Creative Commons copyleft
% 0.14/0.34 % license: http://creativecommons.org/licenses/by-sa/3.0/
% 0.14/0.34 % : Polymorphic definitions expanded.
% 0.14/0.34 %------------------------------------------------------------------------------
% 0.14/0.34 thf(a_type,type,
% 0.14/0.34 a: $tType ).
% 0.14/0.34
% 0.14/0.34 thf(cTHM181_pme,conjecture,
% 0.14/0.34 ! [Xx: a,Xy: a] : ( Xy = Xy ) ).
% 0.14/0.34
% 0.14/0.34 %------------------------------------------------------------------------------
% 0.14/0.34 ------------------------
% 1.03/0.94 ---- Embedded in THF ---
% 1.03/0.94 %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.03/0.94 %%% Generated on Tue Feb 24 12:41:01 EST 2026
% 1.03/0.94 %%% using '$$dhol' embedding, version 1.3.0.
% 1.03/0.94 %%% Logic specification used:
% 1.03/0.94 %%% thf(spec, logic, $$dhol).
% 1.03/0.94
% 1.03/0.94 % SZS output start ListOfTHF for /export/starexec/sandbox/tmp/tmp.lTq5ZFabWb/DTF2DTF15624.p
% See solution above
% 1.03/0.94 ------------------------
% 1.03/0.95 ---- Cleaned THF ---
% 1.03/0.95 thf(a_type,type,
% 1.03/0.95 a: $tType ).
% 1.03/0.95
% 1.03/0.95 thf(cTHM181_pme,conjecture,
% 1.03/0.95 ! [Xx: a,Xy: a] : ( Xy = Xy ) ).
% 1.03/0.95 ------------------------
% 1.03/0.96 % (15723)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on DTF2THF_15624 for (3000ds/183Mi)
% 1.03/0.96 % (15723)First to succeed.
% 1.03/0.96 % (15723)Refutation found. Thanks to Tanya!
% 1.03/0.96 % SZS status Theorem for DTF2THF_15624
% 1.03/0.96 % SZS output start Proof for DTF2THF_15624
% 1.03/0.96 tff(type_def_5, type, a: $tType).
% 1.03/0.96 tff(func_def_0, type, a: $tType).
% 1.03/0.96 tff(func_def_1, type, sK0: a).
% 1.03/0.96 tff(f9,plain,(
% 1.03/0.96 $false),
% 1.03/0.96 inference(trivial_inequality_removal,[status(thm)],[f8])).
% 1.03/0.96 tff(f8,plain,(
% 1.03/0.96 sK0 != sK0),
% 1.03/0.96 inference(cnf_transformation,[status(thm)],[f7])).
% 1.03/0.96 tff(f7,plain,(
% 1.03/0.96 sK0 != sK0),
% 1.03/0.96 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f5,f6])).
% 1.03/0.96 tff(f6,plain,(
% 1.03/0.96 ? [X0 : a] : X0 != X0 => sK0 != sK0),
% 1.03/0.96 introduced(definition,[],[choice_axiom])).
% 1.03/0.96 tff(f5,plain,(
% 1.03/0.96 ? [X0 : a] : X0 != X0),
% 1.03/0.96 inference(rectify,[status(thm)],[f4])).
% 1.03/0.96 tff(f4,plain,(
% 1.03/0.96 ? [X1 : a] : X1 != X1),
% 1.03/0.96 inference(ennf_transformation,[status(thm)],[f3])).
% 1.03/0.96 tff(f3,plain,(
% 1.03/0.96 ~! [X1 : a] : X1 = X1),
% 1.03/0.96 inference(rectify,[status(thm)],[f2])).
% 1.03/0.96 tff(f2,negated_conjecture,(
% 1.03/0.96 ~! [X0 : a,X1 : a] : X1 = X1),
% 1.03/0.96 inference(negated_conjecture,[status(cth)],[f1])).
% 1.03/0.96 tff(f1,conjecture,(
% 1.03/0.96 ! [X0 : a,X1 : a] : X1 = X1),
% 1.03/0.96 file('/export/starexec/sandbox/tmp/tmp.lTq5ZFabWb/DTF2THF_15624.p',cTHM181_pme)).
% 1.03/0.96 % SZS output end Proof for DTF2THF_15624
% 1.03/0.96 % (15723)------------------------------
% 1.03/0.96 % (15723)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.03/0.96 % (15723)Termination reason: Refutation
% 1.03/0.96
% 1.03/0.96 % (15723)Memory used [KB]: 5373
% 1.03/0.96 % (15723)Time elapsed: 0.002 s
% 1.03/0.96 % (15723)------------------------------
% 1.03/0.96 % (15723)------------------------------
% 1.03/0.96 % (15722)Success in time 0.01 s
%------------------------------------------------------------------------------