%------------------------------------------------------------------------------
% File : DT2H2X---1.9.5
% Problem : SET625^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:31:58 AM UTC 2026
% Result : Theorem 1.50s 1.24s
% Output : Refutation 1.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 3
% Syntax : Number of formulae : 19 ( 5 unt; 0 typ; 0 def)
% Number of atoms : 145 ( 58 equ; 0 cnn)
% Maximal formula atoms : 12 ( 7 avg)
% Number of connectives : 160 ( 28 ~; 16 |; 32 &; 74 @)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 6 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 24 ( 24 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 56 ( 0 ^; 30 !; 26 ?; 56 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(func_def_0,type,
a: $tType ).
thf(func_def_4,type,
sK0: a > $o ).
thf(func_def_5,type,
sK1: a > $o ).
thf(func_def_6,type,
sK2: a > $o ).
thf(func_def_7,type,
sK3: a ).
thf(f20,plain,
$false,
inference(subsumption_resolution,[status(thm)],[f19,f17]) ).
thf(f17,plain,
( ( sK1 @ sK3 )
= $true ),
inference(trivial_inequality_removal,[status(thm)],[f16]) ).
thf(f16,plain,
( ( $true != $true )
| ( ( sK1 @ sK3 )
= $true ) ),
inference(superposition,[status(thm)],[f12,f14]) ).
thf(f14,plain,
( ( sK0 @ sK3 )
= $true ),
inference(cnf_transformation,[status(thm)],[f11]) ).
thf(f11,plain,
( ! [X3: a] :
( ( $true
!= ( sK2 @ X3 ) )
| ( ( sK1 @ X3 )
!= $true ) )
& ( ( sK0 @ sK3 )
= $true )
& ( ( sK2 @ sK3 )
= $true )
& ! [X5: a] :
( ( ( sK0 @ X5 )
!= $true )
| ( ( sK1 @ X5 )
= $true ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f8,f10,f9]) ).
thf(f9,plain,
( ? [X0: a > $o,X1: a > $o,X2: a > $o] :
( ! [X3: a] :
( ( ( X2 @ X3 )
!= $true )
| ( ( X1 @ X3 )
!= $true ) )
& ? [X4: a] :
( ( $true
= ( X0 @ X4 ) )
& ( ( X2 @ X4 )
= $true ) )
& ! [X5: a] :
( ( ( X0 @ X5 )
!= $true )
| ( ( X1 @ X5 )
= $true ) ) )
=> ( ! [X3: a] :
( ( $true
!= ( sK2 @ X3 ) )
| ( ( sK1 @ X3 )
!= $true ) )
& ? [X4: a] :
( ( ( sK0 @ X4 )
= $true )
& ( ( sK2 @ X4 )
= $true ) )
& ! [X5: a] :
( ( ( sK0 @ X5 )
!= $true )
| ( ( sK1 @ X5 )
= $true ) ) ) ),
introduced(definition,[],[choice_axiom]) ).
thf(f10,plain,
( ? [X4: a] :
( ( ( sK0 @ X4 )
= $true )
& ( ( sK2 @ X4 )
= $true ) )
=> ( ( ( sK0 @ sK3 )
= $true )
& ( ( sK2 @ sK3 )
= $true ) ) ),
introduced(definition,[],[choice_axiom]) ).
thf(f8,plain,
? [X0: a > $o,X1: a > $o,X2: a > $o] :
( ! [X3: a] :
( ( ( X2 @ X3 )
!= $true )
| ( ( X1 @ X3 )
!= $true ) )
& ? [X4: a] :
( ( $true
= ( X0 @ X4 ) )
& ( ( X2 @ X4 )
= $true ) )
& ! [X5: a] :
( ( ( X0 @ X5 )
!= $true )
| ( ( X1 @ X5 )
= $true ) ) ),
inference(rectify,[status(thm)],[f7]) ).
thf(f7,plain,
? [X0: a > $o,X2: a > $o,X1: a > $o] :
( ! [X5: a] :
( ( ( X1 @ X5 )
!= $true )
| ( ( X2 @ X5 )
!= $true ) )
& ? [X3: a] :
( ( ( X0 @ X3 )
= $true )
& ( ( X1 @ X3 )
= $true ) )
& ! [X4: a] :
( ( $true
!= ( X0 @ X4 ) )
| ( ( X2 @ X4 )
= $true ) ) ),
inference(flattening,[status(thm)],[f6]) ).
thf(f6,plain,
? [X0: a > $o,X1: a > $o,X2: a > $o] :
( ! [X5: a] :
( ( ( X1 @ X5 )
!= $true )
| ( ( X2 @ X5 )
!= $true ) )
& ? [X3: a] :
( ( ( X0 @ X3 )
= $true )
& ( ( X1 @ X3 )
= $true ) )
& ! [X4: a] :
( ( $true
!= ( X0 @ X4 ) )
| ( ( X2 @ X4 )
= $true ) ) ),
inference(ennf_transformation,[status(thm)],[f5]) ).
thf(f5,plain,
~ ! [X0: a > $o,X1: a > $o,X2: a > $o] :
( ( ? [X3: a] :
( ( ( X0 @ X3 )
= $true )
& ( ( X1 @ X3 )
= $true ) )
& ! [X4: a] :
( ( $true
= ( X0 @ X4 ) )
=> ( ( X2 @ X4 )
= $true ) ) )
=> ? [X5: a] :
( ( ( X1 @ X5 )
= $true )
& ( ( X2 @ X5 )
= $true ) ) ),
inference(fool_elimination,[status(thm)],[f4]) ).
thf(f4,plain,
~ ! [X0: a > $o,X1: a > $o,X2: a > $o] :
( ( ? [X3: a] :
( ( X1 @ X3 )
& ( X0 @ X3 ) )
& ! [X4: a] :
( ( X0 @ X4 )
=> ( X2 @ X4 ) ) )
=> ? [X5: a] :
( ( X2 @ X5 )
& ( X1 @ X5 ) ) ),
inference(rectify,[status(thm)],[f2]) ).
thf(f2,negated_conjecture,
~ ! [X1: a > $o,X0: a > $o,X2: a > $o] :
( ( ? [X3: a] :
( ( X0 @ X3 )
& ( X1 @ X3 ) )
& ! [X3: a] :
( ( X1 @ X3 )
=> ( X2 @ X3 ) ) )
=> ? [X3: a] :
( ( X2 @ X3 )
& ( X0 @ X3 ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f1,conjecture,
! [X1: a > $o,X0: a > $o,X2: a > $o] :
( ( ? [X3: a] :
( ( X0 @ X3 )
& ( X1 @ X3 ) )
& ! [X3: a] :
( ( X1 @ X3 )
=> ( X2 @ X3 ) ) )
=> ? [X3: a] :
( ( X2 @ X3 )
& ( X0 @ X3 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.QRalezMciq/DTF2THF_23753.p',cBOOL_PROP_101_pme) ).
thf(f12,plain,
! [X5: a] :
( ( ( sK0 @ X5 )
!= $true )
| ( ( sK1 @ X5 )
= $true ) ),
inference(cnf_transformation,[status(thm)],[f11]) ).
thf(f19,plain,
( ( sK1 @ sK3 )
!= $true ),
inference(trivial_inequality_removal,[status(thm)],[f18]) ).
thf(f18,plain,
( ( $true != $true )
| ( ( sK1 @ sK3 )
!= $true ) ),
inference(superposition,[status(thm)],[f15,f13]) ).
thf(f13,plain,
( ( sK2 @ sK3 )
= $true ),
inference(cnf_transformation,[status(thm)],[f11]) ).
thf(f15,plain,
! [X3: a] :
( ( $true
!= ( sK2 @ X3 ) )
| ( ( sK1 @ X3 )
!= $true ) ),
inference(cnf_transformation,[status(thm)],[f11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET625^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.16/0.34 % Computer : n028.cluster.edu
% 0.16/0.34 % Model : x86_64 x86_64
% 0.16/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.34 % Memory : 8042.1875MB
% 0.16/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.34 % CPULimit : 300
% 0.16/0.34 % WCLimit : 300
% 0.16/0.34 % DateTime : Tue Feb 24 12:00:57 EST 2026
% 0.16/0.34 % CPUTime :
% 0.16/0.34 Running /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.19/0.44 ---- Original DTF file ---
% 0.19/0.44 thf(spec,logic,$$dhol).
% 0.19/0.44 %------------------------------------------------------------------------------
% 0.19/0.44 % File : SET625^5 : TPTP v9.2.1. Released v4.0.0.
% 0.19/0.44 % Domain : Set Theory
% 0.19/0.44 % Problem : TPS problem BOOL-PROP-101
% 0.19/0.44 % Version : Especial.
% 0.19/0.44 % English : Trybulec's 101th Boolean property of sets
% 0.19/0.44
% 0.19/0.44 % Refs : [TS89] Trybulec & Swieczkowska (1989), Boolean Properties of
% 0.19/0.44 % : [Bro09] Brown (2009), Email to Geoff Sutcliffe
% 0.19/0.44 % Source : [Bro09]
% 0.19/0.44 % Names : tps_0237 [Bro09]
% 0.19/0.44 % : BOOL-PROP-101 [TPS]
% 0.19/0.44
% 0.19/0.44 % Status : Theorem
% 0.19/0.44 % Rating : 0.00 v6.1.0, 0.17 v6.0.0, 0.00 v4.0.0
% 0.19/0.44 % Syntax : Number of formulae : 2 ( 0 unt; 1 typ; 0 def)
% 0.19/0.44 % Number of atoms : 0 ( 0 equ; 0 cnn)
% 0.19/0.44 % Maximal formula atoms : 0 ( 0 avg)
% 0.19/0.44 % Number of connectives : 11 ( 0 ~; 0 |; 3 &; 6 @)
% 0.19/0.44 % ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% 0.19/0.44 % Maximal formula depth : 9 ( 9 avg)
% 0.19/0.44 % Number of types : 2 ( 1 usr)
% 0.19/0.44 % Number of type conns : 3 ( 3 >; 0 *; 0 +; 0 <<)
% 0.19/0.44 % Number of symbols : 0 ( 0 usr; 0 con; --- aty)
% 0.19/0.44 % Number of variables : 6 ( 0 ^; 4 !; 2 ?; 6 :)
% 0.19/0.44 % SPC : TH0_THM_NEQ_NAR
% 0.19/0.44
% 0.19/0.44 % Comments : This problem is from the TPS library. Copyright (c) 2009 The TPS
% 0.19/0.44 % project in the Department of Mathematical Sciences at Carnegie
% 0.19/0.44 % Mellon University. Distributed under the Creative Commons copyleft
% 0.19/0.44 % license: http://creativecommons.org/licenses/by-sa/3.0/
% 0.19/0.44 % : Polymorphic definitions expanded.
% 0.19/0.44 %------------------------------------------------------------------------------
% 0.19/0.44 thf(a_type,type,
% 0.19/0.44 a: $tType ).
% 0.19/0.44
% 0.19/0.44 thf(cBOOL_PROP_101_pme,conjecture,
% 0.19/0.44 ! [X: a > $o,Y: a > $o,Z: a > $o] :
% 0.19/0.44 ( ( ? [Xx: a] :
% 0.19/0.44 ( ( X @ Xx )
% 0.19/0.44 & ( Y @ Xx ) )
% 0.19/0.44 & ! [Xx: a] :
% 0.19/0.44 ( ( Y @ Xx )
% 0.19/0.44 => ( Z @ Xx ) ) )
% 0.19/0.44 => ? [Xx: a] :
% 0.19/0.44 ( ( X @ Xx )
% 0.19/0.44 & ( Z @ Xx ) ) ) ).
% 0.19/0.44
% 0.19/0.44 %------------------------------------------------------------------------------
% 0.19/0.44 ------------------------
% 1.50/1.21 ---- Embedded in THF ---
% 1.50/1.22 %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.50/1.22 %%% Generated on Tue Feb 24 12:00:57 EST 2026
% 1.50/1.22 %%% using '$$dhol' embedding, version 1.3.0.
% 1.50/1.22 %%% Logic specification used:
% 1.50/1.22 %%% thf(spec, logic, $$dhol).
% 1.50/1.22
% 1.50/1.22 % SZS output start ListOfTHF for /export/starexec/sandbox/tmp/tmp.QRalezMciq/DTF2DTF23753.p
% See solution above
% 1.50/1.22 ------------------------
% 1.50/1.22 ---- Cleaned THF ---
% 1.50/1.23 thf(a_type,type,
% 1.50/1.23 a: $tType ).
% 1.50/1.23
% 1.50/1.23 thf(cBOOL_PROP_101_pme,conjecture,
% 1.50/1.23 ! [X: a > $o,Y: a > $o,Z: a > $o] :
% 1.50/1.23 ( ( ? [Xx: a] :
% 1.50/1.23 ( ( X @ Xx )
% 1.50/1.23 & ( Y @ Xx ) )
% 1.50/1.23 & ! [Xx: a] :
% 1.50/1.23 ( ( Y @ Xx )
% 1.50/1.23 => ( Z @ Xx ) ) )
% 1.50/1.23 => ? [Xx: a] :
% 1.50/1.23 ( ( X @ Xx )
% 1.50/1.23 & ( Z @ Xx ) ) ) ).
% 1.50/1.23 ------------------------
% 1.50/1.24 % (24083)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on DTF2THF_23753 for (2999ds/2Mi)
% 1.50/1.24 % (24081)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_23753 for (2999ds/4Mi)
% 1.50/1.24 % (24083)First to succeed.
% 1.50/1.24 % (24081)Also succeeded, but the first one will report.
% 1.50/1.24 % (24083)Refutation found. Thanks to Tanya!
% 1.50/1.24 % SZS status Theorem for DTF2THF_23753
% 1.50/1.24 % SZS output start Proof for DTF2THF_23753
% 1.50/1.24 thf(type_def_5, type, a: $tType).
% 1.50/1.24 thf(func_def_0, type, a: $tType).
% 1.50/1.24 thf(func_def_4, type, sK0: a > $o).
% 1.50/1.24 thf(func_def_5, type, sK1: a > $o).
% 1.50/1.24 thf(func_def_6, type, sK2: a > $o).
% 1.50/1.24 thf(func_def_7, type, sK3: a).
% 1.50/1.24 thf(f20,plain,(
% 1.50/1.24 $false),
% 1.50/1.24 inference(subsumption_resolution,[status(thm)],[f19,f17])).
% 1.50/1.24 thf(f17,plain,(
% 1.50/1.24 ((sK1 @ sK3) = $true)),
% 1.50/1.24 inference(trivial_inequality_removal,[status(thm)],[f16])).
% 1.50/1.24 thf(f16,plain,(
% 1.50/1.24 ($true != $true) | ((sK1 @ sK3) = $true)),
% 1.50/1.24 inference(superposition,[status(thm)],[f12,f14])).
% 1.50/1.24 thf(f14,plain,(
% 1.50/1.24 ((sK0 @ sK3) = $true)),
% 1.50/1.24 inference(cnf_transformation,[status(thm)],[f11])).
% 1.50/1.24 thf(f11,plain,(
% 1.50/1.24 ! [X3 : a] : (($true != (sK2 @ X3)) | ((sK1 @ X3) != $true)) & (((sK0 @ sK3) = $true) & ((sK2 @ sK3) = $true)) & ! [X5 : a] : (((sK0 @ X5) != $true) | ((sK1 @ X5) = $true))),
% 1.50/1.24 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f8,f10,f9])).
% 1.50/1.24 thf(f9,plain,(
% 1.50/1.24 ? [X0 : a > $o,X1 : a > $o,X2 : a > $o] : (! [X3 : a] : (((X2 @ X3) != $true) | ((X1 @ X3) != $true)) & ? [X4 : a] : (($true = (X0 @ X4)) & ((X2 @ X4) = $true)) & ! [X5 : a] : (((X0 @ X5) != $true) | ((X1 @ X5) = $true))) => (! [X3 : a] : (($true != (sK2 @ X3)) | ((sK1 @ X3) != $true)) & ? [X4 : a] : (((sK0 @ X4) = $true) & ((sK2 @ X4) = $true)) & ! [X5 : a] : (((sK0 @ X5) != $true) | ((sK1 @ X5) = $true)))),
% 1.50/1.24 introduced(definition,[],[choice_axiom])).
% 1.50/1.24 thf(f10,plain,(
% 1.50/1.24 ? [X4 : a] : (((sK0 @ X4) = $true) & ((sK2 @ X4) = $true)) => (((sK0 @ sK3) = $true) & ((sK2 @ sK3) = $true))),
% 1.50/1.24 introduced(definition,[],[choice_axiom])).
% 1.50/1.24 thf(f8,plain,(
% 1.50/1.24 ? [X0 : a > $o,X1 : a > $o,X2 : a > $o] : (! [X3 : a] : (((X2 @ X3) != $true) | ((X1 @ X3) != $true)) & ? [X4 : a] : (($true = (X0 @ X4)) & ((X2 @ X4) = $true)) & ! [X5 : a] : (((X0 @ X5) != $true) | ((X1 @ X5) = $true)))),
% 1.50/1.24 inference(rectify,[status(thm)],[f7])).
% 1.50/1.24 thf(f7,plain,(
% 1.50/1.24 ? [X0 : a > $o,X2 : a > $o,X1 : a > $o] : (! [X5 : a] : (((X1 @ X5) != $true) | ((X2 @ X5) != $true)) & ? [X3 : a] : (((X0 @ X3) = $true) & ((X1 @ X3) = $true)) & ! [X4 : a] : (($true != (X0 @ X4)) | ((X2 @ X4) = $true)))),
% 1.50/1.24 inference(flattening,[status(thm)],[f6])).
% 1.50/1.24 thf(f6,plain,(
% 1.50/1.24 ? [X0 : a > $o,X1 : a > $o,X2 : a > $o] : (! [X5 : a] : (((X1 @ X5) != $true) | ((X2 @ X5) != $true)) & (? [X3 : a] : (((X0 @ X3) = $true) & ((X1 @ X3) = $true)) & ! [X4 : a] : (($true != (X0 @ X4)) | ((X2 @ X4) = $true))))),
% 1.50/1.24 inference(ennf_transformation,[status(thm)],[f5])).
% 1.50/1.24 thf(f5,plain,(
% 1.50/1.24 ~! [X0 : a > $o,X1 : a > $o,X2 : a > $o] : ((? [X3 : a] : (((X0 @ X3) = $true) & ((X1 @ X3) = $true)) & ! [X4 : a] : (($true = (X0 @ X4)) => ((X2 @ X4) = $true))) => ? [X5 : a] : (((X1 @ X5) = $true) & ((X2 @ X5) = $true)))),
% 1.50/1.24 inference(fool_elimination,[status(thm)],[f4])).
% 1.50/1.24 thf(f4,plain,(
% 1.50/1.24 ~! [X0 : a > $o,X1 : a > $o,X2 : a > $o] : ((? [X3 : a] : ((X1 @ X3) & (X0 @ X3)) & ! [X4 : a] : ((X0 @ X4) => (X2 @ X4))) => ? [X5 : a] : ((X2 @ X5) & (X1 @ X5)))),
% 1.50/1.24 inference(rectify,[status(thm)],[f2])).
% 1.50/1.24 thf(f2,negated_conjecture,(
% 1.50/1.24 ~! [X1 : a > $o,X0 : a > $o,X2 : a > $o] : ((? [X3 : a] : ((X0 @ X3) & (X1 @ X3)) & ! [X3 : a] : ((X1 @ X3) => (X2 @ X3))) => ? [X3 : a] : ((X2 @ X3) & (X0 @ X3)))),
% 1.50/1.24 inference(negated_conjecture,[status(cth)],[f1])).
% 1.50/1.24 thf(f1,conjecture,(
% 1.50/1.24 ! [X1 : a > $o,X0 : a > $o,X2 : a > $o] : ((? [X3 : a] : ((X0 @ X3) & (X1 @ X3)) & ! [X3 : a] : ((X1 @ X3) => (X2 @ X3))) => ? [X3 : a] : ((X2 @ X3) & (X0 @ X3)))),
% 1.50/1.24 file('/export/starexec/sandbox/tmp/tmp.QRalezMciq/DTF2THF_23753.p',cBOOL_PROP_101_pme)).
% 1.50/1.24 thf(f12,plain,(
% 1.50/1.24 ( ! [X5 : a] : (((sK0 @ X5) != $true) | ((sK1 @ X5) = $true)) )),
% 1.50/1.24 inference(cnf_transformation,[status(thm)],[f11])).
% 1.50/1.24 thf(f19,plain,(
% 1.50/1.24 ((sK1 @ sK3) != $true)),
% 1.50/1.24 inference(trivial_inequality_removal,[status(thm)],[f18])).
% 1.50/1.24 thf(f18,plain,(
% 1.50/1.24 ($true != $true) | ((sK1 @ sK3) != $true)),
% 1.50/1.24 inference(superposition,[status(thm)],[f15,f13])).
% 1.50/1.24 thf(f13,plain,(
% 1.50/1.24 ((sK2 @ sK3) = $true)),
% 1.50/1.24 inference(cnf_transformation,[status(thm)],[f11])).
% 1.50/1.24 thf(f15,plain,(
% 1.50/1.24 ( ! [X3 : a] : (($true != (sK2 @ X3)) | ((sK1 @ X3) != $true)) )),
% 1.50/1.24 inference(cnf_transformation,[status(thm)],[f11])).
% 1.50/1.24 % SZS output end Proof for DTF2THF_23753
% 1.50/1.24 % (24083)------------------------------
% 1.50/1.24 % (24083)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.50/1.24 % (24083)Termination reason: Refutation
% 1.50/1.24
% 1.50/1.24 % (24083)Memory used [KB]: 5500
% 1.50/1.24 % (24083)Time elapsed: 0.003 s
% 1.50/1.24 % (24083)Instructions burned: 1 (million)
% 1.50/1.24 % (24083)------------------------------
% 1.50/1.24 % (24083)------------------------------
% 1.50/1.24 % (24079)Success in time 0.012 s
%------------------------------------------------------------------------------