%------------------------------------------------------------------------------
% File : DT2H2X---1.9.5
% Problem : SET183^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 : n021.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:22 AM UTC 2026
% Result : Theorem 1.60s 1.32s
% Output : Refutation 1.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 4
% Syntax : Number of formulae : 31 ( 11 unt; 0 typ; 2 def)
% Number of atoms : 136 ( 44 equ; 0 cnn)
% Maximal formula atoms : 6 ( 4 avg)
% Number of connectives : 134 ( 23 ~; 19 |; 17 &; 64 @)
% ( 2 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 12 ( 12 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 31 ( 10 ^; 17 !; 4 ?; 31 :)
% 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_10,type,
ph3:
!>[X0: $tType] : X0 ).
thf(func_def_11,type,
sK4: a ).
thf(f42,plain,
$false,
inference(avatar_sat_refutation,[status(thm)],[f35,f38,f41]) ).
thf(f41,plain,
~ spl2_1,
inference(avatar_contradiction_clause,[status(thm)],[f40]) ).
thf(f40,plain,
( $false
| ~ spl2_1 ),
inference(trivial_inequality_removal,[status(thm)],[f39]) ).
thf(f39,plain,
( ( $true = $false )
| ~ spl2_1 ),
inference(backward_demodulation,[status(thm)],[f23,f30]) ).
thf(f30,plain,
( ( ( sK1 @ sK4 )
= $false )
| ~ spl2_1 ),
inference(avatar_component_clause,[status(thm)],[f28]) ).
thf(f28,definition,
( spl2_1
<=> ( ( sK1 @ sK4 )
= $false ) ),
introduced(definition,[new_symbols(naming,[spl2_1])],[avatar_definition]) ).
thf(f23,plain,
( ( sK1 @ sK4 )
= $true ),
inference(duplicate_literal_removal,[status(thm)],[f22]) ).
thf(f22,plain,
( ( ( sK1 @ sK4 )
= $true )
| ( ( sK1 @ sK4 )
= $true ) ),
inference(binary_proxy_clausification,[status(thm)],[f19]) ).
thf(f19,plain,
( ( ( ( sK1 @ sK4 )
& ( sK0 @ sK4 ) )
= $true )
| ( ( sK1 @ sK4 )
= $true ) ),
inference(binary_proxy_clausification,[status(thm)],[f18]) ).
thf(f18,plain,
( ( sK1 @ sK4 )
!= ( ( sK1 @ sK4 )
& ( sK0 @ sK4 ) ) ),
inference(beta_eta_normalization,[status(thm)],[f17]) ).
thf(f17,plain,
( ( sK1 @ sK4 )
!= ( ^ [Y0: a] :
( ( sK1 @ Y0 )
& ( sK0 @ Y0 ) )
@ sK4 ) ),
inference(negative_extensionality,[status(thm)],[f9]) ).
thf(f9,plain,
( sK1
!= ( ^ [Y0: a] :
( ( sK1 @ Y0 )
& ( sK0 @ Y0 ) ) ) ),
inference(cnf_transformation,[status(thm)],[f8]) ).
thf(f8,plain,
( ! [X2: a] :
( ( $true
= ( sK0 @ X2 ) )
| ( ( sK1 @ X2 )
!= $true ) )
& ( sK1
!= ( ^ [Y0: a] :
( ( sK1 @ Y0 )
& ( sK0 @ Y0 ) ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f6,f7]) ).
thf(f7,plain,
( ? [X0: a > $o,X1: a > $o] :
( ! [X2: a] :
( ( ( X0 @ X2 )
= $true )
| ( ( X1 @ X2 )
!= $true ) )
& ( ( ^ [Y0: a] :
( ( X1 @ Y0 )
& ( X0 @ Y0 ) ) )
!= X1 ) )
=> ( ! [X2: a] :
( ( $true
= ( sK0 @ X2 ) )
| ( ( sK1 @ X2 )
!= $true ) )
& ( sK1
!= ( ^ [Y0: a] :
( ( sK1 @ Y0 )
& ( sK0 @ Y0 ) ) ) ) ) ),
introduced(definition,[],[choice_axiom]) ).
thf(f6,plain,
? [X0: a > $o,X1: a > $o] :
( ! [X2: a] :
( ( ( X0 @ X2 )
= $true )
| ( ( X1 @ X2 )
!= $true ) )
& ( ( ^ [Y0: a] :
( ( X1 @ Y0 )
& ( X0 @ Y0 ) ) )
!= X1 ) ),
inference(ennf_transformation,[status(thm)],[f5]) ).
thf(f5,plain,
~ ! [X0: a > $o,X1: a > $o] :
( ! [X2: a] :
( ( ( X1 @ X2 )
= $true )
=> ( ( X0 @ X2 )
= $true ) )
=> ( ( ^ [Y0: a] :
( ( X1 @ Y0 )
& ( X0 @ Y0 ) ) )
= X1 ) ),
inference(fool_elimination,[status(thm)],[f4]) ).
thf(f4,plain,
~ ! [X0: a > $o,X1: a > $o] :
( ! [X2: a] :
( ( X1 @ X2 )
=> ( X0 @ X2 ) )
=> ( X1
= ( ^ [X3: a] :
( ( X0 @ X3 )
& ( X1 @ X3 ) ) ) ) ),
inference(rectify,[status(thm)],[f2]) ).
thf(f2,negated_conjecture,
~ ! [X1: a > $o,X0: a > $o] :
( ! [X2: a] :
( ( X0 @ X2 )
=> ( X1 @ X2 ) )
=> ( X0
= ( ^ [X2: a] :
( ( X1 @ X2 )
& ( X0 @ X2 ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f1,conjecture,
! [X1: a > $o,X0: a > $o] :
( ! [X2: a] :
( ( X0 @ X2 )
=> ( X1 @ X2 ) )
=> ( X0
= ( ^ [X2: a] :
( ( X1 @ X2 )
& ( X0 @ X2 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.BM1xjCpQJV/DTF2THF_2861.p',cBOOL_PROP_42_pme) ).
thf(f38,plain,
~ spl2_2,
inference(avatar_contradiction_clause,[status(thm)],[f37]) ).
thf(f37,plain,
( $false
| ~ spl2_2 ),
inference(trivial_inequality_removal,[status(thm)],[f36]) ).
thf(f36,plain,
( ( $true = $false )
| ~ spl2_2 ),
inference(backward_demodulation,[status(thm)],[f24,f34]) ).
thf(f34,plain,
( ( $false
= ( sK0 @ sK4 ) )
| ~ spl2_2 ),
inference(avatar_component_clause,[status(thm)],[f32]) ).
thf(f32,definition,
( spl2_2
<=> ( $false
= ( sK0 @ sK4 ) ) ),
introduced(definition,[new_symbols(naming,[spl2_2])],[avatar_definition]) ).
thf(f24,plain,
( $true
= ( sK0 @ sK4 ) ),
inference(subsumption_resolution,[status(thm)],[f21,f10]) ).
thf(f10,plain,
! [X2: a] :
( ( ( sK1 @ X2 )
!= $true )
| ( $true
= ( sK0 @ X2 ) ) ),
inference(cnf_transformation,[status(thm)],[f8]) ).
thf(f21,plain,
( ( ( sK1 @ sK4 )
= $true )
| ( $true
= ( sK0 @ sK4 ) ) ),
inference(binary_proxy_clausification,[status(thm)],[f19]) ).
thf(f35,plain,
( spl2_1
| spl2_2 ),
inference(avatar_split_clause,[status(thm)],[f26,f32,f28]) ).
thf(f26,plain,
( ( $false
= ( sK0 @ sK4 ) )
| ( ( sK1 @ sK4 )
= $false ) ),
inference(duplicate_literal_removal,[status(thm)],[f25]) ).
thf(f25,plain,
( ( ( sK1 @ sK4 )
= $false )
| ( ( sK1 @ sK4 )
= $false )
| ( $false
= ( sK0 @ sK4 ) ) ),
inference(binary_proxy_clausification,[status(thm)],[f20]) ).
thf(f20,plain,
( ( ( ( sK1 @ sK4 )
& ( sK0 @ sK4 ) )
= $false )
| ( ( sK1 @ sK4 )
= $false ) ),
inference(binary_proxy_clausification,[status(thm)],[f18]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET183^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 : n021.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:24 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.30/0.46 ---- Original DTF file ---
% 0.30/0.46 thf(spec,logic,$$dhol).
% 0.30/0.46 %------------------------------------------------------------------------------
% 0.30/0.46 % File : SET183^5 : TPTP v9.2.1. Released v4.0.0.
% 0.30/0.46 % Domain : Set Theory
% 0.30/0.46 % Problem : TPS problem BOOL-PROP-42
% 0.30/0.46 % Version : Especial.
% 0.30/0.46 % English : Trybulec's 42nd Boolean property of sets
% 0.30/0.46
% 0.30/0.46 % Refs : [TS89] Trybulec & Swieczkowska (1989), Boolean Properties of
% 0.30/0.46 % : [Bro09] Brown (2009), Email to Geoff Sutcliffe
% 0.30/0.46 % Source : [Bro09]
% 0.30/0.46 % Names : tps_0109 [Bro09]
% 0.30/0.46 % : BOOL-PROP-42 [TPS]
% 0.30/0.46
% 0.30/0.46 % Status : Theorem
% 0.30/0.46 % 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.1, 0.33 v4.0.0
% 0.30/0.46 % Syntax : Number of formulae : 2 ( 1 unt; 1 typ; 0 def)
% 0.30/0.46 % Number of atoms : 1 ( 1 equ; 0 cnn)
% 0.30/0.46 % Maximal formula atoms : 1 ( 1 avg)
% 0.30/0.46 % Number of connectives : 7 ( 0 ~; 0 |; 1 &; 4 @)
% 0.30/0.46 % ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% 0.30/0.46 % Maximal formula depth : 7 ( 7 avg)
% 0.30/0.46 % Number of types : 2 ( 1 usr)
% 0.30/0.46 % Number of type conns : 2 ( 2 >; 0 *; 0 +; 0 <<)
% 0.30/0.46 % Number of symbols : 1 ( 0 usr; 0 con; 2-2 aty)
% 0.30/0.46 % Number of variables : 4 ( 1 ^; 3 !; 0 ?; 4 :)
% 0.30/0.46 % SPC : TH0_THM_EQU_NAR
% 0.30/0.46
% 0.30/0.46 % Comments : This problem is from the TPS library. Copyright (c) 2009 The TPS
% 0.30/0.46 % project in the Department of Mathematical Sciences at Carnegie
% 0.30/0.46 % Mellon University. Distributed under the Creative Commons copyleft
% 0.30/0.46 % license: http://creativecommons.org/licenses/by-sa/3.0/
% 0.30/0.46 % : Polymorphic definitions expanded.
% 0.30/0.46 % :
% 0.30/0.46 %------------------------------------------------------------------------------
% 0.30/0.46 thf(a_type,type,
% 0.30/0.46 a: $tType ).
% 0.30/0.46
% 0.30/0.46 thf(cBOOL_PROP_42_pme,conjecture,
% 0.30/0.46 ! [X: a > $o,Y: a > $o] :
% 0.30/0.46 ( ! [Xx: a] :
% 0.30/0.46 ( ( X @ Xx )
% 0.30/0.46 => ( Y @ Xx ) )
% 0.30/0.46 => ( ( ^ [Xx: a] :
% 0.30/0.46 ( ( X @ Xx )
% 0.30/0.46 & ( Y @ Xx ) ) )
% 0.30/0.46 = X ) ) ).
% 0.30/0.46
% 0.30/0.46 %------------------------------------------------------------------------------
% 0.30/0.46 ------------------------
% 1.42/1.29 ---- Embedded in THF ---
% 1.42/1.29 %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.42/1.29 %%% Generated on Tue Feb 24 11:54:24 EST 2026
% 1.42/1.29 %%% using '$$dhol' embedding, version 1.3.0.
% 1.42/1.29 %%% Logic specification used:
% 1.42/1.29 %%% thf(spec, logic, $$dhol).
% 1.42/1.29
% 1.42/1.29 % SZS output start ListOfTHF for /export/starexec/sandbox/tmp/tmp.BM1xjCpQJV/DTF2DTF2861.p
% See solution above
% 1.42/1.29 ------------------------
% 1.60/1.30 ---- Cleaned THF ---
% 1.60/1.30 thf(a_type,type,
% 1.60/1.30 a: $tType ).
% 1.60/1.30
% 1.60/1.30 thf(cBOOL_PROP_42_pme,conjecture,
% 1.60/1.30 ! [X: a > $o,Y: a > $o] :
% 1.60/1.30 ( ! [Xx: a] :
% 1.60/1.30 ( ( X @ Xx )
% 1.60/1.30 => ( Y @ Xx ) )
% 1.60/1.30 => ( ( ^ [Xx: a] :
% 1.60/1.30 ( ( X @ Xx )
% 1.60/1.30 & ( Y @ Xx ) ) )
% 1.60/1.30 = X ) ) ).
% 1.60/1.30 ------------------------
% 1.60/1.31 % (3196)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_2861 for (2999ds/2Mi)
% 1.60/1.32 % (3196)Instruction limit reached!
% 1.60/1.32 % (3196)------------------------------
% 1.60/1.32 % (3196)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.60/1.32 % (3196)Termination reason: Unknown
% 1.60/1.32 % (3196)Termination phase: Saturation
% 1.60/1.32
% 1.60/1.32 % (3196)Memory used [KB]: 5500
% 1.60/1.32 % (3196)Time elapsed: 0.003 s
% 1.60/1.32 % (3196)Instructions burned: 3 (million)
% 1.60/1.32 % (3196)------------------------------
% 1.60/1.32 % (3196)------------------------------
% 1.60/1.32 % (3193)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_2861 for (2999ds/4Mi)
% 1.60/1.32 % (3192)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on DTF2THF_2861 for (2999ds/183Mi)
% 1.60/1.32 % (3194)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_2861 for (2999ds/27Mi)
% 1.60/1.32 % (3195)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on DTF2THF_2861 for (2999ds/2Mi)
% 1.60/1.32 % (3197)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_2861 for (2999ds/275Mi)
% 1.60/1.32 % (3198)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on DTF2THF_2861 for (2999ds/18Mi)
% 1.60/1.32 % (3193)First to succeed.
% 1.60/1.32 % (3195)Also succeeded, but the first one will report.
% 1.60/1.32 % (3193)Refutation found. Thanks to Tanya!
% 1.60/1.32 % SZS status Theorem for DTF2THF_2861
% 1.60/1.32 % SZS output start Proof for DTF2THF_2861
% 1.60/1.32 thf(type_def_5, type, a: $tType).
% 1.60/1.32 thf(func_def_0, type, a: $tType).
% 1.60/1.32 thf(func_def_7, type, sK0: a > $o).
% 1.60/1.32 thf(func_def_8, type, sK1: a > $o).
% 1.60/1.32 thf(func_def_10, type, ph3: !>[X0: $tType]:(X0)).
% 1.60/1.32 thf(func_def_11, type, sK4: a).
% 1.60/1.32 thf(f42,plain,(
% 1.60/1.32 $false),
% 1.60/1.32 inference(avatar_sat_refutation,[status(thm)],[f35,f38,f41])).
% 1.60/1.32 thf(f41,plain,(
% 1.60/1.32 ~spl2_1),
% 1.60/1.32 inference(avatar_contradiction_clause,[status(thm)],[f40])).
% 1.60/1.32 thf(f40,plain,(
% 1.60/1.32 $false | ~spl2_1),
% 1.60/1.32 inference(trivial_inequality_removal,[status(thm)],[f39])).
% 1.60/1.32 thf(f39,plain,(
% 1.60/1.32 ($true = $false) | ~spl2_1),
% 1.60/1.32 inference(backward_demodulation,[status(thm)],[f23,f30])).
% 1.60/1.32 thf(f30,plain,(
% 1.60/1.32 ((sK1 @ sK4) = $false) | ~spl2_1),
% 1.60/1.32 inference(avatar_component_clause,[status(thm)],[f28])).
% 1.60/1.32 thf(f28,definition,(
% 1.60/1.32 spl2_1 <=> ((sK1 @ sK4) = $false)),
% 1.60/1.32 introduced(definition,[new_symbols(naming,[spl2_1])],[avatar_definition])).
% 1.60/1.32 thf(f23,plain,(
% 1.60/1.32 ((sK1 @ sK4) = $true)),
% 1.60/1.32 inference(duplicate_literal_removal,[status(thm)],[f22])).
% 1.60/1.32 thf(f22,plain,(
% 1.60/1.32 ((sK1 @ sK4) = $true) | ((sK1 @ sK4) = $true)),
% 1.60/1.32 inference(binary_proxy_clausification,[status(thm)],[f19])).
% 1.60/1.32 thf(f19,plain,(
% 1.60/1.32 (((sK1 @ sK4) & (sK0 @ sK4)) = $true) | ((sK1 @ sK4) = $true)),
% 1.60/1.32 inference(binary_proxy_clausification,[status(thm)],[f18])).
% 1.60/1.32 thf(f18,plain,(
% 1.60/1.32 ((sK1 @ sK4) != ((sK1 @ sK4) & (sK0 @ sK4)))),
% 1.60/1.32 inference(beta_eta_normalization,[status(thm)],[f17])).
% 1.60/1.32 thf(f17,plain,(
% 1.60/1.32 ((sK1 @ sK4) != ((^[Y0 : a]: ((sK1 @ Y0) & (sK0 @ Y0))) @ sK4))),
% 1.60/1.32 inference(negative_extensionality,[status(thm)],[f9])).
% 1.60/1.32 thf(f9,plain,(
% 1.60/1.32 (sK1 != (^[Y0 : a]: ((sK1 @ Y0) & (sK0 @ Y0))))),
% 1.60/1.32 inference(cnf_transformation,[status(thm)],[f8])).
% 1.60/1.32 thf(f8,plain,(
% 1.60/1.32 ! [X2 : a] : (($true = (sK0 @ X2)) | ((sK1 @ X2) != $true)) & (sK1 != (^[Y0 : a]: ((sK1 @ Y0) & (sK0 @ Y0))))),
% 1.60/1.32 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f6,f7])).
% 1.60/1.32 thf(f7,plain,(
% 1.60/1.32 ? [X0 : a > $o,X1 : a > $o] : (! [X2 : a] : (((X0 @ X2) = $true) | ((X1 @ X2) != $true)) & ((^[Y0 : a]: ((X1 @ Y0) & (X0 @ Y0))) != X1)) => (! [X2 : a] : (($true = (sK0 @ X2)) | ((sK1 @ X2) != $true)) & (sK1 != (^[Y0 : a]: ((sK1 @ Y0) & (sK0 @ Y0)))))),
% 1.60/1.32 introduced(definition,[],[choice_axiom])).
% 1.60/1.32 thf(f6,plain,(
% 1.60/1.32 ? [X0 : a > $o,X1 : a > $o] : (! [X2 : a] : (((X0 @ X2) = $true) | ((X1 @ X2) != $true)) & ((^[Y0 : a]: ((X1 @ Y0) & (X0 @ Y0))) != X1))),
% 1.60/1.32 inference(ennf_transformation,[status(thm)],[f5])).
% 1.60/1.32 thf(f5,plain,(
% 1.60/1.32 ~! [X0 : a > $o,X1 : a > $o] : (! [X2 : a] : (((X1 @ X2) = $true) => ((X0 @ X2) = $true)) => ((^[Y0 : a]: ((X1 @ Y0) & (X0 @ Y0))) = X1))),
% 1.60/1.32 inference(fool_elimination,[status(thm)],[f4])).
% 1.60/1.32 thf(f4,plain,(
% 1.60/1.32 ~! [X0 : a > $o,X1 : a > $o] : (! [X2 : a] : ((X1 @ X2) => (X0 @ X2)) => (X1 = (^[X3 : a] : ((X0 @ X3) & (X1 @ X3)))))),
% 1.60/1.32 inference(rectify,[status(thm)],[f2])).
% 1.60/1.32 thf(f2,negated_conjecture,(
% 1.60/1.32 ~! [X1 : a > $o,X0 : a > $o] : (! [X2 : a] : ((X0 @ X2) => (X1 @ X2)) => (X0 = (^[X2 : a] : ((X1 @ X2) & (X0 @ X2)))))),
% 1.60/1.32 inference(negated_conjecture,[status(cth)],[f1])).
% 1.60/1.32 thf(f1,conjecture,(
% 1.60/1.32 ! [X1 : a > $o,X0 : a > $o] : (! [X2 : a] : ((X0 @ X2) => (X1 @ X2)) => (X0 = (^[X2 : a] : ((X1 @ X2) & (X0 @ X2)))))),
% 1.60/1.32 file('/export/starexec/sandbox/tmp/tmp.BM1xjCpQJV/DTF2THF_2861.p',cBOOL_PROP_42_pme)).
% 1.60/1.32 thf(f38,plain,(
% 1.60/1.32 ~spl2_2),
% 1.60/1.32 inference(avatar_contradiction_clause,[status(thm)],[f37])).
% 1.60/1.32 thf(f37,plain,(
% 1.60/1.32 $false | ~spl2_2),
% 1.60/1.32 inference(trivial_inequality_removal,[status(thm)],[f36])).
% 1.60/1.32 thf(f36,plain,(
% 1.60/1.32 ($true = $false) | ~spl2_2),
% 1.60/1.32 inference(backward_demodulation,[status(thm)],[f24,f34])).
% 1.60/1.32 thf(f34,plain,(
% 1.60/1.32 ($false = (sK0 @ sK4)) | ~spl2_2),
% 1.60/1.32 inference(avatar_component_clause,[status(thm)],[f32])).
% 1.60/1.32 thf(f32,definition,(
% 1.60/1.32 spl2_2 <=> ($false = (sK0 @ sK4))),
% 1.60/1.32 introduced(definition,[new_symbols(naming,[spl2_2])],[avatar_definition])).
% 1.60/1.32 thf(f24,plain,(
% 1.60/1.32 ($true = (sK0 @ sK4))),
% 1.60/1.32 inference(subsumption_resolution,[status(thm)],[f21,f10])).
% 1.60/1.32 thf(f10,plain,(
% 1.60/1.32 ( ! [X2 : a] : (((sK1 @ X2) != $true) | ($true = (sK0 @ X2))) )),
% 1.60/1.32 inference(cnf_transformation,[status(thm)],[f8])).
% 1.60/1.32 thf(f21,plain,(
% 1.60/1.33 ((sK1 @ sK4) = $true) | ($true = (sK0 @ sK4))),
% 1.60/1.33 inference(binary_proxy_clausification,[status(thm)],[f19])).
% 1.60/1.33 thf(f35,plain,(
% 1.60/1.33 spl2_1 | spl2_2),
% 1.60/1.33 inference(avatar_split_clause,[status(thm)],[f26,f32,f28])).
% 1.60/1.33 thf(f26,plain,(
% 1.60/1.33 ($false = (sK0 @ sK4)) | ((sK1 @ sK4) = $false)),
% 1.60/1.33 inference(duplicate_literal_removal,[status(thm)],[f25])).
% 1.60/1.33 thf(f25,plain,(
% 1.60/1.33 ((sK1 @ sK4) = $false) | ((sK1 @ sK4) = $false) | ($false = (sK0 @ sK4))),
% 1.60/1.33 inference(binary_proxy_clausification,[status(thm)],[f20])).
% 1.60/1.33 thf(f20,plain,(
% 1.60/1.33 (((sK1 @ sK4) & (sK0 @ sK4)) = $false) | ((sK1 @ sK4) = $false)),
% 1.60/1.33 inference(binary_proxy_clausification,[status(thm)],[f18])).
% 1.60/1.33 % SZS output end Proof for DTF2THF_2861
% 1.60/1.33 % (3193)------------------------------
% 1.60/1.33 % (3193)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.60/1.33 % (3193)Termination reason: Refutation
% 1.60/1.33
% 1.60/1.33 % (3193)Memory used [KB]: 5500
% 1.60/1.33 % (3193)Time elapsed: 0.004 s
% 1.60/1.33 % (3193)Instructions burned: 2 (million)
% 1.60/1.33 % (3193)------------------------------
% 1.60/1.33 % (3193)------------------------------
% 1.60/1.33 % (3191)Success in time 0.02 s
%------------------------------------------------------------------------------