%------------------------------------------------------------------------------
% File : DT2H2X---1.9.5
% Problem : SYO390^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 : n028.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:54:07 AM UTC 2026
% Result : Theorem 1.65s 1.46s
% Output : Refutation 1.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 2
% Syntax : Number of formulae : 12 ( 7 unt; 0 typ; 0 def)
% Number of atoms : 33 ( 18 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 23 ( 10 ~; 0 |; 5 &)
% ( 3 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 42 ( 14 fml; 28 var)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 3 prp; 0-2 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 14 ( 8 !; 6 ?; 14 :)
% Comments :
%------------------------------------------------------------------------------
tff(f14,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[f13]) ).
tff(f13,plain,
sK1 != sK1,
inference(definition_unfolding,[status(thm)],[f11,f12]) ).
tff(f12,plain,
sK0 = sK1,
inference(cnf_transformation,[status(thm)],[f10]) ).
tff(f10,plain,
( ( sK0 = sK1 )
& ( sK0 != sK1 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f8,f9]) ).
tff(f9,plain,
( ? [X0: $o,X1: $o] :
( ( (X0) = (X1) )
& ( (X0) != (X1) ) )
=> ( ( sK0 = sK1 )
& ( sK0 != sK1 ) ) ),
introduced(definition,[],[choice_axiom]) ).
tff(f8,plain,
? [X0: $o,X1: $o] :
( ( (X0) = (X1) )
& ( (X0) != (X1) ) ),
inference(rectify,[status(thm)],[f7]) ).
tff(f7,plain,
? [X1: $o,X0: $o] :
( ( (X0) = (X1) )
& ( (X0) != (X1) ) ),
inference(ennf_transformation,[status(thm)],[f6]) ).
tff(f6,plain,
~ ! [X1: $o,X0: $o] :
( ( (X0) = (X1) )
=> ( (X0) = (X1) ) ),
inference(fool_elimination,[status(thm)],[f5]) ).
tff(f5,plain,
~ ! [X0: $o,X1: $o] :
( ( (X0)
<=> (X1) )
=> ( (X0) = (X1) ) ),
inference(rectify,[status(thm)],[f2]) ).
tff(f2,negated_conjecture,
~ ! [X0: $o,X1: $o] :
( ( (X0)
<=> (X1) )
=> ( (X0) = (X1) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
tff(f1,conjecture,
! [X0: $o,X1: $o] :
( ( (X0)
<=> (X1) )
=> ( (X0) = (X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.bSHybZqPlD/DTF2THF_32306.p',cEXT_eq_0) ).
tff(f11,plain,
sK0 != sK1,
inference(cnf_transformation,[status(thm)],[f10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SYO390^5 : TPTP v9.2.1. Released v4.0.0.
% 0.12/0.13 % Command : /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.14/0.33 % Computer : n028.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 300
% 0.14/0.33 % WCLimit : 300
% 0.14/0.33 % DateTime : Tue Feb 24 14:29:57 EST 2026
% 0.14/0.34 % CPUTime :
% 0.14/0.34 Running /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.32/0.49 ---- Original DTF file ---
% 0.32/0.49 thf(spec,logic,$$dhol).
% 0.32/0.49 %------------------------------------------------------------------------------
% 0.32/0.49 % File : SYO390^5 : TPTP v9.2.1. Released v4.0.0.
% 0.32/0.49 % Domain : Syntactic
% 0.32/0.49 % Problem : TPS problem UNKNOWN
% 0.32/0.49 % Version : Especial.
% 0.32/0.49 % English :
% 0.32/0.49
% 0.32/0.49 % Refs : [Bro09] Brown (2009), Email to Geoff Sutcliffe
% 0.32/0.49 % Source : [Bro09]
% 0.32/0.49 % Names : tps_0667 [Bro09]
% 0.32/0.49
% 0.32/0.49 % Status : Theorem
% 0.32/0.49 % Rating : 0.00 v7.4.0, 0.11 v7.2.0, 0.00 v7.1.0, 0.12 v7.0.0, 0.14 v6.4.0, 0.17 v6.3.0, 0.20 v6.2.0, 0.14 v5.5.0, 0.17 v5.4.0, 0.20 v4.1.0, 0.00 v4.0.0
% 0.32/0.49 % Syntax : Number of formulae : 1 ( 1 unt; 0 typ; 0 def)
% 0.32/0.49 % Number of atoms : 1 ( 1 equ; 0 cnn)
% 0.32/0.49 % Maximal formula atoms : 1 ( 1 avg)
% 0.32/0.49 % Number of connectives : 2 ( 0 ~; 0 |; 0 &; 0 @)
% 0.32/0.49 % ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% 0.32/0.49 % Maximal formula depth : 5 ( 5 avg)
% 0.32/0.49 % Number of types : 1 ( 0 usr)
% 0.32/0.49 % Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% 0.32/0.49 % Number of symbols : 1 ( 0 usr; 0 con; 2-2 aty)
% 0.32/0.49 % Number of variables : 2 ( 0 ^; 2 !; 0 ?; 2 :)
% 0.32/0.49 % SPC : TH0_THM_EQU_NAR
% 0.32/0.49
% 0.32/0.49 % Comments : This problem is from the TPS library. Copyright (c) 2009 The TPS
% 0.32/0.49 % project in the Department of Mathematical Sciences at Carnegie
% 0.32/0.49 % Mellon University. Distributed under the Creative Commons copyleft
% 0.32/0.49 % license: http://creativecommons.org/licenses/by-sa/3.0/
% 0.32/0.49 %------------------------------------------------------------------------------
% 0.32/0.49 thf(cEXT_eq_0,conjecture,
% 0.32/0.49 ! [Xp: $o,Xq: $o] :
% 0.32/0.49 ( ( Xp
% 0.32/0.49 <=> Xq )
% 0.32/0.49 => ( Xp = Xq ) ) ).
% 0.32/0.49
% 0.32/0.49 %------------------------------------------------------------------------------
% 0.32/0.49 ------------------------
% 1.65/1.43 ---- Embedded in THF ---
% 1.65/1.43 %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.65/1.43 %%% Generated on Tue Feb 24 14:29:58 EST 2026
% 1.65/1.43 %%% using '$$dhol' embedding, version 1.3.0.
% 1.65/1.43 %%% Logic specification used:
% 1.65/1.43 %%% thf(spec, logic, $$dhol).
% 1.65/1.43
% 1.65/1.43 % SZS output start ListOfTHF for /export/starexec/sandbox/tmp/tmp.bSHybZqPlD/DTF2DTF32306.p
% See solution above
% 1.65/1.43 ------------------------
% 1.65/1.44 ---- Cleaned THF ---
% 1.65/1.44 thf(cEXT_eq_0,conjecture,
% 1.65/1.44 ! [Xp: $o,Xq: $o] :
% 1.65/1.44 ( ( Xp
% 1.65/1.44 <=> Xq )
% 1.65/1.44 => ( Xp = Xq ) ) ).
% 1.65/1.44 ------------------------
% 1.65/1.46 % (32446)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on DTF2THF_32306 for (3000ds/2Mi)
% 1.65/1.46 % (32443)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on DTF2THF_32306 for (3000ds/183Mi)
% 1.65/1.46 % (32445)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on DTF2THF_32306 for (3000ds/27Mi)
% 1.65/1.46 % (32448)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on DTF2THF_32306 for (3000ds/275Mi)
% 1.65/1.46 % (32449)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on DTF2THF_32306 for (3000ds/18Mi)
% 1.65/1.46 % (32444)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on DTF2THF_32306 for (3000ds/4Mi)
% 1.65/1.46 % (32446)First to succeed.
% 1.65/1.46 % (32443)Also succeeded, but the first one will report.
% 1.65/1.46 % (32447)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on DTF2THF_32306 for (3000ds/2Mi)
% 1.65/1.46 % (32448)Also succeeded, but the first one will report.
% 1.65/1.46 % (32446)Refutation found. Thanks to Tanya!
% 1.65/1.46 % SZS status Theorem for DTF2THF_32306
% 1.65/1.46 % SZS output start Proof for DTF2THF_32306
% 1.65/1.46 tff(f14,plain,(
% 1.65/1.46 $false),
% 1.65/1.46 inference(trivial_inequality_removal,[status(thm)],[f13])).
% 1.65/1.46 tff(f13,plain,(
% 1.65/1.46 (sK1 != sK1)),
% 1.65/1.46 inference(definition_unfolding,[status(thm)],[f11,f12])).
% 1.65/1.46 tff(f12,plain,(
% 1.65/1.46 (sK0 = sK1)),
% 1.65/1.46 inference(cnf_transformation,[status(thm)],[f10])).
% 1.65/1.46 tff(f10,plain,(
% 1.65/1.46 (sK0 = sK1) & (sK0 != sK1)),
% 1.65/1.46 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f8,f9])).
% 1.65/1.46 tff(f9,plain,(
% 1.65/1.46 ? [X0 : $o,X1 : $o] : ((X0 = X1) & (X0 != X1)) => ((sK0 = sK1) & (sK0 != sK1))),
% 1.65/1.46 introduced(definition,[],[choice_axiom])).
% 1.65/1.46 tff(f8,plain,(
% 1.65/1.46 ? [X0 : $o,X1 : $o] : ((X0 = X1) & (X0 != X1))),
% 1.65/1.46 inference(rectify,[status(thm)],[f7])).
% 1.65/1.46 tff(f7,plain,(
% 1.65/1.46 ? [X1 : $o,X0 : $o] : ((X0 = X1) & (X0 != X1))),
% 1.65/1.46 inference(ennf_transformation,[status(thm)],[f6])).
% 1.65/1.46 tff(f6,plain,(
% 1.65/1.46 ~! [X1 : $o,X0 : $o] : ((X0 = X1) => (X0 = X1))),
% 1.65/1.46 inference(fool_elimination,[status(thm)],[f5])).
% 1.65/1.46 tff(f5,plain,(
% 1.65/1.46 ~! [X0 : $o,X1 : $o] : ((X0 <=> X1) => (X0 = X1))),
% 1.65/1.46 inference(rectify,[status(thm)],[f2])).
% 1.65/1.46 tff(f2,negated_conjecture,(
% 1.65/1.46 ~! [X0 : $o,X1 : $o] : ((X0 <=> X1) => (X0 = X1))),
% 1.65/1.46 inference(negated_conjecture,[status(cth)],[f1])).
% 1.65/1.46 tff(f1,conjecture,(
% 1.65/1.46 ! [X0 : $o,X1 : $o] : ((X0 <=> X1) => (X0 = X1))),
% 1.65/1.46 file('/export/starexec/sandbox/tmp/tmp.bSHybZqPlD/DTF2THF_32306.p',cEXT_eq_0)).
% 1.65/1.46 tff(f11,plain,(
% 1.65/1.46 (sK0 != sK1)),
% 1.65/1.46 inference(cnf_transformation,[status(thm)],[f10])).
% 1.65/1.46 % SZS output end Proof for DTF2THF_32306
% 1.65/1.46 % (32446)------------------------------
% 1.65/1.46 % (32446)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.65/1.46 % (32446)Termination reason: Refutation
% 1.65/1.46
% 1.65/1.46 % (32446)Memory used [KB]: 5373
% 1.65/1.46 % (32446)Time elapsed: 0.003 s
% 1.65/1.46 % (32446)Instructions burned: 1 (million)
% 1.65/1.46 % (32446)------------------------------
% 1.65/1.46 % (32446)------------------------------
% 1.65/1.46 % (32442)Success in time 0.018 s
%------------------------------------------------------------------------------