%------------------------------------------------------------------------------
% File : DT2H2X---1.9.5
% Problem : SET591^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 : n013.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:50 AM UTC 2026
% Result : Theorem 1.48s 1.26s
% Output : Refutation 1.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 2
% Syntax : Number of formulae : 16 ( 9 unt; 0 typ; 0 def)
% Number of atoms : 90 ( 36 equ; 0 cnn)
% Maximal formula atoms : 8 ( 5 avg)
% Number of connectives : 93 ( 28 ~; 6 |; 13 &; 35 @)
% ( 0 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 6 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 14 ( 14 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 3 usr; 3 con; 0-2 aty)
% Number of variables : 38 ( 11 ^; 23 !; 4 ?; 38 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(func_def_0,type,
a: $tType ).
thf(func_def_5,type,
sK0: a > $o ).
thf(func_def_6,type,
sK1: a > $o ).
thf(func_def_8,type,
sK3: a ).
thf(f22,plain,
$false,
inference(subsumption_resolution,[status(thm)],[f21,f15]) ).
thf(f15,plain,
! [X2: a] :
( $false
= ( sK0 @ X2 ) ),
inference(trivial_inequality_removal,[status(thm)],[f14]) ).
thf(f14,plain,
! [X2: a] :
( ( $false
= ( sK0 @ X2 ) )
| ( $true != $true ) ),
inference(fool_paramodulation,[status(thm)],[f13]) ).
thf(f13,plain,
! [X2: a] :
( ( sK0 @ X2 )
!= $true ),
inference(duplicate_literal_removal,[status(thm)],[f10]) ).
thf(f10,plain,
! [X2: a] :
( ( ( sK0 @ X2 )
!= $true )
| ( ( sK0 @ X2 )
!= $true ) ),
inference(cnf_transformation,[status(thm)],[f9]) ).
thf(f9,plain,
( ( ( ^ [Y0: a] : $false )
!= sK0 )
& ! [X2: a] :
( ( ( ( sK1 @ X2 )
= $true )
& ( ( sK0 @ X2 )
!= $true ) )
| ( ( sK0 @ X2 )
!= $true ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f7,f8]) ).
thf(f8,plain,
( ? [X0: a > $o,X1: a > $o] :
( ( ( ^ [Y0: a] : $false )
!= X0 )
& ! [X2: a] :
( ( ( ( X1 @ X2 )
= $true )
& ( ( X0 @ X2 )
!= $true ) )
| ( ( X0 @ X2 )
!= $true ) ) )
=> ( ( ( ^ [Y0: a] : $false )
!= sK0 )
& ! [X2: a] :
( ( ( ( sK1 @ X2 )
= $true )
& ( ( sK0 @ X2 )
!= $true ) )
| ( ( sK0 @ X2 )
!= $true ) ) ) ),
introduced(definition,[],[choice_axiom]) ).
thf(f7,plain,
? [X0: a > $o,X1: a > $o] :
( ( ( ^ [Y0: a] : $false )
!= X0 )
& ! [X2: a] :
( ( ( ( X1 @ X2 )
= $true )
& ( ( X0 @ X2 )
!= $true ) )
| ( ( X0 @ X2 )
!= $true ) ) ),
inference(ennf_transformation,[status(thm)],[f6]) ).
thf(f6,plain,
~ ! [X0: a > $o,X1: a > $o] :
( ! [X2: a] :
( ( ( X0 @ X2 )
= $true )
=> ( ( ( X1 @ X2 )
= $true )
& ( ( X0 @ X2 )
!= $true ) ) )
=> ( ( ^ [Y0: a] : $false )
= X0 ) ),
inference(flattening,[status(thm)],[f5]) ).
thf(f5,plain,
~ ! [X0: a > $o,X1: a > $o] :
( ! [X2: a] :
( ( ( X0 @ X2 )
= $true )
=> ( ( ( X0 @ X2 )
!= $true )
& ( ( X1 @ X2 )
= $true ) ) )
=> ( ( ^ [Y0: a] : $false )
= X0 ) ),
inference(fool_elimination,[status(thm)],[f4]) ).
thf(f4,plain,
~ ! [X0: a > $o,X1: a > $o] :
( ! [X2: a] :
( ( X0 @ X2 )
=> ( ~ ( X0 @ X2 )
& ( X1 @ X2 ) ) )
=> ( X0
= ( ^ [X3: a] : $false ) ) ),
inference(rectify,[status(thm)],[f2]) ).
thf(f2,negated_conjecture,
~ ! [X0: a > $o,X1: a > $o] :
( ! [X2: a] :
( ( X0 @ X2 )
=> ( ~ ( X0 @ X2 )
& ( X1 @ X2 ) ) )
=> ( X0
= ( ^ [X2: a] : $false ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f1,conjecture,
! [X0: a > $o,X1: a > $o] :
( ! [X2: a] :
( ( X0 @ X2 )
=> ( ~ ( X0 @ X2 )
& ( X1 @ X2 ) ) )
=> ( X0
= ( ^ [X2: a] : $false ) ) ),
file('/export/starexec/sandbox/tmp/tmp.QxbZGpNSpN/DTF2THF_31613.p',cBOOL_PROP_50_pme) ).
thf(f21,plain,
( $false
!= ( sK0 @ sK3 ) ),
inference(beta_eta_normalization,[status(thm)],[f20]) ).
thf(f20,plain,
( ( ^ [Y0: a] : $false
@ sK3 )
!= ( sK0 @ sK3 ) ),
inference(negative_extensionality,[status(thm)],[f12]) ).
thf(f12,plain,
( ( ^ [Y0: a] : $false )
!= sK0 ),
inference(cnf_transformation,[status(thm)],[f9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SET591^5 : TPTP v9.2.1. Released v4.0.0.
% 0.00/0.12 % Command : /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.16/0.33 % Computer : n013.cluster.edu
% 0.16/0.33 % Model : x86_64 x86_64
% 0.16/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33 % Memory : 8042.1875MB
% 0.16/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33 % CPULimit : 300
% 0.16/0.33 % WCLimit : 300
% 0.16/0.33 % DateTime : Tue Feb 24 11:59:38 EST 2026
% 0.16/0.33 % CPUTime :
% 0.16/0.33 Running /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.18/0.44 ---- Original DTF file ---
% 0.18/0.44 thf(spec,logic,$$dhol).
% 0.18/0.44 %------------------------------------------------------------------------------
% 0.18/0.44 % File : SET591^5 : TPTP v9.2.1. Released v4.0.0.
% 0.18/0.44 % Domain : Set Theory
% 0.18/0.44 % Problem : TPS problem BOOL-PROP-50
% 0.18/0.44 % Version : Especial.
% 0.18/0.44 % English : Trybulec's 50th Boolean property of sets
% 0.18/0.44
% 0.18/0.44 % Refs : [TS89] Trybulec & Swieczkowska (1989), Boolean Properties of
% 0.18/0.44 % : [Bro09] Brown (2009), Email to Geoff Sutcliffe
% 0.18/0.44 % Source : [Bro09]
% 0.18/0.44 % Names : tps_0108 [Bro09]
% 0.18/0.44 % : BOOL-PROP-50 [TPS]
% 0.18/0.44
% 0.18/0.44 % Status : Theorem
% 0.18/0.44 % 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.18/0.44 % Syntax : Number of formulae : 2 ( 1 unt; 1 typ; 0 def)
% 0.18/0.44 % Number of atoms : 2 ( 1 equ; 0 cnn)
% 0.18/0.44 % Maximal formula atoms : 1 ( 2 avg)
% 0.18/0.44 % Number of connectives : 7 ( 1 ~; 0 |; 1 &; 3 @)
% 0.18/0.44 % ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% 0.18/0.44 % Maximal formula depth : 9 ( 9 avg)
% 0.18/0.44 % Number of types : 2 ( 1 usr)
% 0.18/0.44 % Number of type conns : 2 ( 2 >; 0 *; 0 +; 0 <<)
% 0.18/0.44 % Number of symbols : 2 ( 0 usr; 1 con; 0-2 aty)
% 0.18/0.44 % Number of variables : 4 ( 1 ^; 3 !; 0 ?; 4 :)
% 0.18/0.44 % SPC : TH0_THM_EQU_NAR
% 0.18/0.44
% 0.18/0.44 % Comments : This problem is from the TPS library. Copyright (c) 2009 The TPS
% 0.18/0.44 % project in the Department of Mathematical Sciences at Carnegie
% 0.18/0.44 % Mellon University. Distributed under the Creative Commons copyleft
% 0.18/0.44 % license: http://creativecommons.org/licenses/by-sa/3.0/
% 0.18/0.44 % : Polymorphic definitions expanded.
% 0.18/0.44 %------------------------------------------------------------------------------
% 0.18/0.44 thf(a_type,type,
% 0.18/0.44 a: $tType ).
% 0.18/0.44
% 0.18/0.44 thf(cBOOL_PROP_50_pme,conjecture,
% 0.18/0.44 ! [X: a > $o,Y: a > $o] :
% 0.18/0.44 ( ! [Xx: a] :
% 0.18/0.44 ( ( X @ Xx )
% 0.18/0.44 => ( ( Y @ Xx )
% 0.18/0.44 & ~ ( X @ Xx ) ) )
% 0.18/0.44 => ( X
% 0.18/0.44 = ( ^ [Xx: a] : $false ) ) ) ).
% 0.18/0.44
% 0.18/0.44 %------------------------------------------------------------------------------
% 0.18/0.44 ------------------------
% 1.48/1.22 ---- Embedded in THF ---
% 1.48/1.22 %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.48/1.22 %%% Generated on Tue Feb 24 11:59:39 EST 2026
% 1.48/1.22 %%% using '$$dhol' embedding, version 1.3.0.
% 1.48/1.22 %%% Logic specification used:
% 1.48/1.22 %%% thf(spec, logic, $$dhol).
% 1.48/1.22
% 1.48/1.22 % SZS output start ListOfTHF for /export/starexec/sandbox/tmp/tmp.QxbZGpNSpN/DTF2DTF31613.p
% See solution above
% 1.48/1.22 ------------------------
% 1.48/1.23 ---- Cleaned THF ---
% 1.48/1.23 thf(a_type,type,
% 1.48/1.23 a: $tType ).
% 1.48/1.23
% 1.48/1.23 thf(cBOOL_PROP_50_pme,conjecture,
% 1.48/1.23 ! [X: a > $o,Y: a > $o] :
% 1.48/1.23 ( ! [Xx: a] :
% 1.48/1.23 ( ( X @ Xx )
% 1.48/1.23 => ( ( Y @ Xx )
% 1.48/1.23 & ~ ( X @ Xx ) ) )
% 1.48/1.23 => ( X
% 1.48/1.23 = ( ^ [Xx: a] : $false ) ) ) ).
% 1.48/1.23 ------------------------
% 1.48/1.25 % (31905)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_31613 for (2999ds/2Mi)
% 1.48/1.25 % (31903)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_31613 for (2999ds/27Mi)
% 1.48/1.25 % (31903)Refutation not found, incomplete strategy
% 1.48/1.25 % (31903)------------------------------
% 1.48/1.25 % (31903)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.48/1.25 % (31903)Termination reason: Refutation not found, incomplete strategy
% 1.48/1.25
% 1.48/1.25
% 1.48/1.25 % (31903)Memory used [KB]: 5500
% 1.48/1.25 % (31903)Time elapsed: 0.002 s
% 1.48/1.25 % (31903)Instructions burned: 1 (million)
% 1.48/1.25 % (31903)------------------------------
% 1.48/1.25 % (31903)------------------------------
% 1.48/1.25 % (31905)Instruction limit reached!
% 1.48/1.25 % (31905)------------------------------
% 1.48/1.25 % (31905)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.48/1.25 % (31905)Termination reason: Unknown
% 1.48/1.25 % (31905)Termination phase: Saturation
% 1.48/1.25
% 1.48/1.25 % (31905)Memory used [KB]: 5500
% 1.48/1.25 % (31905)Time elapsed: 0.003 s
% 1.48/1.25 % (31905)Instructions burned: 3 (million)
% 1.48/1.25 % (31905)------------------------------
% 1.48/1.25 % (31905)------------------------------
% 1.48/1.26 % (31902)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_31613 for (2999ds/4Mi)
% 1.48/1.26 % (31901)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on DTF2THF_31613 for (2999ds/183Mi)
% 1.48/1.26 % (31904)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on DTF2THF_31613 for (2999ds/2Mi)
% 1.48/1.26 % (31906)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_31613 for (2999ds/275Mi)
% 1.48/1.26 % (31907)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on DTF2THF_31613 for (2999ds/18Mi)
% 1.48/1.26 % (31901)Refutation not found, incomplete strategy
% 1.48/1.26 % (31901)------------------------------
% 1.48/1.26 % (31901)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.48/1.26 % (31901)Termination reason: Refutation not found, incomplete strategy
% 1.48/1.26
% 1.48/1.26
% 1.48/1.26 % (31901)Memory used [KB]: 5500
% 1.48/1.26 % (31901)Time elapsed: 0.003 s
% 1.48/1.26 % (31901)Instructions burned: 1 (million)
% 1.48/1.26 % (31901)------------------------------
% 1.48/1.26 % (31901)------------------------------
% 1.48/1.26 % (31904)Refutation not found, incomplete strategy
% 1.48/1.26 % (31904)------------------------------
% 1.48/1.26 % (31904)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.48/1.26 % (31904)Termination reason: Refutation not found, incomplete strategy
% 1.48/1.26
% 1.48/1.26
% 1.48/1.26 % (31904)Memory used [KB]: 5500
% 1.48/1.26 % (31904)Time elapsed: 0.003 s
% 1.48/1.26 % (31904)Instructions burned: 1 (million)
% 1.48/1.26 % (31904)------------------------------
% 1.48/1.26 % (31904)------------------------------
% 1.48/1.26 % (31902)First to succeed.
% 1.48/1.26 % (31906)Refutation not found, incomplete strategy
% 1.48/1.26 % (31906)------------------------------
% 1.48/1.26 % (31906)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.48/1.26 % (31906)Termination reason: Refutation not found, incomplete strategy
% 1.48/1.26
% 1.48/1.26
% 1.48/1.26 % (31906)Memory used [KB]: 5500
% 1.48/1.26 % (31906)Time elapsed: 0.003 s
% 1.48/1.26 % (31906)Instructions burned: 1 (million)
% 1.48/1.26 % (31906)------------------------------
% 1.48/1.26 % (31906)------------------------------
% 1.48/1.26 % (31907)Refutation not found, incomplete strategy
% 1.48/1.26 % (31907)------------------------------
% 1.48/1.26 % (31907)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.48/1.26 % (31907)Termination reason: Refutation not found, incomplete strategy
% 1.48/1.26
% 1.48/1.26
% 1.48/1.26 % (31907)Memory used [KB]: 5500
% 1.48/1.26 % (31907)Time elapsed: 0.003 s
% 1.48/1.26 % (31907)Instructions burned: 1 (million)
% 1.48/1.26 % (31907)------------------------------
% 1.48/1.26 % (31907)------------------------------
% 1.48/1.26 % (31902)Refutation found. Thanks to Tanya!
% 1.48/1.26 % SZS status Theorem for DTF2THF_31613
% 1.48/1.26 % SZS output start Proof for DTF2THF_31613
% 1.48/1.26 thf(type_def_5, type, a: $tType).
% 1.48/1.26 thf(func_def_0, type, a: $tType).
% 1.48/1.26 thf(func_def_5, type, sK0: a > $o).
% 1.48/1.26 thf(func_def_6, type, sK1: a > $o).
% 1.48/1.26 thf(func_def_8, type, sK3: a).
% 1.48/1.26 thf(f22,plain,(
% 1.48/1.26 $false),
% 1.48/1.26 inference(subsumption_resolution,[status(thm)],[f21,f15])).
% 1.48/1.26 thf(f15,plain,(
% 1.48/1.26 ( ! [X2 : a] : (($false = (sK0 @ X2))) )),
% 1.48/1.26 inference(trivial_inequality_removal,[status(thm)],[f14])).
% 1.48/1.26 thf(f14,plain,(
% 1.48/1.26 ( ! [X2 : a] : (($false = (sK0 @ X2)) | ($true != $true)) )),
% 1.48/1.26 inference(fool_paramodulation,[status(thm)],[f13])).
% 1.48/1.26 thf(f13,plain,(
% 1.48/1.26 ( ! [X2 : a] : (((sK0 @ X2) != $true)) )),
% 1.48/1.26 inference(duplicate_literal_removal,[status(thm)],[f10])).
% 1.48/1.26 thf(f10,plain,(
% 1.48/1.26 ( ! [X2 : a] : (((sK0 @ X2) != $true) | ((sK0 @ X2) != $true)) )),
% 1.48/1.26 inference(cnf_transformation,[status(thm)],[f9])).
% 1.48/1.26 thf(f9,plain,(
% 1.48/1.26 ((^[Y0 : a]: ($false)) != sK0) & ! [X2 : a] : ((((sK1 @ X2) = $true) & ((sK0 @ X2) != $true)) | ((sK0 @ X2) != $true))),
% 1.48/1.26 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f7,f8])).
% 1.48/1.26 thf(f8,plain,(
% 1.48/1.26 ? [X0 : a > $o,X1 : a > $o] : (((^[Y0 : a]: ($false)) != X0) & ! [X2 : a] : ((((X1 @ X2) = $true) & ((X0 @ X2) != $true)) | ((X0 @ X2) != $true))) => (((^[Y0 : a]: ($false)) != sK0) & ! [X2 : a] : ((((sK1 @ X2) = $true) & ((sK0 @ X2) != $true)) | ((sK0 @ X2) != $true)))),
% 1.48/1.26 introduced(definition,[],[choice_axiom])).
% 1.48/1.26 thf(f7,plain,(
% 1.48/1.26 ? [X0 : a > $o,X1 : a > $o] : (((^[Y0 : a]: ($false)) != X0) & ! [X2 : a] : ((((X1 @ X2) = $true) & ((X0 @ X2) != $true)) | ((X0 @ X2) != $true)))),
% 1.48/1.26 inference(ennf_transformation,[status(thm)],[f6])).
% 1.48/1.26 thf(f6,plain,(
% 1.48/1.26 ~! [X0 : a > $o,X1 : a > $o] : (! [X2 : a] : (((X0 @ X2) = $true) => (((X1 @ X2) = $true) & ((X0 @ X2) != $true))) => ((^[Y0 : a]: ($false)) = X0))),
% 1.48/1.26 inference(flattening,[status(thm)],[f5])).
% 1.48/1.26 thf(f5,plain,(
% 1.48/1.26 ~! [X0 : a > $o,X1 : a > $o] : (! [X2 : a] : (((X0 @ X2) = $true) => (~((X0 @ X2) = $true) & ((X1 @ X2) = $true))) => ((^[Y0 : a]: ($false)) = X0))),
% 1.48/1.26 inference(fool_elimination,[status(thm)],[f4])).
% 1.48/1.26 thf(f4,plain,(
% 1.48/1.26 ~! [X0 : a > $o,X1 : a > $o] : (! [X2 : a] : ((X0 @ X2) => (~(X0 @ X2) & (X1 @ X2))) => (X0 = (^[X3 : a] : ($false))))),
% 1.48/1.26 inference(rectify,[status(thm)],[f2])).
% 1.48/1.26 thf(f2,negated_conjecture,(
% 1.48/1.26 ~! [X0 : a > $o,X1 : a > $o] : (! [X2 : a] : ((X0 @ X2) => (~(X0 @ X2) & (X1 @ X2))) => (X0 = (^[X2 : a] : ($false))))),
% 1.48/1.26 inference(negated_conjecture,[status(cth)],[f1])).
% 1.48/1.26 thf(f1,conjecture,(
% 1.48/1.26 ! [X0 : a > $o,X1 : a > $o] : (! [X2 : a] : ((X0 @ X2) => (~(X0 @ X2) & (X1 @ X2))) => (X0 = (^[X2 : a] : ($false))))),
% 1.48/1.26 file('/export/starexec/sandbox/tmp/tmp.QxbZGpNSpN/DTF2THF_31613.p',cBOOL_PROP_50_pme)).
% 1.48/1.26 thf(f21,plain,(
% 1.48/1.26 ($false != (sK0 @ sK3))),
% 1.48/1.26 inference(beta_eta_normalization,[status(thm)],[f20])).
% 1.48/1.26 thf(f20,plain,(
% 1.48/1.26 (((^[Y0 : a]: ($false)) @ sK3) != (sK0 @ sK3))),
% 1.48/1.26 inference(negative_extensionality,[status(thm)],[f12])).
% 1.48/1.26 thf(f12,plain,(
% 1.48/1.26 ((^[Y0 : a]: ($false)) != sK0)),
% 1.48/1.26 inference(cnf_transformation,[status(thm)],[f9])).
% 1.48/1.26 % SZS output end Proof for DTF2THF_31613
% 1.48/1.26 % (31902)------------------------------
% 1.48/1.26 % (31902)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.48/1.26 % (31902)Termination reason: Refutation
% 1.48/1.26
% 1.48/1.26 % (31902)Memory used [KB]: 5500
% 1.48/1.26 % (31902)Time elapsed: 0.004 s
% 1.48/1.26 % (31902)Instructions burned: 1 (million)
% 1.48/1.26 % (31902)------------------------------
% 1.48/1.26 % (31902)------------------------------
% 1.48/1.26 % (31900)Success in time 0.019 s
%------------------------------------------------------------------------------