%------------------------------------------------------------------------------
% File : DT2H2X---1.9.5
% Problem : SET162^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 : n002.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:20 AM UTC 2026
% Result : Theorem 1.64s 1.30s
% Output : Refutation 1.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 2
% Syntax : Number of formulae : 11 ( 10 unt; 0 typ; 0 def)
% Number of atoms : 31 ( 11 equ; 0 cnn)
% Maximal formula atoms : 2 ( 2 avg)
% Number of connectives : 30 ( 10 ~; 9 |; 0 &; 10 @)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 6 ( 6 >; 0 *; 0 +; 0 <<)
% Number of symbols : 3 ( 1 usr; 1 con; 0-2 aty)
% Number of variables : 16 ( 10 ^; 4 !; 2 ?; 16 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(func_def_0,type,
a: $tType ).
thf(func_def_7,type,
sK0: a > $o ).
thf(f12,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[f11]) ).
thf(f11,plain,
sK0 != sK0,
inference(beta_eta_normalization,[status(thm)],[f10]) ).
thf(f10,plain,
( ( ^ [Y0: a] : ( sK0 @ Y0 ) )
!= sK0 ),
inference(boolean_simplification,[status(thm)],[f9]) ).
thf(f9,plain,
( ( ^ [Y0: a] :
( $false
| ( sK0 @ Y0 ) ) )
!= sK0 ),
inference(cnf_transformation,[status(thm)],[f8]) ).
thf(f8,plain,
( ( ^ [Y0: a] :
( $false
| ( sK0 @ Y0 ) ) )
!= sK0 ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f6,f7]) ).
thf(f7,plain,
( ? [X0: a > $o] :
( ( ^ [Y0: a] :
( $false
| ( X0 @ Y0 ) ) )
!= X0 )
=> ( ( ^ [Y0: a] :
( $false
| ( sK0 @ Y0 ) ) )
!= sK0 ) ),
introduced(definition,[],[choice_axiom]) ).
thf(f6,plain,
? [X0: a > $o] :
( ( ^ [Y0: a] :
( $false
| ( X0 @ Y0 ) ) )
!= X0 ),
inference(ennf_transformation,[status(thm)],[f5]) ).
thf(f5,plain,
~ ! [X0: a > $o] :
( ( ^ [Y0: a] :
( $false
| ( X0 @ Y0 ) ) )
= X0 ),
inference(fool_elimination,[status(thm)],[f4]) ).
thf(f4,plain,
~ ! [X0: a > $o] :
( X0
= ( ^ [X1: a] :
( ( X0 @ X1 )
| $false ) ) ),
inference(rectify,[status(thm)],[f2]) ).
thf(f2,negated_conjecture,
~ ! [X0: a > $o] :
( X0
= ( ^ [X1: a] :
( ( X0 @ X1 )
| $false ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f1,conjecture,
! [X0: a > $o] :
( X0
= ( ^ [X1: a] :
( ( X0 @ X1 )
| $false ) ) ),
file('/export/starexec/sandbox/tmp/tmp.h3LAmjMFEM/DTF2THF_4324.p',cBOOL_PROP_60_pme) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET162^5 : TPTP v9.2.1. Released v4.0.0.
% 0.11/0.13 % Command : /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.17/0.34 % Computer : n002.cluster.edu
% 0.17/0.34 % Model : x86_64 x86_64
% 0.17/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.34 % Memory : 8042.1875MB
% 0.17/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.34 % CPULimit : 300
% 0.17/0.34 % WCLimit : 300
% 0.17/0.34 % DateTime : Tue Feb 24 11:54:03 EST 2026
% 0.17/0.34 % CPUTime :
% 0.17/0.34 Running /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.32/0.47 ---- Original DTF file ---
% 0.32/0.47 thf(spec,logic,$$dhol).
% 0.32/0.47 %------------------------------------------------------------------------------
% 0.32/0.47 % File : SET162^5 : TPTP v9.2.1. Released v4.0.0.
% 0.32/0.47 % Domain : Set Theory
% 0.32/0.47 % Problem : TPS problem BOOL-PROP-60
% 0.32/0.47 % Version : Especial.
% 0.32/0.47 % English : Trybulec's 60th Boolean property of sets
% 0.32/0.47
% 0.32/0.47 % Refs : [TS89] Trybulec & Swieczkowska (1989), Boolean Properties of
% 0.32/0.47 % : [Bar92] Barker-Plummer D (1992), Gazing: An Approach to the Pr
% 0.32/0.47 % : [Bro09] Brown (2009), Email to Geoff Sutcliffe
% 0.32/0.47 % Source : [Bro09]
% 0.32/0.47 % Names : tps_0034 [Bro09]
% 0.32/0.47 % : BOOL-PROP-60 [TPS]
% 0.32/0.47 % : GAZING-THM22 [TPS]
% 0.32/0.47 % : 22 [Bar92]
% 0.32/0.47
% 0.32/0.47 % Status : Theorem
% 0.32/0.47 % 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.00 v6.1.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.0
% 0.32/0.47 % Syntax : Number of formulae : 2 ( 1 unt; 1 typ; 0 def)
% 0.32/0.47 % Number of atoms : 2 ( 1 equ; 0 cnn)
% 0.32/0.47 % Maximal formula atoms : 1 ( 2 avg)
% 0.32/0.47 % Number of connectives : 2 ( 0 ~; 1 |; 0 &; 1 @)
% 0.32/0.47 % ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% 0.32/0.47 % Maximal formula depth : 2 ( 2 avg)
% 0.32/0.47 % Number of types : 2 ( 1 usr)
% 0.32/0.47 % Number of type conns : 1 ( 1 >; 0 *; 0 +; 0 <<)
% 0.32/0.47 % Number of symbols : 2 ( 0 usr; 1 con; 0-2 aty)
% 0.32/0.47 % Number of variables : 2 ( 1 ^; 1 !; 0 ?; 2 :)
% 0.32/0.47 % SPC : TH0_THM_EQU_NAR
% 0.32/0.47
% 0.32/0.47 % Comments : This problem is from the TPS library. Copyright (c) 2009 The TPS
% 0.32/0.47 % project in the Department of Mathematical Sciences at Carnegie
% 0.32/0.47 % Mellon University. Distributed under the Creative Commons copyleft
% 0.32/0.47 % license: http://creativecommons.org/licenses/by-sa/3.0/
% 0.32/0.47 % : Polymorphic definitions expanded.
% 0.32/0.47 % :
% 0.32/0.47 %------------------------------------------------------------------------------
% 0.32/0.47 thf(a_type,type,
% 0.32/0.47 a: $tType ).
% 0.32/0.47
% 0.32/0.47 thf(cBOOL_PROP_60_pme,conjecture,
% 0.32/0.47 ! [X: a > $o] :
% 0.32/0.47 ( ( ^ [Xz: a] :
% 0.32/0.47 ( ( X @ Xz )
% 0.32/0.47 | $false ) )
% 0.32/0.47 = X ) ).
% 0.32/0.47
% 0.32/0.47 %------------------------------------------------------------------------------
% 0.32/0.47 ------------------------
% 1.47/1.27 ---- Embedded in THF ---
% 1.47/1.28 %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.47/1.28 %%% Generated on Tue Feb 24 11:54:04 EST 2026
% 1.47/1.28 %%% using '$$dhol' embedding, version 1.3.0.
% 1.47/1.28 %%% Logic specification used:
% 1.47/1.28 %%% thf(spec, logic, $$dhol).
% 1.47/1.28
% 1.47/1.28 % SZS output start ListOfTHF for /export/starexec/sandbox/tmp/tmp.h3LAmjMFEM/DTF2DTF4324.p
% See solution above
% 1.47/1.28 ------------------------
% 1.47/1.29 ---- Cleaned THF ---
% 1.47/1.29 thf(a_type,type,
% 1.47/1.29 a: $tType ).
% 1.47/1.29
% 1.47/1.29 thf(cBOOL_PROP_60_pme,conjecture,
% 1.47/1.29 ! [X: a > $o] :
% 1.47/1.29 ( ( ^ [Xz: a] :
% 1.47/1.29 ( ( X @ Xz )
% 1.47/1.29 | $false ) )
% 1.47/1.29 = X ) ).
% 1.47/1.29 ------------------------
% 1.64/1.30 % (4653)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on DTF2THF_4324 for (2999ds/183Mi)
% 1.64/1.30 % (4653)First to succeed.
% 1.64/1.30 % (4657)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_4324 for (2999ds/2Mi)
% 1.64/1.30 % (4659)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on DTF2THF_4324 for (2999ds/18Mi)
% 1.64/1.30 % (4659)Also succeeded, but the first one will report.
% 1.64/1.30 % (4653)Refutation found. Thanks to Tanya!
% 1.64/1.30 % SZS status Theorem for DTF2THF_4324
% 1.64/1.30 % SZS output start Proof for DTF2THF_4324
% 1.64/1.30 thf(type_def_5, type, a: $tType).
% 1.64/1.30 thf(func_def_0, type, a: $tType).
% 1.64/1.30 thf(func_def_7, type, sK0: a > $o).
% 1.64/1.30 thf(f12,plain,(
% 1.64/1.30 $false),
% 1.64/1.30 inference(trivial_inequality_removal,[status(thm)],[f11])).
% 1.64/1.30 thf(f11,plain,(
% 1.64/1.30 (sK0 != sK0)),
% 1.64/1.30 inference(beta_eta_normalization,[status(thm)],[f10])).
% 1.64/1.30 thf(f10,plain,(
% 1.64/1.30 ((^[Y0 : a]: (sK0 @ Y0)) != sK0)),
% 1.64/1.30 inference(boolean_simplification,[status(thm)],[f9])).
% 1.64/1.30 thf(f9,plain,(
% 1.64/1.30 ((^[Y0 : a]: ($false | (sK0 @ Y0))) != sK0)),
% 1.64/1.30 inference(cnf_transformation,[status(thm)],[f8])).
% 1.64/1.30 thf(f8,plain,(
% 1.64/1.30 ((^[Y0 : a]: ($false | (sK0 @ Y0))) != sK0)),
% 1.64/1.30 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f6,f7])).
% 1.64/1.30 thf(f7,plain,(
% 1.64/1.30 ? [X0 : a > $o] : ((^[Y0 : a]: ($false | (X0 @ Y0))) != X0) => ((^[Y0 : a]: ($false | (sK0 @ Y0))) != sK0)),
% 1.64/1.30 introduced(definition,[],[choice_axiom])).
% 1.64/1.30 thf(f6,plain,(
% 1.64/1.30 ? [X0 : a > $o] : ((^[Y0 : a]: ($false | (X0 @ Y0))) != X0)),
% 1.64/1.30 inference(ennf_transformation,[status(thm)],[f5])).
% 1.64/1.30 thf(f5,plain,(
% 1.64/1.30 ~! [X0 : a > $o] : ((^[Y0 : a]: ($false | (X0 @ Y0))) = X0)),
% 1.64/1.30 inference(fool_elimination,[status(thm)],[f4])).
% 1.64/1.30 thf(f4,plain,(
% 1.64/1.30 ~! [X0 : a > $o] : (X0 = (^[X1 : a] : ((X0 @ X1) | $false)))),
% 1.64/1.30 inference(rectify,[status(thm)],[f2])).
% 1.64/1.30 thf(f2,negated_conjecture,(
% 1.64/1.30 ~! [X0 : a > $o] : (X0 = (^[X1 : a] : ((X0 @ X1) | $false)))),
% 1.64/1.30 inference(negated_conjecture,[status(cth)],[f1])).
% 1.64/1.30 thf(f1,conjecture,(
% 1.64/1.30 ! [X0 : a > $o] : (X0 = (^[X1 : a] : ((X0 @ X1) | $false)))),
% 1.64/1.30 file('/export/starexec/sandbox/tmp/tmp.h3LAmjMFEM/DTF2THF_4324.p',cBOOL_PROP_60_pme)).
% 1.64/1.30 % SZS output end Proof for DTF2THF_4324
% 1.64/1.30 % (4653)------------------------------
% 1.64/1.30 % (4653)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.64/1.30 % (4653)Termination reason: Refutation
% 1.64/1.30
% 1.64/1.30 % (4653)Memory used [KB]: 5373
% 1.64/1.30 % (4653)Time elapsed: 0.002 s
% 1.64/1.30 % (4653)Instructions burned: 1 (million)
% 1.64/1.30 % (4653)------------------------------
% 1.64/1.30 % (4653)------------------------------
% 1.64/1.30 % (4652)Success in time 0.011 s
%------------------------------------------------------------------------------