%------------------------------------------------------------------------------
% File : DT2H2X---1.9.5
% Problem : SEU502^2 : TPTP v9.2.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/run_DT2H2X /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% Computer : n029.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:34:57 AM UTC 2026
% Result : Theorem 1.48s 1.29s
% Output : Refutation 1.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 6
% Syntax : Number of formulae : 34 ( 13 unt; 0 typ; 2 def)
% Number of atoms : 156 ( 34 equ; 0 cnn)
% Maximal formula atoms : 4 ( 4 avg)
% Number of connectives : 124 ( 17 ~; 10 |; 2 &; 66 @)
% ( 2 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 6 usr; 8 con; 0-2 aty)
% ( 9 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 35 ( 11 ^; 22 !; 2 ?; 35 :)
% Comments :
%------------------------------------------------------------------------------
thf(func_def_0,type,
in: $i > $i > $o ).
thf(f39,plain,
$false,
inference(avatar_sat_refutation,[status(thm)],[f29,f32,f38]) ).
thf(f38,plain,
~ spl1_1,
inference(avatar_contradiction_clause,[status(thm)],[f37]) ).
thf(f37,plain,
( $false
| ~ spl1_1 ),
inference(equality_resolution,[status(thm)],[f36]) ).
thf(f36,plain,
( ! [X0: $o] : ( $false != X0 )
| ~ spl1_1 ),
inference(superposition,[status(thm)],[f4,f25]) ).
thf(f25,plain,
( ! [X2: $o] : ( $true = X2 )
| ~ spl1_1 ),
inference(avatar_component_clause,[status(thm)],[f24]) ).
thf(f24,definition,
( spl1_1
<=> ! [X2: $o] : ( $true = X2 ) ),
introduced(definition,[new_symbols(naming,[spl1_1])],[avatar_definition]) ).
thf(f4,plain,
$false != $true,
introduced(definition,[],[fool_axiom]) ).
thf(f32,plain,
~ spl1_2,
inference(avatar_contradiction_clause,[status(thm)],[f31]) ).
thf(f31,plain,
( $false
| ~ spl1_2 ),
inference(trivial_inequality_removal,[status(thm)],[f30]) ).
thf(f30,plain,
( ( $false = $true )
| ~ spl1_2 ),
inference(backward_demodulation,[status(thm)],[f14,f28]) ).
thf(f28,plain,
( ! [X1: $i] :
( $false
= ( in @ X1 @ emptyset ) )
| ~ spl1_2 ),
inference(avatar_component_clause,[status(thm)],[f27]) ).
thf(f27,definition,
( spl1_2
<=> ! [X1: $i] :
( $false
= ( in @ X1 @ emptyset ) ) ),
introduced(definition,[new_symbols(naming,[spl1_2])],[avatar_definition]) ).
thf(f14,plain,
( $true
= ( in @ sK0 @ emptyset ) ),
inference(cnf_transformation,[status(thm)],[f13]) ).
thf(f13,plain,
( ( emptysetE = $true )
& ( $true
= ( in @ sK0 @ emptyset ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f11,f12]) ).
thf(f12,plain,
( ? [X0: $i] :
( ( in @ X0 @ emptyset )
= $true )
=> ( $true
= ( in @ sK0 @ emptyset ) ) ),
introduced(definition,[],[choice_axiom]) ).
thf(f11,plain,
( ( emptysetE = $true )
& ? [X0: $i] :
( ( in @ X0 @ emptyset )
= $true ) ),
inference(ennf_transformation,[status(thm)],[f10]) ).
thf(f10,plain,
~ ( ( emptysetE = $true )
=> ! [X0: $i] :
( ( in @ X0 @ emptyset )
!= $true ) ),
inference(flattening,[status(thm)],[f9]) ).
thf(f9,plain,
~ ( ( emptysetE = $true )
=> ! [X0: $i] :
( ( in @ X0 @ emptyset )
!= $true ) ),
inference(true_and_false_elimination,[status(thm)],[f8]) ).
thf(f8,plain,
~ ( ( emptysetE = $true )
=> ! [X0: $i] :
( ( ( in @ X0 @ emptyset )
= $true )
=> $false ) ),
inference(fool_elimination,[status(thm)],[f7]) ).
thf(f7,plain,
~ ( emptysetE
=> ! [X0: $i] :
( ( in @ X0 @ emptyset )
=> $false ) ),
inference(rectify,[status(thm)],[f3]) ).
thf(f3,negated_conjecture,
~ ( emptysetE
=> ! [X0: $i] :
( ( in @ X0 @ emptyset )
=> $false ) ),
inference(negated_conjecture,[status(cth)],[f2]) ).
thf(f2,conjecture,
( emptysetE
=> ! [X0: $i] :
( ( in @ X0 @ emptyset )
=> $false ) ),
file('/export/starexec/sandbox2/tmp/tmp.neffjrD2id/DTF2THF_26417.p',emptysetimpfalse) ).
thf(f29,plain,
( spl1_1
| spl1_2 ),
inference(avatar_split_clause,[status(thm)],[f22,f27,f24]) ).
thf(f22,plain,
! [X2: $o,X1: $i] :
( ( $true = X2 )
| ( $false
= ( in @ X1 @ emptyset ) ) ),
inference(beta_eta_normalization,[status(thm)],[f21]) ).
thf(f21,plain,
! [X2: $o,X1: $i] :
( ( $true
= ( ^ [Y0: $o] : Y0
@ X2 ) )
| ( $false
= ( in @ X1 @ emptyset ) ) ),
inference(pi_clausification,[status(thm)],[f20]) ).
thf(f20,plain,
! [X1: $i] :
( ( $false
= ( in @ X1 @ emptyset ) )
| ( $true
= ( !! @ $o
@ ^ [Y0: $o] : Y0 ) ) ),
inference(binary_proxy_clausification,[status(thm)],[f19]) ).
thf(f19,plain,
! [X1: $i] :
( ( ( in @ X1 @ emptyset )
=> ( !! @ $o
@ ^ [Y0: $o] : Y0 ) )
= $true ),
inference(beta_eta_normalization,[status(thm)],[f18]) ).
thf(f18,plain,
! [X1: $i] :
( $true
= ( ^ [Y0: $i] :
( ( in @ Y0 @ emptyset )
=> ( !! @ $o
@ ^ [Y1: $o] : Y1 ) )
@ X1 ) ),
inference(pi_clausification,[status(thm)],[f17]) ).
thf(f17,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ Y0 @ emptyset )
=> ( !! @ $o
@ ^ [Y1: $o] : Y1 ) ) )
= $true ),
inference(definition_unfolding,[status(thm)],[f16,f15]) ).
thf(f15,plain,
emptysetE = $true,
inference(cnf_transformation,[status(thm)],[f13]) ).
thf(f16,plain,
( emptysetE
= ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ Y0 @ emptyset )
=> ( !! @ $o
@ ^ [Y1: $o] : Y1 ) ) ) ),
inference(cnf_transformation,[status(thm)],[f6]) ).
thf(f6,plain,
( emptysetE
= ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ Y0 @ emptyset )
=> ( !! @ $o
@ ^ [Y1: $o] : Y1 ) ) ) ),
inference(fool_elimination,[status(thm)],[f5]) ).
thf(f5,plain,
( emptysetE
= ( ! [X0: $i] :
( ( in @ X0 @ emptyset )
=> ! [X1: $o] : X1 ) ) ),
inference(rectify,[status(thm)],[f1]) ).
thf(f1,axiom,
( emptysetE
= ( ! [X0: $i] :
( ( in @ X0 @ emptyset )
=> ! [X1: $o] : X1 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.neffjrD2id/DTF2THF_26417.p',emptysetE) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU502^2 : TPTP v9.2.1. Released v3.7.0.
% 0.12/0.13 % Command : /export/starexec/sandbox2/solver/bin/run_DT2H2X /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.16/0.34 % Computer : n029.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:24:44 EST 2026
% 0.16/0.34 % CPUTime :
% 0.16/0.34 Running /export/starexec/sandbox2/solver/bin/run_DT2H2X /export/starexec/sandbox2/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 : SEU502^2 : TPTP v9.2.1. Released v3.7.0.
% 0.30/0.46 % Domain : Set Theory
% 0.30/0.46 % Problem : Preliminary Notions - Basic Laws of Logic
% 0.30/0.46 % Version : Especial > Reduced > Especial.
% 0.30/0.46 % English : (! x:i.in x emptyset -> false)
% 0.30/0.46
% 0.30/0.46 % Refs : [Bro08] Brown (2008), Email to G. Sutcliffe
% 0.30/0.46 % Source : [Bro08]
% 0.30/0.46 % Names : ZFC004l [Bro08]
% 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 v6.0.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 v3.7.0
% 0.30/0.46 % Syntax : Number of formulae : 5 ( 1 unt; 3 typ; 1 def)
% 0.30/0.46 % Number of atoms : 6 ( 1 equ; 0 cnn)
% 0.30/0.46 % Maximal formula atoms : 3 ( 3 avg)
% 0.30/0.46 % Number of connectives : 7 ( 0 ~; 0 |; 0 &; 4 @)
% 0.30/0.46 % ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% 0.30/0.46 % Maximal formula depth : 6 ( 4 avg)
% 0.30/0.46 % Number of types : 2 ( 0 usr)
% 0.30/0.46 % Number of type conns : 2 ( 2 >; 0 *; 0 +; 0 <<)
% 0.30/0.46 % Number of symbols : 5 ( 3 usr; 3 con; 0-2 aty)
% 0.30/0.46 % Number of variables : 3 ( 0 ^; 3 !; 0 ?; 3 :)
% 0.30/0.46 % SPC : TH0_THM_EQU_NAR
% 0.30/0.46
% 0.30/0.46 % Comments : http://mathgate.info/detsetitem.php?id=391
% 0.30/0.46 %------------------------------------------------------------------------------
% 0.30/0.46 thf(in_type,type,
% 0.30/0.46 in: $i > $i > $o ).
% 0.30/0.46
% 0.30/0.46 thf(emptyset_type,type,
% 0.30/0.46 emptyset: $i ).
% 0.30/0.46
% 0.30/0.46 thf(emptysetE_type,type,
% 0.30/0.46 emptysetE: $o ).
% 0.30/0.46
% 0.30/0.46 thf(emptysetE,definition,
% 0.30/0.46 ( emptysetE
% 0.30/0.46 = ( ! [Xx: $i] :
% 0.30/0.46 ( ( in @ Xx @ emptyset )
% 0.30/0.46 => ! [Xphi: $o] : Xphi ) ) ) ).
% 0.30/0.46
% 0.30/0.46 thf(emptysetimpfalse,conjecture,
% 0.30/0.46 ( emptysetE
% 0.30/0.46 => ! [Xx: $i] :
% 0.30/0.46 ( ( in @ Xx @ emptyset )
% 0.30/0.46 => $false ) ) ).
% 0.30/0.46
% 0.30/0.46 %------------------------------------------------------------------------------
% 0.30/0.46 ------------------------
% 1.48/1.26 ---- Embedded in THF ---
% 1.48/1.27 %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.48/1.27 %%% Generated on Tue Feb 24 12:24:45 EST 2026
% 1.48/1.27 %%% using '$$dhol' embedding, version 1.3.0.
% 1.48/1.27 %%% Logic specification used:
% 1.48/1.27 %%% thf(spec, logic, $$dhol).
% 1.48/1.27
% 1.48/1.27 % SZS output start ListOfTHF for /export/starexec/sandbox2/tmp/tmp.neffjrD2id/DTF2DTF26417.p
% See solution above
% 1.48/1.27 ------------------------
% 1.48/1.27 ---- Cleaned THF ---
% 1.48/1.27 thf(in_type,type,
% 1.48/1.27 in: $i > $i > $o ).
% 1.48/1.27
% 1.48/1.27 thf(emptyset_type,type,
% 1.48/1.27 emptyset: $i ).
% 1.48/1.27
% 1.48/1.27 thf(emptysetE_type,type,
% 1.48/1.27 emptysetE: $o ).
% 1.48/1.27
% 1.48/1.27 thf(emptysetE,definition,
% 1.48/1.27 ( emptysetE
% 1.48/1.27 = ( ! [Xx: $i] :
% 1.48/1.27 ( ( in @ Xx @ emptyset )
% 1.48/1.27 => ! [Xphi: $o] : Xphi ) ) ) ).
% 1.48/1.27
% 1.48/1.27 thf(emptysetimpfalse,conjecture,
% 1.48/1.27 ( emptysetE
% 1.48/1.27 => ! [Xx: $i] :
% 1.48/1.27 ( ( in @ Xx @ emptyset )
% 1.48/1.27 => $false ) ) ).
% 1.48/1.28 ------------------------
% 1.48/1.29 % (26619)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_26417 for (2999ds/4Mi)
% 1.48/1.29 % (26619)First to succeed.
% 1.48/1.29 % (26619)Refutation found. Thanks to Tanya!
% 1.48/1.29 % SZS status Theorem for DTF2THF_26417
% 1.48/1.29 % SZS output start Proof for DTF2THF_26417
% 1.48/1.29 thf(func_def_0, type, in: $i > $i > $o).
% 1.48/1.29 thf(f39,plain,(
% 1.48/1.29 $false),
% 1.48/1.29 inference(avatar_sat_refutation,[status(thm)],[f29,f32,f38])).
% 1.48/1.29 thf(f38,plain,(
% 1.48/1.29 ~spl1_1),
% 1.48/1.29 inference(avatar_contradiction_clause,[status(thm)],[f37])).
% 1.48/1.29 thf(f37,plain,(
% 1.48/1.29 $false | ~spl1_1),
% 1.48/1.29 inference(equality_resolution,[status(thm)],[f36])).
% 1.48/1.29 thf(f36,plain,(
% 1.48/1.29 ( ! [X0 : $o] : (($false != X0)) ) | ~spl1_1),
% 1.48/1.29 inference(superposition,[status(thm)],[f4,f25])).
% 1.48/1.29 thf(f25,plain,(
% 1.48/1.29 ( ! [X2 : $o] : (($true = X2)) ) | ~spl1_1),
% 1.48/1.29 inference(avatar_component_clause,[status(thm)],[f24])).
% 1.48/1.29 thf(f24,definition,(
% 1.48/1.29 spl1_1 <=> ! [X2 : $o] : ($true = X2)),
% 1.48/1.29 introduced(definition,[new_symbols(naming,[spl1_1])],[avatar_definition])).
% 1.48/1.29 thf(f4,plain,(
% 1.48/1.29 ($false != $true)),
% 1.48/1.29 introduced(definition,[],[fool_axiom])).
% 1.48/1.29 thf(f32,plain,(
% 1.48/1.29 ~spl1_2),
% 1.48/1.29 inference(avatar_contradiction_clause,[status(thm)],[f31])).
% 1.48/1.29 thf(f31,plain,(
% 1.48/1.29 $false | ~spl1_2),
% 1.48/1.29 inference(trivial_inequality_removal,[status(thm)],[f30])).
% 1.48/1.29 thf(f30,plain,(
% 1.48/1.29 ($false = $true) | ~spl1_2),
% 1.48/1.29 inference(backward_demodulation,[status(thm)],[f14,f28])).
% 1.48/1.29 thf(f28,plain,(
% 1.48/1.29 ( ! [X1 : $i] : (($false = (in @ X1 @ emptyset))) ) | ~spl1_2),
% 1.48/1.29 inference(avatar_component_clause,[status(thm)],[f27])).
% 1.48/1.29 thf(f27,definition,(
% 1.48/1.29 spl1_2 <=> ! [X1 : $i] : ($false = (in @ X1 @ emptyset))),
% 1.48/1.29 introduced(definition,[new_symbols(naming,[spl1_2])],[avatar_definition])).
% 1.48/1.29 thf(f14,plain,(
% 1.48/1.29 ($true = (in @ sK0 @ emptyset))),
% 1.48/1.29 inference(cnf_transformation,[status(thm)],[f13])).
% 1.48/1.29 thf(f13,plain,(
% 1.48/1.29 (emptysetE = $true) & ($true = (in @ sK0 @ emptyset))),
% 1.48/1.29 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f11,f12])).
% 1.48/1.29 thf(f12,plain,(
% 1.48/1.29 ? [X0 : $i] : ((in @ X0 @ emptyset) = $true) => ($true = (in @ sK0 @ emptyset))),
% 1.48/1.29 introduced(definition,[],[choice_axiom])).
% 1.48/1.29 thf(f11,plain,(
% 1.48/1.29 (emptysetE = $true) & ? [X0 : $i] : ((in @ X0 @ emptyset) = $true)),
% 1.48/1.29 inference(ennf_transformation,[status(thm)],[f10])).
% 1.48/1.29 thf(f10,plain,(
% 1.48/1.29 ~((emptysetE = $true) => ! [X0 : $i] : ((in @ X0 @ emptyset) != $true))),
% 1.48/1.29 inference(flattening,[status(thm)],[f9])).
% 1.48/1.29 thf(f9,plain,(
% 1.48/1.29 ~((emptysetE = $true) => ! [X0 : $i] : ~((in @ X0 @ emptyset) = $true))),
% 1.48/1.29 inference(true_and_false_elimination,[status(thm)],[f8])).
% 1.48/1.29 thf(f8,plain,(
% 1.48/1.29 ~((emptysetE = $true) => ! [X0 : $i] : (((in @ X0 @ emptyset) = $true) => $false))),
% 1.48/1.29 inference(fool_elimination,[status(thm)],[f7])).
% 1.48/1.29 thf(f7,plain,(
% 1.48/1.29 ~(emptysetE => ! [X0 : $i] : ((in @ X0 @ emptyset) => $false))),
% 1.48/1.29 inference(rectify,[status(thm)],[f3])).
% 1.48/1.29 thf(f3,negated_conjecture,(
% 1.48/1.29 ~(emptysetE => ! [X0 : $i] : ((in @ X0 @ emptyset) => $false))),
% 1.48/1.29 inference(negated_conjecture,[status(cth)],[f2])).
% 1.48/1.29 thf(f2,conjecture,(
% 1.48/1.29 emptysetE => ! [X0 : $i] : ((in @ X0 @ emptyset) => $false)),
% 1.48/1.29 file('/export/starexec/sandbox2/tmp/tmp.neffjrD2id/DTF2THF_26417.p',emptysetimpfalse)).
% 1.48/1.29 thf(f29,plain,(
% 1.48/1.29 spl1_1 | spl1_2),
% 1.48/1.29 inference(avatar_split_clause,[status(thm)],[f22,f27,f24])).
% 1.48/1.29 thf(f22,plain,(
% 1.48/1.29 ( ! [X2 : $o,X1 : $i] : (($true = X2) | ($false = (in @ X1 @ emptyset))) )),
% 1.48/1.29 inference(beta_eta_normalization,[status(thm)],[f21])).
% 1.48/1.29 thf(f21,plain,(
% 1.48/1.29 ( ! [X2 : $o,X1 : $i] : (($true = ((^[Y0 : $o]: (Y0)) @ X2)) | ($false = (in @ X1 @ emptyset))) )),
% 1.48/1.29 inference(pi_clausification,[status(thm)],[f20])).
% 1.48/1.29 thf(f20,plain,(
% 1.48/1.29 ( ! [X1 : $i] : (($false = (in @ X1 @ emptyset)) | ($true = (!! @ $o @ (^[Y0 : $o]: (Y0))))) )),
% 1.48/1.29 inference(binary_proxy_clausification,[status(thm)],[f19])).
% 1.48/1.29 thf(f19,plain,(
% 1.48/1.29 ( ! [X1 : $i] : ((((in @ X1 @ emptyset) => (!! @ $o @ (^[Y0 : $o]: (Y0)))) = $true)) )),
% 1.48/1.29 inference(beta_eta_normalization,[status(thm)],[f18])).
% 1.48/1.29 thf(f18,plain,(
% 1.48/1.29 ( ! [X1 : $i] : (($true = ((^[Y0 : $i]: ((in @ Y0 @ emptyset) => (!! @ $o @ (^[Y1 : $o]: (Y1))))) @ X1))) )),
% 1.48/1.29 inference(pi_clausification,[status(thm)],[f17])).
% 1.48/1.29 thf(f17,plain,(
% 1.48/1.29 ((!! @ $i @ (^[Y0 : $i]: ((in @ Y0 @ emptyset) => (!! @ $o @ (^[Y1 : $o]: (Y1)))))) = $true)),
% 1.48/1.29 inference(definition_unfolding,[status(thm)],[f16,f15])).
% 1.48/1.29 thf(f15,plain,(
% 1.48/1.29 (emptysetE = $true)),
% 1.48/1.29 inference(cnf_transformation,[status(thm)],[f13])).
% 1.48/1.29 thf(f16,plain,(
% 1.48/1.29 (emptysetE = (!! @ $i @ (^[Y0 : $i]: ((in @ Y0 @ emptyset) => (!! @ $o @ (^[Y1 : $o]: (Y1)))))))),
% 1.48/1.29 inference(cnf_transformation,[status(thm)],[f6])).
% 1.48/1.29 thf(f6,plain,(
% 1.48/1.29 (emptysetE = (!! @ $i @ (^[Y0 : $i]: ((in @ Y0 @ emptyset) => (!! @ $o @ (^[Y1 : $o]: (Y1)))))))),
% 1.48/1.29 inference(fool_elimination,[status(thm)],[f5])).
% 1.48/1.29 thf(f5,plain,(
% 1.48/1.29 (emptysetE = ! [X0 : $i] : ((in @ X0 @ emptyset) => ! [X1 : $o] : X1))),
% 1.48/1.29 inference(rectify,[status(thm)],[f1])).
% 1.48/1.29 thf(f1,axiom,(
% 1.48/1.29 (emptysetE = ! [X0 : $i] : ((in @ X0 @ emptyset) => ! [X1 : $o] : X1))),
% 1.48/1.29 file('/export/starexec/sandbox2/tmp/tmp.neffjrD2id/DTF2THF_26417.p',emptysetE)).
% 1.48/1.29 % SZS output end Proof for DTF2THF_26417
% 1.48/1.29 % (26619)------------------------------
% 1.48/1.29 % (26619)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.48/1.29 % (26619)Termination reason: Refutation
% 1.48/1.29
% 1.48/1.29 % (26619)Memory used [KB]: 5500
% 1.48/1.29 % (26619)Time elapsed: 0.003 s
% 1.48/1.29 % (26619)Instructions burned: 1 (million)
% 1.48/1.29 % (26619)------------------------------
% 1.48/1.29 % (26619)------------------------------
% 1.48/1.29 % (26617)Success in time 0.012 s
%------------------------------------------------------------------------------