%------------------------------------------------------------------------------
% File : DT2H2X---1.9.5
% Problem : SYO207^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 : n003.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:53:40 AM UTC 2026
% Result : Theorem 1.52s 1.33s
% Output : Refutation 1.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 2
% Syntax : Number of formulae : 13 ( 5 unt; 0 typ; 0 def)
% Number of atoms : 65 ( 36 equ)
% Maximal formula atoms : 8 ( 5 avg)
% Number of connectives : 35 ( 15 ~; 12 |; 5 &)
% ( 1 <=>; 1 =>; 0 <=; 1 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 72 ( 32 fml; 40 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 ( 6 !; 8 ?; 14 :)
% Comments :
%------------------------------------------------------------------------------
tff(f15,plain,
$false,
inference(subsumption_resolution,[status(thm)],[f13,f14]) ).
tff(f14,plain,
sK1 != sK0,
inference(duplicate_literal_removal,[status(thm)],[f12]) ).
tff(f12,plain,
( ( sK1 != sK0 )
| ( sK1 != sK0 ) ),
inference(cnf_transformation,[status(thm)],[f10]) ).
tff(f10,plain,
( ( ( sK1 != sK0 )
| ( sK1 != sK0 ) )
& ( ( sK1 = sK0 )
| ( sK1 = sK0 ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f8,f9]) ).
tff(f9,plain,
( ? [X0: $o,X1: $o] :
( ( ( (X0) != (X1) )
| ( (X0) != (X1) ) )
& ( ( (X0) = (X1) )
| ( (X0) = (X1) ) ) )
=> ( ( ( sK1 != sK0 )
| ( sK1 != sK0 ) )
& ( ( sK1 = sK0 )
| ( sK1 = sK0 ) ) ) ),
introduced(definition,[],[choice_axiom]) ).
tff(f8,plain,
? [X0: $o,X1: $o] :
( ( ( (X0) != (X1) )
| ( (X0) != (X1) ) )
& ( ( (X0) = (X1) )
| ( (X0) = (X1) ) ) ),
inference(rectify,[status(thm)],[f7]) ).
tff(f7,plain,
? [X1: $o,X0: $o] :
( ( ( (X0) != (X1) )
| ( (X0) != (X1) ) )
& ( ( (X0) = (X1) )
| ( (X0) = (X1) ) ) ),
inference(nnf_transformation,[status(thm)],[f6]) ).
tff(f6,plain,
? [X1: $o,X0: $o] :
( ( (X0) = (X1) )
<~> ( (X0) = (X1) ) ),
inference(ennf_transformation,[status(thm)],[f5]) ).
tff(f5,plain,
~ ! [X0: $o,X1: $o] :
( ( (X0) = (X1) )
<=> ( (X0) = (X1) ) ),
inference(fool_elimination,[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.jCUAKK4psH/DTF2THF_2401.p',cCT26) ).
tff(f13,plain,
sK1 = sK0,
inference(duplicate_literal_removal,[status(thm)],[f11]) ).
tff(f11,plain,
( ( sK1 = sK0 )
| ( sK1 = sK0 ) ),
inference(cnf_transformation,[status(thm)],[f10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : SYO207^5 : TPTP v9.2.1. Released v4.0.0.
% 0.00/0.10 % Command : /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.11/0.29 % Computer : n003.cluster.edu
% 0.11/0.29 % Model : x86_64 x86_64
% 0.11/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.29 % Memory : 8042.1875MB
% 0.11/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.29 % CPULimit : 300
% 0.11/0.29 % WCLimit : 300
% 0.11/0.29 % DateTime : Tue Feb 24 14:25:40 EST 2026
% 0.11/0.30 % CPUTime :
% 0.11/0.30 Running /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.16/0.39 ---- Original DTF file ---
% 0.16/0.39 thf(spec,logic,$$dhol).
% 0.16/0.39 %------------------------------------------------------------------------------
% 0.16/0.39 % File : SYO207^5 : TPTP v9.2.1. Released v4.0.0.
% 0.16/0.39 % Domain : Syntactic
% 0.16/0.39 % Problem : TPS problem CT26
% 0.16/0.39 % Version : Especial.
% 0.16/0.39 % English :
% 0.16/0.39
% 0.16/0.39 % Refs : [Bro09] Brown (2009), Email to Geoff Sutcliffe
% 0.16/0.39 % Source : [Bro09]
% 0.16/0.39 % Names : tps_0173 [Bro09]
% 0.16/0.39 % : CT23B [TPS]
% 0.16/0.39 % : CT26 [TPS]
% 0.16/0.39
% 0.16/0.39 % Status : Theorem
% 0.16/0.39 % Rating : 0.00 v7.5.0, 0.14 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.16/0.39 % Syntax : Number of formulae : 1 ( 1 unt; 0 typ; 0 def)
% 0.16/0.39 % Number of atoms : 3 ( 3 equ; 0 cnn)
% 0.16/0.39 % Maximal formula atoms : 1 ( 3 avg)
% 0.16/0.39 % Number of connectives : 0 ( 0 ~; 0 |; 0 &; 0 @)
% 0.16/0.39 % ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% 0.16/0.39 % Maximal formula depth : 3 ( 3 avg)
% 0.16/0.39 % Number of types : 1 ( 0 usr)
% 0.16/0.39 % Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% 0.16/0.39 % Number of symbols : 1 ( 0 usr; 0 con; 2-2 aty)
% 0.16/0.39 % Number of variables : 2 ( 0 ^; 2 !; 0 ?; 2 :)
% 0.16/0.39 % SPC : TH0_THM_EQU_NAR
% 0.16/0.39
% 0.16/0.39 % Comments : This problem is from the TPS library. Copyright (c) 2009 The TPS
% 0.16/0.39 % project in the Department of Mathematical Sciences at Carnegie
% 0.16/0.39 % Mellon University. Distributed under the Creative Commons copyleft
% 0.16/0.39 % license: http://creativecommons.org/licenses/by-sa/3.0/
% 0.16/0.39 %------------------------------------------------------------------------------
% 0.16/0.39 thf(cCT26,conjecture,
% 0.16/0.39 ! [Xx: $o,Xy: $o] :
% 0.16/0.39 ( ( Xx = Xy )
% 0.16/0.39 = ( Xy = Xx ) ) ).
% 0.16/0.39
% 0.16/0.39 %------------------------------------------------------------------------------
% 0.16/0.39 ------------------------
% 1.34/1.29 ---- Embedded in THF ---
% 1.34/1.30 %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.34/1.30 %%% Generated on Tue Feb 24 14:25:41 EST 2026
% 1.34/1.30 %%% using '$$dhol' embedding, version 1.3.0.
% 1.34/1.30 %%% Logic specification used:
% 1.34/1.30 %%% thf(spec, logic, $$dhol).
% 1.34/1.30
% 1.34/1.30 % SZS output start ListOfTHF for /export/starexec/sandbox/tmp/tmp.jCUAKK4psH/DTF2DTF2401.p
% See solution above
% 1.34/1.30 ------------------------
% 1.52/1.30 ---- Cleaned THF ---
% 1.52/1.30 thf(cCT26,conjecture,
% 1.52/1.30 ! [Xx: $o,Xy: $o] :
% 1.52/1.30 ( ( Xx = Xy )
% 1.52/1.30 = ( Xy = Xx ) ) ).
% 1.52/1.31 ------------------------
% 1.52/1.32 % (2499)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on DTF2THF_2401 for (3000ds/183Mi)
% 1.52/1.32 % (2500)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_2401 for (3000ds/4Mi)
% 1.52/1.32 % (2502)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on DTF2THF_2401 for (3000ds/2Mi)
% 1.52/1.32 % (2501)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_2401 for (3000ds/27Mi)
% 1.52/1.32 % (2503)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_2401 for (3000ds/2Mi)
% 1.52/1.32 % (2504)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_2401 for (3000ds/275Mi)
% 1.52/1.32 % (2505)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on DTF2THF_2401 for (3000ds/18Mi)
% 1.52/1.33 % (2499)First to succeed.
% 1.52/1.33 % (2504)Also succeeded, but the first one will report.
% 1.52/1.33 % (2501)Also succeeded, but the first one will report.
% 1.52/1.33 % (2499)Refutation found. Thanks to Tanya!
% 1.52/1.33 % SZS status Theorem for DTF2THF_2401
% 1.52/1.33 % SZS output start Proof for DTF2THF_2401
% 1.52/1.33 tff(f15,plain,(
% 1.52/1.33 $false),
% 1.52/1.33 inference(subsumption_resolution,[status(thm)],[f13,f14])).
% 1.52/1.33 tff(f14,plain,(
% 1.52/1.33 (sK1 != sK0)),
% 1.52/1.33 inference(duplicate_literal_removal,[status(thm)],[f12])).
% 1.52/1.33 tff(f12,plain,(
% 1.52/1.33 (sK1 != sK0) | (sK1 != sK0)),
% 1.52/1.33 inference(cnf_transformation,[status(thm)],[f10])).
% 1.52/1.33 tff(f10,plain,(
% 1.52/1.33 ((sK1 != sK0) | (sK1 != sK0)) & ((sK1 = sK0) | (sK1 = sK0))),
% 1.52/1.33 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f8,f9])).
% 1.52/1.33 tff(f9,plain,(
% 1.52/1.33 ? [X0 : $o,X1 : $o] : (((X0 != X1) | (X0 != X1)) & ((X0 = X1) | (X0 = X1))) => (((sK1 != sK0) | (sK1 != sK0)) & ((sK1 = sK0) | (sK1 = sK0)))),
% 1.52/1.33 introduced(definition,[],[choice_axiom])).
% 1.52/1.33 tff(f8,plain,(
% 1.52/1.33 ? [X0 : $o,X1 : $o] : (((X0 != X1) | (X0 != X1)) & ((X0 = X1) | (X0 = X1)))),
% 1.52/1.33 inference(rectify,[status(thm)],[f7])).
% 1.52/1.33 tff(f7,plain,(
% 1.52/1.33 ? [X1 : $o,X0 : $o] : (((X0 != X1) | (X0 != X1)) & ((X0 = X1) | (X0 = X1)))),
% 1.52/1.33 inference(nnf_transformation,[status(thm)],[f6])).
% 1.52/1.33 tff(f6,plain,(
% 1.52/1.33 ? [X1 : $o,X0 : $o] : ((X0 = X1) <~> (X0 = X1))),
% 1.52/1.33 inference(ennf_transformation,[status(thm)],[f5])).
% 1.52/1.33 tff(f5,plain,(
% 1.52/1.33 ~! [X0 : $o,X1 : $o] : ((X0 = X1) <=> (X0 = X1))),
% 1.52/1.33 inference(fool_elimination,[status(thm)],[f2])).
% 1.52/1.33 tff(f2,negated_conjecture,(
% 1.52/1.33 ~! [X0 : $o,X1 : $o] : ((X0 = X1) = (X0 = X1))),
% 1.52/1.33 inference(negated_conjecture,[status(cth)],[f1])).
% 1.52/1.33 tff(f1,conjecture,(
% 1.52/1.33 ! [X0 : $o,X1 : $o] : ((X0 = X1) = (X0 = X1))),
% 1.52/1.33 file('/export/starexec/sandbox/tmp/tmp.jCUAKK4psH/DTF2THF_2401.p',cCT26)).
% 1.52/1.33 tff(f13,plain,(
% 1.52/1.33 (sK1 = sK0)),
% 1.52/1.33 inference(duplicate_literal_removal,[status(thm)],[f11])).
% 1.52/1.33 tff(f11,plain,(
% 1.52/1.33 (sK1 = sK0) | (sK1 = sK0)),
% 1.52/1.33 inference(cnf_transformation,[status(thm)],[f10])).
% 1.52/1.33 % SZS output end Proof for DTF2THF_2401
% 1.52/1.33 % (2499)------------------------------
% 1.52/1.33 % (2499)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.52/1.33 % (2499)Termination reason: Refutation
% 1.52/1.33
% 1.52/1.33 % (2499)Memory used [KB]: 5373
% 1.52/1.33 % (2499)Time elapsed: 0.003 s
% 1.52/1.33 % (2499)Instructions burned: 1 (million)
% 1.52/1.33 % (2499)------------------------------
% 1.52/1.33 % (2499)------------------------------
% 1.52/1.33 % (2498)Success in time 0.018 s
%------------------------------------------------------------------------------