%------------------------------------------------------------------------------
% File : DT2H2X---1.9.5
% Problem : SET605^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 : n023.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:53 AM UTC 2026
% Result : Theorem 1.55s 1.33s
% Output : Refutation 1.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 2
% Syntax : Number of formulae : 16 ( 15 unt; 0 typ; 0 def)
% Number of atoms : 55 ( 16 equ; 0 cnn)
% Maximal formula atoms : 2 ( 3 avg)
% Number of connectives : 88 ( 22 ~; 13 |; 11 &; 41 @)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 12 ( 12 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 32 ( 20 ^; 8 !; 4 ?; 32 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(func_def_0,type,
a: $tType ).
thf(func_def_9,type,
sK0: a > $o ).
thf(func_def_10,type,
sK1: a > $o ).
thf(func_def_12,type,
ph3:
!>[X0: $tType] : X0 ).
thf(func_def_13,type,
sK4: a ).
thf(f18,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[f17]) ).
thf(f17,plain,
$true = $false,
inference(forward_demodulation,[status(thm)],[f13,f15]) ).
thf(f15,plain,
( $false
= ( sK0 @ sK4 ) ),
inference(binary_proxy_clausification,[status(thm)],[f14]) ).
thf(f14,plain,
( ( ( sK1 @ sK4 )
| ( sK0 @ sK4 ) )
= $false ),
inference(not_proxy_clausification,[status(thm)],[f12]) ).
thf(f12,plain,
( $true
= ( ~ ( ( sK1 @ sK4 )
| ( sK0 @ sK4 ) ) ) ),
inference(binary_proxy_clausification,[status(thm)],[f11]) ).
thf(f11,plain,
( ( ( sK0 @ sK4 )
& ~ ( ( sK1 @ sK4 )
| ( sK0 @ sK4 ) ) )
!= $false ),
inference(beta_eta_normalization,[status(thm)],[f10]) ).
thf(f10,plain,
( ( ^ [Y0: a] : $false
@ sK4 )
!= ( ^ [Y0: a] :
( ( sK0 @ Y0 )
& ~ ( ( sK1 @ Y0 )
| ( sK0 @ Y0 ) ) )
@ sK4 ) ),
inference(negative_extensionality,[status(thm)],[f9]) ).
thf(f9,plain,
( ( ^ [Y0: a] : $false )
!= ( ^ [Y0: a] :
( ( sK0 @ Y0 )
& ~ ( ( sK1 @ Y0 )
| ( sK0 @ Y0 ) ) ) ) ),
inference(cnf_transformation,[status(thm)],[f8]) ).
thf(f8,plain,
( ( ^ [Y0: a] : $false )
!= ( ^ [Y0: a] :
( ( sK0 @ Y0 )
& ~ ( ( sK1 @ Y0 )
| ( sK0 @ Y0 ) ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f6,f7]) ).
thf(f7,plain,
( ? [X0: a > $o,X1: a > $o] :
( ( ^ [Y0: a] : $false )
!= ( ^ [Y0: a] :
( ( X0 @ Y0 )
& ~ ( ( X1 @ Y0 )
| ( X0 @ Y0 ) ) ) ) )
=> ( ( ^ [Y0: a] : $false )
!= ( ^ [Y0: a] :
( ( sK0 @ Y0 )
& ~ ( ( sK1 @ Y0 )
| ( sK0 @ Y0 ) ) ) ) ) ),
introduced(definition,[],[choice_axiom]) ).
thf(f6,plain,
? [X0: a > $o,X1: a > $o] :
( ( ^ [Y0: a] : $false )
!= ( ^ [Y0: a] :
( ( X0 @ Y0 )
& ~ ( ( X1 @ Y0 )
| ( X0 @ Y0 ) ) ) ) ),
inference(ennf_transformation,[status(thm)],[f5]) ).
thf(f5,plain,
~ ! [X0: a > $o,X1: a > $o] :
( ( ^ [Y0: a] : $false )
= ( ^ [Y0: a] :
( ( X0 @ Y0 )
& ~ ( ( X1 @ Y0 )
| ( X0 @ Y0 ) ) ) ) ),
inference(fool_elimination,[status(thm)],[f4]) ).
thf(f4,plain,
~ ! [X0: a > $o,X1: a > $o] :
( ( ^ [X2: a] : $false )
= ( ^ [X3: a] :
( ~ ( ( X0 @ X3 )
| ( X1 @ X3 ) )
& ( X0 @ X3 ) ) ) ),
inference(rectify,[status(thm)],[f2]) ).
thf(f2,negated_conjecture,
~ ! [X0: a > $o,X1: a > $o] :
( ( ^ [X2: a] : $false )
= ( ^ [X2: a] :
( ~ ( ( X0 @ X2 )
| ( X1 @ X2 ) )
& ( X0 @ X2 ) ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f1,conjecture,
! [X0: a > $o,X1: a > $o] :
( ( ^ [X2: a] : $false )
= ( ^ [X2: a] :
( ~ ( ( X0 @ X2 )
| ( X1 @ X2 ) )
& ( X0 @ X2 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.uzOdi7HzqJ/DTF2THF_16332.p',cBOOL_PROP_76_pme) ).
thf(f13,plain,
( $true
= ( sK0 @ sK4 ) ),
inference(binary_proxy_clausification,[status(thm)],[f11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : SET605^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 : n023.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.30 % CPULimit : 300
% 0.11/0.30 % WCLimit : 300
% 0.11/0.30 % DateTime : Tue Feb 24 12:01:49 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 : SET605^5 : TPTP v9.2.1. Released v4.0.0.
% 0.16/0.39 % Domain : Set Theory
% 0.16/0.39 % Problem : TPS problem BOOL-PROP-76
% 0.16/0.39 % Version : Especial.
% 0.16/0.39 % English : Trybulec's 76th Boolean property of sets
% 0.16/0.39
% 0.16/0.39 % Refs : [TS89] Trybulec & Swieczkowska (1989), Boolean Properties of
% 0.16/0.39 % : [Bro09] Brown (2009), Email to Geoff Sutcliffe
% 0.16/0.39 % Source : [Bro09]
% 0.16/0.39 % Names : tps_0192 [Bro09]
% 0.16/0.39 % : BOOL-PROP-76 [TPS]
% 0.16/0.39
% 0.16/0.39 % Status : Theorem
% 0.16/0.39 % Rating : 0.00 v8.2.0, 0.08 v8.1.0, 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 v5.3.0, 0.40 v5.2.0, 0.20 v4.1.0, 0.00 v4.0.1, 0.33 v4.0.0
% 0.16/0.39 % Syntax : Number of formulae : 2 ( 1 unt; 1 typ; 0 def)
% 0.16/0.39 % Number of atoms : 2 ( 1 equ; 0 cnn)
% 0.16/0.39 % Maximal formula atoms : 1 ( 2 avg)
% 0.16/0.39 % Number of connectives : 6 ( 1 ~; 1 |; 1 &; 3 @)
% 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 : 2 ( 1 usr)
% 0.16/0.39 % Number of type conns : 2 ( 2 >; 0 *; 0 +; 0 <<)
% 0.16/0.39 % Number of symbols : 2 ( 0 usr; 1 con; 0-2 aty)
% 0.16/0.39 % Number of variables : 4 ( 2 ^; 2 !; 0 ?; 4 :)
% 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 % : Polymorphic definitions expanded.
% 0.16/0.39 %------------------------------------------------------------------------------
% 0.16/0.39 thf(a_type,type,
% 0.16/0.39 a: $tType ).
% 0.16/0.39
% 0.16/0.39 thf(cBOOL_PROP_76_pme,conjecture,
% 0.16/0.39 ! [X: a > $o,Y: a > $o] :
% 0.16/0.39 ( ( ^ [Xx: a] :
% 0.16/0.39 ( ( X @ Xx )
% 0.16/0.39 & ~ ( ( X @ Xx )
% 0.16/0.39 | ( Y @ Xx ) ) ) )
% 0.16/0.39 = ( ^ [Xx: a] : $false ) ) ).
% 0.16/0.39
% 0.16/0.39 %------------------------------------------------------------------------------
% 0.16/0.39 ------------------------
% 1.35/1.30 ---- Embedded in THF ---
% 1.55/1.30 %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.55/1.30 %%% Generated on Tue Feb 24 12:01:50 EST 2026
% 1.55/1.30 %%% using '$$dhol' embedding, version 1.3.0.
% 1.55/1.30 %%% Logic specification used:
% 1.55/1.30 %%% thf(spec, logic, $$dhol).
% 1.55/1.30
% 1.55/1.30 % SZS output start ListOfTHF for /export/starexec/sandbox/tmp/tmp.uzOdi7HzqJ/DTF2DTF16332.p
% See solution above
% 1.55/1.30 ------------------------
% 1.55/1.31 ---- Cleaned THF ---
% 1.55/1.31 thf(a_type,type,
% 1.55/1.31 a: $tType ).
% 1.55/1.31
% 1.55/1.31 thf(cBOOL_PROP_76_pme,conjecture,
% 1.55/1.31 ! [X: a > $o,Y: a > $o] :
% 1.55/1.31 ( ( ^ [Xx: a] :
% 1.55/1.31 ( ( X @ Xx )
% 1.55/1.31 & ~ ( ( X @ Xx )
% 1.55/1.31 | ( Y @ Xx ) ) ) )
% 1.55/1.31 = ( ^ [Xx: a] : $false ) ) ).
% 1.55/1.31 ------------------------
% 1.55/1.33 % (16435)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on DTF2THF_16332 for (3000ds/18Mi)
% 1.55/1.33 % (16429)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on DTF2THF_16332 for (3000ds/183Mi)
% 1.55/1.33 % (16431)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_16332 for (3000ds/27Mi)
% 1.55/1.33 % (16432)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on DTF2THF_16332 for (3000ds/2Mi)
% 1.55/1.33 % (16433)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_16332 for (3000ds/2Mi)
% 1.55/1.33 % (16434)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_16332 for (3000ds/275Mi)
% 1.55/1.33 % (16430)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_16332 for (3000ds/4Mi)
% 1.55/1.33 % (16432)Instruction limit reached!
% 1.55/1.33 % (16432)------------------------------
% 1.55/1.33 % (16432)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.55/1.33 % (16432)Termination reason: Unknown
% 1.55/1.33 % (16432)Termination phase: Saturation
% 1.55/1.33 % (16433)Instruction limit reached!
% 1.55/1.33 % (16433)------------------------------
% 1.55/1.33 % (16433)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.55/1.33
% 1.55/1.33 % (16432)Memory used [KB]: 5373
% 1.55/1.33 % (16432)Time elapsed: 0.003 s
% 1.55/1.33 % (16432)Instructions burned: 2 (million)
% 1.55/1.33 % (16432)------------------------------
% 1.55/1.33 % (16432)------------------------------
% 1.55/1.33 % (16433)Termination reason: Unknown
% 1.55/1.33 % (16433)Termination phase: Saturation
% 1.55/1.33
% 1.55/1.33 % (16433)Memory used [KB]: 5500
% 1.55/1.33 % (16433)Time elapsed: 0.003 s
% 1.55/1.33 % (16433)Instructions burned: 2 (million)
% 1.55/1.33 % (16435)First to succeed.
% 1.55/1.33 % (16433)------------------------------
% 1.55/1.33 % (16433)------------------------------
% 1.55/1.33 % (16434)Also succeeded, but the first one will report.
% 1.55/1.33 % (16435)Refutation found. Thanks to Tanya!
% 1.55/1.33 % SZS status Theorem for DTF2THF_16332
% 1.55/1.33 % SZS output start Proof for DTF2THF_16332
% 1.55/1.33 thf(type_def_5, type, a: $tType).
% 1.55/1.33 thf(func_def_0, type, a: $tType).
% 1.55/1.33 thf(func_def_9, type, sK0: a > $o).
% 1.55/1.33 thf(func_def_10, type, sK1: a > $o).
% 1.55/1.33 thf(func_def_12, type, ph3: !>[X0: $tType]:(X0)).
% 1.55/1.33 thf(func_def_13, type, sK4: a).
% 1.55/1.33 thf(f18,plain,(
% 1.55/1.33 $false),
% 1.55/1.33 inference(trivial_inequality_removal,[status(thm)],[f17])).
% 1.55/1.33 thf(f17,plain,(
% 1.55/1.33 ($true = $false)),
% 1.55/1.33 inference(forward_demodulation,[status(thm)],[f13,f15])).
% 1.55/1.33 thf(f15,plain,(
% 1.55/1.33 ($false = (sK0 @ sK4))),
% 1.55/1.33 inference(binary_proxy_clausification,[status(thm)],[f14])).
% 1.55/1.33 thf(f14,plain,(
% 1.55/1.33 (((sK1 @ sK4) | (sK0 @ sK4)) = $false)),
% 1.55/1.33 inference(not_proxy_clausification,[status(thm)],[f12])).
% 1.55/1.33 thf(f12,plain,(
% 1.55/1.33 ($true = (~ ((sK1 @ sK4) | (sK0 @ sK4))))),
% 1.55/1.33 inference(binary_proxy_clausification,[status(thm)],[f11])).
% 1.55/1.33 thf(f11,plain,(
% 1.55/1.33 (((sK0 @ sK4) & (~ ((sK1 @ sK4) | (sK0 @ sK4)))) != $false)),
% 1.55/1.33 inference(beta_eta_normalization,[status(thm)],[f10])).
% 1.55/1.33 thf(f10,plain,(
% 1.55/1.33 (((^[Y0 : a]: ($false)) @ sK4) != ((^[Y0 : a]: ((sK0 @ Y0) & (~ ((sK1 @ Y0) | (sK0 @ Y0))))) @ sK4))),
% 1.55/1.33 inference(negative_extensionality,[status(thm)],[f9])).
% 1.55/1.33 thf(f9,plain,(
% 1.55/1.33 ((^[Y0 : a]: ($false)) != (^[Y0 : a]: ((sK0 @ Y0) & (~ ((sK1 @ Y0) | (sK0 @ Y0))))))),
% 1.55/1.33 inference(cnf_transformation,[status(thm)],[f8])).
% 1.55/1.33 thf(f8,plain,(
% 1.55/1.33 ((^[Y0 : a]: ($false)) != (^[Y0 : a]: ((sK0 @ Y0) & (~ ((sK1 @ Y0) | (sK0 @ Y0))))))),
% 1.55/1.33 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f6,f7])).
% 1.55/1.33 thf(f7,plain,(
% 1.55/1.33 ? [X0 : a > $o,X1 : a > $o] : ((^[Y0 : a]: ($false)) != (^[Y0 : a]: ((X0 @ Y0) & (~ ((X1 @ Y0) | (X0 @ Y0)))))) => ((^[Y0 : a]: ($false)) != (^[Y0 : a]: ((sK0 @ Y0) & (~ ((sK1 @ Y0) | (sK0 @ Y0))))))),
% 1.55/1.33 introduced(definition,[],[choice_axiom])).
% 1.55/1.33 thf(f6,plain,(
% 1.55/1.33 ? [X0 : a > $o,X1 : a > $o] : ((^[Y0 : a]: ($false)) != (^[Y0 : a]: ((X0 @ Y0) & (~ ((X1 @ Y0) | (X0 @ Y0))))))),
% 1.55/1.33 inference(ennf_transformation,[status(thm)],[f5])).
% 1.55/1.33 thf(f5,plain,(
% 1.55/1.33 ~! [X0 : a > $o,X1 : a > $o] : ((^[Y0 : a]: ($false)) = (^[Y0 : a]: ((X0 @ Y0) & (~ ((X1 @ Y0) | (X0 @ Y0))))))),
% 1.55/1.33 inference(fool_elimination,[status(thm)],[f4])).
% 1.55/1.33 thf(f4,plain,(
% 1.55/1.33 ~! [X0 : a > $o,X1 : a > $o] : ((^[X2 : a] : ($false)) = (^[X3 : a] : (~((X0 @ X3) | (X1 @ X3)) & (X0 @ X3))))),
% 1.55/1.33 inference(rectify,[status(thm)],[f2])).
% 1.55/1.33 thf(f2,negated_conjecture,(
% 1.55/1.33 ~! [X0 : a > $o,X1 : a > $o] : ((^[X2 : a] : ($false)) = (^[X2 : a] : (~((X0 @ X2) | (X1 @ X2)) & (X0 @ X2))))),
% 1.55/1.33 inference(negated_conjecture,[status(cth)],[f1])).
% 1.55/1.33 thf(f1,conjecture,(
% 1.55/1.33 ! [X0 : a > $o,X1 : a > $o] : ((^[X2 : a] : ($false)) = (^[X2 : a] : (~((X0 @ X2) | (X1 @ X2)) & (X0 @ X2))))),
% 1.55/1.33 file('/export/starexec/sandbox/tmp/tmp.uzOdi7HzqJ/DTF2THF_16332.p',cBOOL_PROP_76_pme)).
% 1.55/1.33 thf(f13,plain,(
% 1.55/1.33 ($true = (sK0 @ sK4))),
% 1.55/1.33 inference(binary_proxy_clausification,[status(thm)],[f11])).
% 1.55/1.33 % SZS output end Proof for DTF2THF_16332
% 1.55/1.33 % (16435)------------------------------
% 1.55/1.33 % (16435)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.55/1.33 % (16435)Termination reason: Refutation
% 1.55/1.33
% 1.55/1.33 % (16435)Memory used [KB]: 5500
% 1.55/1.33 % (16435)Time elapsed: 0.003 s
% 1.55/1.33 % (16435)Instructions burned: 1 (million)
% 1.55/1.33 % (16435)------------------------------
% 1.55/1.33 % (16435)------------------------------
% 1.55/1.33 % (16428)Success in time 0.015 s
%------------------------------------------------------------------------------