%------------------------------------------------------------------------------
% File : DT2H2X---1.9.5
% Problem : SET596^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 : n024.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:51 AM UTC 2026
% Result : Theorem 0.99s 0.90s
% Output : Refutation 0.99s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 2
% Syntax : Number of formulae : 23 ( 11 unt; 0 typ; 0 def)
% Number of atoms : 133 ( 48 equ; 0 cnn)
% Maximal formula atoms : 8 ( 5 avg)
% Number of connectives : 155 ( 19 ~; 9 |; 38 &; 80 @)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 21 ( 21 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 78 ( 44 ^; 25 !; 9 ?; 78 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(func_def_0,type,
a: $tType ).
thf(func_def_7,type,
sK0: a > $o ).
thf(func_def_8,type,
sK1: a > $o ).
thf(func_def_9,type,
sK2: a > $o ).
thf(func_def_11,type,
ph4:
!>[X0: $tType] : X0 ).
thf(func_def_12,type,
sK5: a ).
thf(f28,plain,
$false,
inference(subsumption_resolution,[status(thm)],[f27,f18]) ).
thf(f18,plain,
( ( sK1 @ sK5 )
= $true ),
inference(binary_proxy_clausification,[status(thm)],[f17]) ).
thf(f17,plain,
( ( ( sK0 @ sK5 )
& ( sK1 @ sK5 ) )
!= $false ),
inference(beta_eta_normalization,[status(thm)],[f16]) ).
thf(f16,plain,
( ( ^ [Y0: a] :
( ( sK0 @ Y0 )
& ( sK1 @ Y0 ) )
@ sK5 )
!= ( ^ [Y0: a] : $false
@ sK5 ) ),
inference(negative_extensionality,[status(thm)],[f11]) ).
thf(f11,plain,
( ( ^ [Y0: a] : $false )
!= ( ^ [Y0: a] :
( ( sK0 @ Y0 )
& ( sK1 @ Y0 ) ) ) ),
inference(cnf_transformation,[status(thm)],[f9]) ).
thf(f9,plain,
( ! [X3: a] :
( ( $true
!= ( sK1 @ X3 ) )
| ( $true
= ( sK2 @ X3 ) ) )
& ( ( ^ [Y0: a] : $false )
!= ( ^ [Y0: a] :
( ( sK0 @ Y0 )
& ( sK1 @ Y0 ) ) ) )
& ( ( ^ [Y0: a] : $false )
= ( ^ [Y0: a] :
( ( sK0 @ Y0 )
& ( sK2 @ Y0 ) ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f7,f8]) ).
thf(f8,plain,
( ? [X0: a > $o,X1: a > $o,X2: a > $o] :
( ! [X3: a] :
( ( ( X1 @ X3 )
!= $true )
| ( ( X2 @ X3 )
= $true ) )
& ( ( ^ [Y0: a] : $false )
!= ( ^ [Y0: a] :
( ( X0 @ Y0 )
& ( X1 @ Y0 ) ) ) )
& ( ( ^ [Y0: a] : $false )
= ( ^ [Y0: a] :
( ( X0 @ Y0 )
& ( X2 @ Y0 ) ) ) ) )
=> ( ! [X3: a] :
( ( $true
!= ( sK1 @ X3 ) )
| ( $true
= ( sK2 @ X3 ) ) )
& ( ( ^ [Y0: a] : $false )
!= ( ^ [Y0: a] :
( ( sK0 @ Y0 )
& ( sK1 @ Y0 ) ) ) )
& ( ( ^ [Y0: a] : $false )
= ( ^ [Y0: a] :
( ( sK0 @ Y0 )
& ( sK2 @ Y0 ) ) ) ) ) ),
introduced(definition,[],[choice_axiom]) ).
thf(f7,plain,
? [X0: a > $o,X1: a > $o,X2: a > $o] :
( ! [X3: a] :
( ( ( X1 @ X3 )
!= $true )
| ( ( X2 @ X3 )
= $true ) )
& ( ( ^ [Y0: a] : $false )
!= ( ^ [Y0: a] :
( ( X0 @ Y0 )
& ( X1 @ Y0 ) ) ) )
& ( ( ^ [Y0: a] : $false )
= ( ^ [Y0: a] :
( ( X0 @ Y0 )
& ( X2 @ Y0 ) ) ) ) ),
inference(flattening,[status(thm)],[f6]) ).
thf(f6,plain,
? [X0: a > $o,X1: a > $o,X2: a > $o] :
( ( ( ^ [Y0: a] : $false )
!= ( ^ [Y0: a] :
( ( X0 @ Y0 )
& ( X1 @ Y0 ) ) ) )
& ! [X3: a] :
( ( ( X1 @ X3 )
!= $true )
| ( ( X2 @ X3 )
= $true ) )
& ( ( ^ [Y0: a] : $false )
= ( ^ [Y0: a] :
( ( X0 @ Y0 )
& ( X2 @ Y0 ) ) ) ) ),
inference(ennf_transformation,[status(thm)],[f5]) ).
thf(f5,plain,
~ ! [X0: a > $o,X1: a > $o,X2: a > $o] :
( ( ! [X3: a] :
( ( ( X1 @ X3 )
= $true )
=> ( ( X2 @ X3 )
= $true ) )
& ( ( ^ [Y0: a] : $false )
= ( ^ [Y0: a] :
( ( X0 @ Y0 )
& ( X2 @ Y0 ) ) ) ) )
=> ( ( ^ [Y0: a] : $false )
= ( ^ [Y0: a] :
( ( X0 @ Y0 )
& ( X1 @ Y0 ) ) ) ) ),
inference(fool_elimination,[status(thm)],[f4]) ).
thf(f4,plain,
~ ! [X0: a > $o,X1: a > $o,X2: a > $o] :
( ( ! [X3: a] :
( ( X1 @ X3 )
=> ( X2 @ X3 ) )
& ( ( ^ [X4: a] : $false )
= ( ^ [X5: a] :
( ( X2 @ X5 )
& ( X0 @ X5 ) ) ) ) )
=> ( ( ^ [X6: a] :
( ( X1 @ X6 )
& ( X0 @ X6 ) ) )
= ( ^ [X7: a] : $false ) ) ),
inference(rectify,[status(thm)],[f2]) ).
thf(f2,negated_conjecture,
~ ! [X2: a > $o,X0: a > $o,X1: a > $o] :
( ( ! [X3: a] :
( ( X0 @ X3 )
=> ( X1 @ X3 ) )
& ( ( ^ [X3: a] : $false )
= ( ^ [X3: a] :
( ( X1 @ X3 )
& ( X2 @ X3 ) ) ) ) )
=> ( ( ^ [X3: a] :
( ( X0 @ X3 )
& ( X2 @ X3 ) ) )
= ( ^ [X3: a] : $false ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f1,conjecture,
! [X2: a > $o,X0: a > $o,X1: a > $o] :
( ( ! [X3: a] :
( ( X0 @ X3 )
=> ( X1 @ X3 ) )
& ( ( ^ [X3: a] : $false )
= ( ^ [X3: a] :
( ( X1 @ X3 )
& ( X2 @ X3 ) ) ) ) )
=> ( ( ^ [X3: a] :
( ( X0 @ X3 )
& ( X2 @ X3 ) ) )
= ( ^ [X3: a] : $false ) ) ),
file('/export/starexec/sandbox/tmp/tmp.yHYrnQ6CTY/DTF2THF_29329.p',cBOOL_PROP_55_pme) ).
thf(f27,plain,
( ( sK1 @ sK5 )
!= $true ),
inference(trivial_inequality_removal,[status(thm)],[f25]) ).
thf(f25,plain,
( ( ( sK1 @ sK5 )
!= $true )
| ( $false = $true ) ),
inference(superposition,[status(thm)],[f12,f23]) ).
thf(f23,plain,
( ( sK2 @ sK5 )
= $false ),
inference(trivial_inequality_removal,[status(thm)],[f21]) ).
thf(f21,plain,
( ( ( sK2 @ sK5 )
= $false )
| ( $false = $true ) ),
inference(superposition,[status(thm)],[f15,f19]) ).
thf(f19,plain,
( ( sK0 @ sK5 )
= $true ),
inference(binary_proxy_clausification,[status(thm)],[f17]) ).
thf(f15,plain,
! [X1: a] :
( ( $false
= ( sK0 @ X1 ) )
| ( ( sK2 @ X1 )
= $false ) ),
inference(binary_proxy_clausification,[status(thm)],[f14]) ).
thf(f14,plain,
! [X1: a] :
( $false
= ( ( sK0 @ X1 )
& ( sK2 @ X1 ) ) ),
inference(beta_eta_normalization,[status(thm)],[f13]) ).
thf(f13,plain,
! [X1: a] :
( ( ^ [Y0: a] : $false
@ X1 )
= ( ^ [Y0: a] :
( ( sK0 @ Y0 )
& ( sK2 @ Y0 ) )
@ X1 ) ),
inference(argument_congruence,[status(thm)],[f10]) ).
thf(f10,plain,
( ( ^ [Y0: a] : $false )
= ( ^ [Y0: a] :
( ( sK0 @ Y0 )
& ( sK2 @ Y0 ) ) ) ),
inference(cnf_transformation,[status(thm)],[f9]) ).
thf(f12,plain,
! [X3: a] :
( ( $true
= ( sK2 @ X3 ) )
| ( $true
!= ( sK1 @ X3 ) ) ),
inference(cnf_transformation,[status(thm)],[f9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.06 % Problem : SET596^5 : TPTP v9.2.1. Released v4.0.0.
% 0.00/0.07 % Command : /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.07/0.25 % Computer : n024.cluster.edu
% 0.07/0.25 % Model : x86_64 x86_64
% 0.07/0.25 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.25 % Memory : 8042.1875MB
% 0.07/0.25 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.25 % CPULimit : 300
% 0.07/0.25 % WCLimit : 300
% 0.07/0.25 % DateTime : Tue Feb 24 06:59:55 EST 2026
% 0.07/0.25 % CPUTime :
% 0.07/0.25 Running /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.07/0.31 ---- Original DTF file ---
% 0.07/0.31 thf(spec,logic,$$dhol).
% 0.07/0.31 %------------------------------------------------------------------------------
% 0.07/0.31 % File : SET596^5 : TPTP v9.2.1. Released v4.0.0.
% 0.07/0.31 % Domain : Set Theory
% 0.07/0.31 % Problem : TPS problem BOOL-PROP-55
% 0.07/0.31 % Version : Especial.
% 0.07/0.31 % English : Trybulec's 55th Boolean property of sets
% 0.07/0.31
% 0.07/0.31 % Refs : [TS89] Trybulec & Swieczkowska (1989), Boolean Properties of
% 0.07/0.31 % : [Bro09] Brown (2009), Email to Geoff Sutcliffe
% 0.07/0.31 % Source : [Bro09]
% 0.07/0.31 % Names : tps_0316 [Bro09]
% 0.07/0.31 % : BOOL-PROP-55 [TPS]
% 0.07/0.31
% 0.07/0.31 % Status : Theorem
% 0.07/0.31 % Rating : 0.00 v8.2.0, 0.15 v8.1.0, 0.09 v7.5.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.1, 0.33 v4.0.0
% 0.07/0.31 % Syntax : Number of formulae : 2 ( 0 unt; 1 typ; 0 def)
% 0.07/0.31 % Number of atoms : 4 ( 2 equ; 0 cnn)
% 0.07/0.31 % Maximal formula atoms : 2 ( 4 avg)
% 0.07/0.31 % Number of connectives : 11 ( 0 ~; 0 |; 3 &; 6 @)
% 0.07/0.31 % ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% 0.07/0.31 % Maximal formula depth : 9 ( 9 avg)
% 0.07/0.31 % Number of types : 2 ( 1 usr)
% 0.07/0.31 % Number of type conns : 3 ( 3 >; 0 *; 0 +; 0 <<)
% 0.07/0.31 % Number of symbols : 2 ( 0 usr; 1 con; 0-2 aty)
% 0.07/0.31 % Number of variables : 8 ( 4 ^; 4 !; 0 ?; 8 :)
% 0.07/0.31 % SPC : TH0_THM_EQU_NAR
% 0.07/0.31
% 0.07/0.31 % Comments : This problem is from the TPS library. Copyright (c) 2009 The TPS
% 0.07/0.31 % project in the Department of Mathematical Sciences at Carnegie
% 0.07/0.31 % Mellon University. Distributed under the Creative Commons copyleft
% 0.07/0.31 % license: http://creativecommons.org/licenses/by-sa/3.0/
% 0.07/0.31 % : Polymorphic definitions expanded.
% 0.07/0.31 %------------------------------------------------------------------------------
% 0.07/0.31 thf(a_type,type,
% 0.07/0.31 a: $tType ).
% 0.07/0.31
% 0.07/0.31 thf(cBOOL_PROP_55_pme,conjecture,
% 0.07/0.31 ! [X: a > $o,Y: a > $o,Z: a > $o] :
% 0.07/0.31 ( ( ! [Xx: a] :
% 0.07/0.31 ( ( X @ Xx )
% 0.07/0.31 => ( Y @ Xx ) )
% 0.07/0.31 & ( ( ^ [Xx: a] :
% 0.07/0.31 ( ( Y @ Xx )
% 0.07/0.31 & ( Z @ Xx ) ) )
% 0.07/0.31 = ( ^ [Xx: a] : $false ) ) )
% 0.07/0.31 => ( ( ^ [Xx: a] :
% 0.07/0.31 ( ( X @ Xx )
% 0.07/0.31 & ( Z @ Xx ) ) )
% 0.07/0.31 = ( ^ [Xx: a] : $false ) ) ) ).
% 0.07/0.31
% 0.07/0.31 %------------------------------------------------------------------------------
% 0.07/0.31 ------------------------
% 0.82/0.87 ---- Embedded in THF ---
% 0.82/0.88 %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 0.82/0.88 %%% Generated on Tue Feb 24 06:59:56 EST 2026
% 0.82/0.88 %%% using '$$dhol' embedding, version 1.3.0.
% 0.82/0.88 %%% Logic specification used:
% 0.82/0.88 %%% thf(spec, logic, $$dhol).
% 0.82/0.88
% 0.82/0.88 % SZS output start ListOfTHF for /export/starexec/sandbox/tmp/tmp.yHYrnQ6CTY/DTF2DTF29329.p
% See solution above
% 0.82/0.88 ------------------------
% 0.82/0.88 ---- Cleaned THF ---
% 0.82/0.88 thf(a_type,type,
% 0.82/0.88 a: $tType ).
% 0.82/0.88
% 0.82/0.88 thf(cBOOL_PROP_55_pme,conjecture,
% 0.82/0.88 ! [X: a > $o,Y: a > $o,Z: a > $o] :
% 0.82/0.88 ( ( ! [Xx: a] :
% 0.82/0.88 ( ( X @ Xx )
% 0.82/0.88 => ( Y @ Xx ) )
% 0.82/0.88 & ( ( ^ [Xx: a] :
% 0.82/0.88 ( ( Y @ Xx )
% 0.82/0.88 & ( Z @ Xx ) ) )
% 0.82/0.88 = ( ^ [Xx: a] : $false ) ) )
% 0.82/0.88 => ( ( ^ [Xx: a] :
% 0.82/0.88 ( ( X @ Xx )
% 0.82/0.88 & ( Z @ Xx ) ) )
% 0.82/0.88 = ( ^ [Xx: a] : $false ) ) ) ).
% 0.82/0.88 ------------------------
% 0.82/0.89 % (29438)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_29329 for (3000ds/27Mi)
% 0.82/0.89 % (29437)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_29329 for (3000ds/4Mi)
% 0.82/0.89 % (29436)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on DTF2THF_29329 for (3000ds/183Mi)
% 0.82/0.89 % (29440)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_29329 for (3000ds/2Mi)
% 0.82/0.89 % (29439)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on DTF2THF_29329 for (3000ds/2Mi)
% 0.82/0.89 % (29441)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_29329 for (3000ds/275Mi)
% 0.82/0.89 % (29439)Instruction limit reached!
% 0.82/0.89 % (29439)------------------------------
% 0.82/0.89 % (29439)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 0.82/0.89 % (29439)Termination reason: Unknown
% 0.82/0.89 % (29440)Instruction limit reached!
% 0.82/0.89 % (29440)------------------------------
% 0.82/0.89 % (29440)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 0.82/0.89 % (29440)Termination reason: Unknown
% 0.82/0.89 % (29440)Termination phase: Saturation
% 0.82/0.89
% 0.82/0.89 % (29440)Memory used [KB]: 5500
% 0.82/0.89 % (29440)Time elapsed: 0.002 s
% 0.82/0.89 % (29440)Instructions burned: 2 (million)
% 0.82/0.89 % (29440)------------------------------
% 0.82/0.89 % (29440)------------------------------
% 0.82/0.89 % (29439)Termination phase: Saturation
% 0.82/0.89
% 0.82/0.89 % (29439)Memory used [KB]: 5500
% 0.82/0.89 % (29439)Time elapsed: 0.002 s
% 0.82/0.89 % (29439)Instructions burned: 2 (million)
% 0.82/0.89 % (29439)------------------------------
% 0.82/0.89 % (29439)------------------------------
% 0.82/0.89 % (29442)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on DTF2THF_29329 for (3000ds/18Mi)
% 0.82/0.90 % (29441)First to succeed.
% 0.82/0.90 % (29436)Also succeeded, but the first one will report.
% 0.99/0.90 % (29437)Also succeeded, but the first one will report.
% 0.99/0.90 % (29441)Refutation found. Thanks to Tanya!
% 0.99/0.90 % SZS status Theorem for DTF2THF_29329
% 0.99/0.90 % SZS output start Proof for DTF2THF_29329
% 0.99/0.90 thf(type_def_5, type, a: $tType).
% 0.99/0.90 thf(func_def_0, type, a: $tType).
% 0.99/0.90 thf(func_def_7, type, sK0: a > $o).
% 0.99/0.90 thf(func_def_8, type, sK1: a > $o).
% 0.99/0.90 thf(func_def_9, type, sK2: a > $o).
% 0.99/0.90 thf(func_def_11, type, ph4: !>[X0: $tType]:(X0)).
% 0.99/0.90 thf(func_def_12, type, sK5: a).
% 0.99/0.90 thf(f28,plain,(
% 0.99/0.90 $false),
% 0.99/0.90 inference(subsumption_resolution,[status(thm)],[f27,f18])).
% 0.99/0.90 thf(f18,plain,(
% 0.99/0.90 ((sK1 @ sK5) = $true)),
% 0.99/0.90 inference(binary_proxy_clausification,[status(thm)],[f17])).
% 0.99/0.90 thf(f17,plain,(
% 0.99/0.90 (((sK0 @ sK5) & (sK1 @ sK5)) != $false)),
% 0.99/0.90 inference(beta_eta_normalization,[status(thm)],[f16])).
% 0.99/0.90 thf(f16,plain,(
% 0.99/0.90 (((^[Y0 : a]: ((sK0 @ Y0) & (sK1 @ Y0))) @ sK5) != ((^[Y0 : a]: ($false)) @ sK5))),
% 0.99/0.90 inference(negative_extensionality,[status(thm)],[f11])).
% 0.99/0.90 thf(f11,plain,(
% 0.99/0.90 ((^[Y0 : a]: ($false)) != (^[Y0 : a]: ((sK0 @ Y0) & (sK1 @ Y0))))),
% 0.99/0.90 inference(cnf_transformation,[status(thm)],[f9])).
% 0.99/0.90 thf(f9,plain,(
% 0.99/0.90 ! [X3 : a] : (($true != (sK1 @ X3)) | ($true = (sK2 @ X3))) & ((^[Y0 : a]: ($false)) != (^[Y0 : a]: ((sK0 @ Y0) & (sK1 @ Y0)))) & ((^[Y0 : a]: ($false)) = (^[Y0 : a]: ((sK0 @ Y0) & (sK2 @ Y0))))),
% 0.99/0.90 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f7,f8])).
% 0.99/0.90 thf(f8,plain,(
% 0.99/0.90 ? [X0 : a > $o,X1 : a > $o,X2 : a > $o] : (! [X3 : a] : (((X1 @ X3) != $true) | ((X2 @ X3) = $true)) & ((^[Y0 : a]: ($false)) != (^[Y0 : a]: ((X0 @ Y0) & (X1 @ Y0)))) & ((^[Y0 : a]: ($false)) = (^[Y0 : a]: ((X0 @ Y0) & (X2 @ Y0))))) => (! [X3 : a] : (($true != (sK1 @ X3)) | ($true = (sK2 @ X3))) & ((^[Y0 : a]: ($false)) != (^[Y0 : a]: ((sK0 @ Y0) & (sK1 @ Y0)))) & ((^[Y0 : a]: ($false)) = (^[Y0 : a]: ((sK0 @ Y0) & (sK2 @ Y0)))))),
% 0.99/0.90 introduced(definition,[],[choice_axiom])).
% 0.99/0.90 thf(f7,plain,(
% 0.99/0.90 ? [X0 : a > $o,X1 : a > $o,X2 : a > $o] : (! [X3 : a] : (((X1 @ X3) != $true) | ((X2 @ X3) = $true)) & ((^[Y0 : a]: ($false)) != (^[Y0 : a]: ((X0 @ Y0) & (X1 @ Y0)))) & ((^[Y0 : a]: ($false)) = (^[Y0 : a]: ((X0 @ Y0) & (X2 @ Y0)))))),
% 0.99/0.90 inference(flattening,[status(thm)],[f6])).
% 0.99/0.90 thf(f6,plain,(
% 0.99/0.90 ? [X0 : a > $o,X1 : a > $o,X2 : a > $o] : (((^[Y0 : a]: ($false)) != (^[Y0 : a]: ((X0 @ Y0) & (X1 @ Y0)))) & (! [X3 : a] : (((X1 @ X3) != $true) | ((X2 @ X3) = $true)) & ((^[Y0 : a]: ($false)) = (^[Y0 : a]: ((X0 @ Y0) & (X2 @ Y0))))))),
% 0.99/0.90 inference(ennf_transformation,[status(thm)],[f5])).
% 0.99/0.90 thf(f5,plain,(
% 0.99/0.90 ~! [X0 : a > $o,X1 : a > $o,X2 : a > $o] : ((! [X3 : a] : (((X1 @ X3) = $true) => ((X2 @ X3) = $true)) & ((^[Y0 : a]: ($false)) = (^[Y0 : a]: ((X0 @ Y0) & (X2 @ Y0))))) => ((^[Y0 : a]: ($false)) = (^[Y0 : a]: ((X0 @ Y0) & (X1 @ Y0)))))),
% 0.99/0.90 inference(fool_elimination,[status(thm)],[f4])).
% 0.99/0.90 thf(f4,plain,(
% 0.99/0.90 ~! [X0 : a > $o,X1 : a > $o,X2 : a > $o] : ((! [X3 : a] : ((X1 @ X3) => (X2 @ X3)) & ((^[X4 : a] : ($false)) = (^[X5 : a] : ((X2 @ X5) & (X0 @ X5))))) => ((^[X6 : a] : ((X1 @ X6) & (X0 @ X6))) = (^[X7 : a] : ($false))))),
% 0.99/0.90 inference(rectify,[status(thm)],[f2])).
% 0.99/0.90 thf(f2,negated_conjecture,(
% 0.99/0.90 ~! [X2 : a > $o,X0 : a > $o,X1 : a > $o] : ((! [X3 : a] : ((X0 @ X3) => (X1 @ X3)) & ((^[X3 : a] : ($false)) = (^[X3 : a] : ((X1 @ X3) & (X2 @ X3))))) => ((^[X3 : a] : ((X0 @ X3) & (X2 @ X3))) = (^[X3 : a] : ($false))))),
% 0.99/0.90 inference(negated_conjecture,[status(cth)],[f1])).
% 0.99/0.90 thf(f1,conjecture,(
% 0.99/0.90 ! [X2 : a > $o,X0 : a > $o,X1 : a > $o] : ((! [X3 : a] : ((X0 @ X3) => (X1 @ X3)) & ((^[X3 : a] : ($false)) = (^[X3 : a] : ((X1 @ X3) & (X2 @ X3))))) => ((^[X3 : a] : ((X0 @ X3) & (X2 @ X3))) = (^[X3 : a] : ($false))))),
% 0.99/0.90 file('/export/starexec/sandbox/tmp/tmp.yHYrnQ6CTY/DTF2THF_29329.p',cBOOL_PROP_55_pme)).
% 0.99/0.90 thf(f27,plain,(
% 0.99/0.90 ((sK1 @ sK5) != $true)),
% 0.99/0.90 inference(trivial_inequality_removal,[status(thm)],[f25])).
% 0.99/0.90 thf(f25,plain,(
% 0.99/0.90 ((sK1 @ sK5) != $true) | ($false = $true)),
% 0.99/0.90 inference(superposition,[status(thm)],[f12,f23])).
% 0.99/0.90 thf(f23,plain,(
% 0.99/0.90 ((sK2 @ sK5) = $false)),
% 0.99/0.90 inference(trivial_inequality_removal,[status(thm)],[f21])).
% 0.99/0.90 thf(f21,plain,(
% 0.99/0.90 ((sK2 @ sK5) = $false) | ($false = $true)),
% 0.99/0.90 inference(superposition,[status(thm)],[f15,f19])).
% 0.99/0.90 thf(f19,plain,(
% 0.99/0.90 ((sK0 @ sK5) = $true)),
% 0.99/0.90 inference(binary_proxy_clausification,[status(thm)],[f17])).
% 0.99/0.90 thf(f15,plain,(
% 0.99/0.90 ( ! [X1 : a] : (($false = (sK0 @ X1)) | ((sK2 @ X1) = $false)) )),
% 0.99/0.90 inference(binary_proxy_clausification,[status(thm)],[f14])).
% 0.99/0.90 thf(f14,plain,(
% 0.99/0.90 ( ! [X1 : a] : (($false = ((sK0 @ X1) & (sK2 @ X1)))) )),
% 0.99/0.90 inference(beta_eta_normalization,[status(thm)],[f13])).
% 0.99/0.90 thf(f13,plain,(
% 0.99/0.90 ( ! [X1 : a] : ((((^[Y0 : a]: ($false)) @ X1) = ((^[Y0 : a]: ((sK0 @ Y0) & (sK2 @ Y0))) @ X1))) )),
% 0.99/0.90 inference(argument_congruence,[status(thm)],[f10])).
% 0.99/0.90 thf(f10,plain,(
% 0.99/0.90 ((^[Y0 : a]: ($false)) = (^[Y0 : a]: ((sK0 @ Y0) & (sK2 @ Y0))))),
% 0.99/0.90 inference(cnf_transformation,[status(thm)],[f9])).
% 0.99/0.90 thf(f12,plain,(
% 0.99/0.90 ( ! [X3 : a] : (($true = (sK2 @ X3)) | ($true != (sK1 @ X3))) )),
% 0.99/0.90 inference(cnf_transformation,[status(thm)],[f9])).
% 0.99/0.90 % SZS output end Proof for DTF2THF_29329
% 0.99/0.90 % (29441)------------------------------
% 0.99/0.90 % (29441)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 0.99/0.90 % (29441)Termination reason: Refutation
% 0.99/0.90
% 0.99/0.90 % (29441)Memory used [KB]: 5500
% 0.99/0.90 % (29441)Time elapsed: 0.002 s
% 0.99/0.90 % (29441)Instructions burned: 2 (million)
% 0.99/0.90 % (29441)------------------------------
% 0.99/0.90 % (29441)------------------------------
% 0.99/0.90 % (29435)Success in time 0.009 s
%------------------------------------------------------------------------------