%------------------------------------------------------------------------------
% File : DT2H2X---1.9.5
% Problem : SYO025^1 : TPTP v9.2.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% Computer : n017.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:53:10 AM UTC 2026
% Result : Theorem 1.64s 1.44s
% Output : Refutation 1.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 1
% Syntax : Number of formulae : 33 ( 15 unt; 0 typ; 0 def)
% Number of atoms : 183 ( 57 equ; 8 cnn)
% Maximal formula atoms : 4 ( 5 avg)
% Number of connectives : 125 ( 65 ~; 43 |; 13 &; 4 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 3 usr; 5 con; 0-2 aty)
% Number of variables : 16 ( 16 ^; 0 !; 0 ?; 16 :)
% Comments :
%------------------------------------------------------------------------------
thf(func_def_10,type,
ph1:
!>[X0: $tType] : X0 ).
thf(f39,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[f38]) ).
thf(f38,plain,
$false = $true,
inference(superposition,[status(thm)],[f36,f34]) ).
thf(f34,plain,
sK3 = $true,
inference(duplicate_literal_removal,[status(thm)],[f33]) ).
thf(f33,plain,
( ( sK3 = $true )
| ( sK3 = $true ) ),
inference(not_proxy_clausification,[status(thm)],[f30]) ).
thf(f30,plain,
( ( ( ~ sK3 ) = $false )
| ( sK3 = $true ) ),
inference(binary_proxy_clausification,[status(thm)],[f29]) ).
thf(f29,plain,
( ( ( ~ sK2
| ~ sK3 )
= $false )
| ( sK3 = $true ) ),
inference(not_proxy_clausification,[status(thm)],[f21]) ).
thf(f21,plain,
( ( sK3 = $true )
| ( ( ~ ( ~ sK2
| ~ sK3 ) )
= $true ) ),
inference(binary_proxy_clausification,[status(thm)],[f12]) ).
thf(f12,plain,
( ( ( sK2
& sK3 )
= $true )
| ( ( ~ ( ~ sK2
| ~ sK3 ) )
= $true ) ),
inference(binary_proxy_clausification,[status(thm)],[f11]) ).
thf(f11,plain,
( ( sK2
& sK3 )
!= ( ~ ( ~ sK2
| ~ sK3 ) ) ),
inference(beta_eta_normalization,[status(thm)],[f10]) ).
thf(f10,plain,
( ( ^ [Y0: $o] :
~ ( ~ sK2
| ~ Y0 )
@ sK3 )
!= ( sK2
& sK3 ) ),
inference(negative_extensionality,[status(thm)],[f9]) ).
thf(f9,plain,
( ( ^ [Y0: $o] :
~ ( ~ sK2
| ~ Y0 ) )
!= ( (&) @ sK2 ) ),
inference(beta_eta_normalization,[status(thm)],[f8]) ).
thf(f8,plain,
( ( (&) @ sK2 )
!= ( ^ [Y0: $o,Y1: $o] :
~ ( ~ Y0
| ~ Y1 )
@ sK2 ) ),
inference(negative_extensionality,[status(thm)],[f7]) ).
thf(f7,plain,
( (&)
!= ( ^ [Y0: $o,Y1: $o] :
~ ( ~ Y0
| ~ Y1 ) ) ),
inference(cnf_transformation,[status(thm)],[f6]) ).
thf(f6,plain,
( (&)
!= ( ^ [Y0: $o,Y1: $o] :
~ ( ~ Y0
| ~ Y1 ) ) ),
inference(flattening,[status(thm)],[f5]) ).
thf(f5,plain,
( (&)
!= ( ^ [Y0: $o,Y1: $o] :
~ ( ~ Y0
| ~ Y1 ) ) ),
inference(fool_elimination,[status(thm)],[f4]) ).
thf(f4,plain,
( ( ^ [X0: $o,X1: $o] :
~ ( ~ X1
| ~ X0 ) )
!= (&) ),
inference(rectify,[status(thm)],[f2]) ).
thf(f2,negated_conjecture,
( ( ^ [X0: $o,X1: $o] :
~ ( ~ X1
| ~ X0 ) )
!= (&) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f1,conjecture,
( ( ^ [X0: $o,X1: $o] :
~ ( ~ X1
| ~ X0 ) )
= (&) ),
file('/export/starexec/sandbox/tmp/tmp.cRb9e5qvmw/DTF2THF_5238.p',conj) ).
thf(f36,plain,
sK3 = $false,
inference(trivial_inequality_removal,[status(thm)],[f35]) ).
thf(f35,plain,
( ( sK3 = $false )
| ( $false = $true ) ),
inference(forward_demodulation,[status(thm)],[f20,f27]) ).
thf(f27,plain,
sK2 = $true,
inference(duplicate_literal_removal,[status(thm)],[f26]) ).
thf(f26,plain,
( ( sK2 = $true )
| ( sK2 = $true ) ),
inference(not_proxy_clausification,[status(thm)],[f25]) ).
thf(f25,plain,
( ( $false = ( ~ sK2 ) )
| ( sK2 = $true ) ),
inference(binary_proxy_clausification,[status(thm)],[f23]) ).
thf(f23,plain,
( ( ( ~ sK2
| ~ sK3 )
= $false )
| ( sK2 = $true ) ),
inference(not_proxy_clausification,[status(thm)],[f22]) ).
thf(f22,plain,
( ( sK2 = $true )
| ( ( ~ ( ~ sK2
| ~ sK3 ) )
= $true ) ),
inference(binary_proxy_clausification,[status(thm)],[f12]) ).
thf(f20,plain,
( ( $false = sK2 )
| ( sK3 = $false ) ),
inference(duplicate_literal_removal,[status(thm)],[f19]) ).
thf(f19,plain,
( ( $false = sK2 )
| ( $false = sK2 )
| ( sK3 = $false ) ),
inference(not_proxy_clausification,[status(thm)],[f18]) ).
thf(f18,plain,
( ( $false = sK2 )
| ( sK3 = $false )
| ( ( ~ sK2 ) = $true ) ),
inference(duplicate_literal_removal,[status(thm)],[f17]) ).
thf(f17,plain,
( ( sK3 = $false )
| ( sK3 = $false )
| ( ( ~ sK2 ) = $true )
| ( $false = sK2 ) ),
inference(not_proxy_clausification,[status(thm)],[f16]) ).
thf(f16,plain,
( ( ( ~ sK3 ) = $true )
| ( sK3 = $false )
| ( $false = sK2 )
| ( ( ~ sK2 ) = $true ) ),
inference(binary_proxy_clausification,[status(thm)],[f15]) ).
thf(f15,plain,
( ( ( ~ sK2
| ~ sK3 )
= $true )
| ( sK3 = $false )
| ( $false = sK2 ) ),
inference(binary_proxy_clausification,[status(thm)],[f14]) ).
thf(f14,plain,
( ( ( sK2
& sK3 )
= $false )
| ( ( ~ sK2
| ~ sK3 )
= $true ) ),
inference(not_proxy_clausification,[status(thm)],[f13]) ).
thf(f13,plain,
( ( ( ~ ( ~ sK2
| ~ sK3 ) )
= $false )
| ( ( sK2
& sK3 )
= $false ) ),
inference(binary_proxy_clausification,[status(thm)],[f11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYO025^1 : TPTP v9.2.1. Released v3.7.0.
% 0.12/0.13 % Command : /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.15/0.33 % Computer : n017.cluster.edu
% 0.15/0.33 % Model : x86_64 x86_64
% 0.15/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.33 % Memory : 8042.1875MB
% 0.15/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.33 % CPULimit : 300
% 0.15/0.33 % WCLimit : 300
% 0.15/0.33 % DateTime : Tue Feb 24 14:20:11 EST 2026
% 0.15/0.33 % CPUTime :
% 0.15/0.33 Running /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.18/0.48 ---- Original DTF file ---
% 0.18/0.48 thf(spec,logic,$$dhol).
% 0.18/0.48 %------------------------------------------------------------------------------
% 0.18/0.48 % File : SYO025^1 : TPTP v9.2.1. Released v3.7.0.
% 0.18/0.48 % Domain : Syntactic
% 0.18/0.48 % Problem : De Morgan by connectives and equality
% 0.18/0.48 % Version : Especial.
% 0.18/0.48 % English :
% 0.18/0.48
% 0.18/0.48 % Refs : [BB05] Benzmueller & Brown (2005), A Structured Set of Higher
% 0.18/0.48 % : [Ben09] Benzmueller (2009), Email to Geoff Sutcliffe
% 0.18/0.48 % Source : [Ben09]
% 0.18/0.48 % Names : Example 20d [BB05]
% 0.18/0.48
% 0.18/0.48 % Status : Theorem
% 0.18/0.48 % : Without Boolean extensionality : CounterSatisfiable
% 0.18/0.48 % : Without functional extensionality : CounterSatisfiable
% 0.18/0.48 % Rating : 0.22 v9.1.0, 0.25 v9.0.0, 0.30 v8.2.0, 0.46 v8.1.0, 0.27 v7.5.0, 0.29 v7.4.0, 0.33 v7.2.0, 0.12 v7.0.0, 0.14 v6.4.0, 0.17 v6.3.0, 0.20 v6.2.0, 0.29 v6.1.0, 0.14 v5.5.0, 0.17 v5.4.0, 0.20 v4.1.0, 0.00 v4.0.1, 0.33 v3.7.0
% 0.18/0.48 % Syntax : Number of formulae : 1 ( 1 unt; 0 typ; 0 def)
% 0.18/0.48 % Number of atoms : 2 ( 1 equ; 1 cnn)
% 0.18/0.48 % Maximal formula atoms : 1 ( 2 avg)
% 0.18/0.48 % Number of connectives : 5 ( 3 ~; 1 |; 1 &; 0 @)
% 0.18/0.48 % ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% 0.18/0.48 % Maximal formula depth : 1 ( 1 avg)
% 0.18/0.48 % Number of types : 1 ( 0 usr)
% 0.18/0.48 % Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% 0.18/0.48 % Number of symbols : 2 ( 0 usr; 1 con; 0-2 aty)
% 0.18/0.48 % Number of variables : 2 ( 2 ^; 0 !; 0 ?; 2 :)
% 0.18/0.48 % SPC : TH0_THM_EQU_NAR
% 0.18/0.48
% 0.18/0.48 % Comments :
% 0.18/0.48 %------------------------------------------------------------------------------
% 0.18/0.48 thf(conj,conjecture,
% 0.18/0.48 ( (&)
% 0.18/0.48 = ( ^ [X: $o,Y: $o] :
% 0.18/0.48 ~ ( ~ X
% 0.18/0.48 | ~ Y ) ) ) ).
% 0.18/0.48
% 0.18/0.48 %------------------------------------------------------------------------------
% 0.18/0.48 ------------------------
% 1.64/1.41 ---- Embedded in THF ---
% 1.64/1.41 %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.64/1.41 %%% Generated on Tue Feb 24 14:20:12 EST 2026
% 1.64/1.41 %%% using '$$dhol' embedding, version 1.3.0.
% 1.64/1.41 %%% Logic specification used:
% 1.64/1.41 %%% thf(spec, logic, $$dhol).
% 1.64/1.41
% 1.64/1.41 % SZS output start ListOfTHF for /export/starexec/sandbox/tmp/tmp.cRb9e5qvmw/DTF2DTF5238.p
% See solution above
% 1.64/1.41 ------------------------
% 1.64/1.42 ---- Cleaned THF ---
% 1.64/1.42 thf(conj,conjecture,
% 1.64/1.42 ( (&)
% 1.64/1.42 = ( ^ [X: $o,Y: $o] :
% 1.64/1.42 ~ ( ~ X
% 1.64/1.42 | ~ Y ) ) ) ).
% 1.64/1.42 ------------------------
% 1.64/1.44 % (5336)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_5238 for (3000ds/4Mi)
% 1.64/1.44 % (5337)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_5238 for (3000ds/27Mi)
% 1.64/1.44 % (5340)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_5238 for (3000ds/275Mi)
% 1.64/1.44 % (5335)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on DTF2THF_5238 for (3000ds/183Mi)
% 1.64/1.44 % (5338)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on DTF2THF_5238 for (3000ds/2Mi)
% 1.64/1.44 % (5339)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_5238 for (3000ds/2Mi)
% 1.64/1.44 % (5341)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on DTF2THF_5238 for (3000ds/18Mi)
% 1.64/1.44 % (5338)Instruction limit reached!
% 1.64/1.44 % (5338)------------------------------
% 1.64/1.44 % (5338)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.64/1.44 % (5340)First to succeed.
% 1.64/1.44 % (5338)Termination reason: Unknown
% 1.64/1.44 % (5338)Termination phase: Saturation
% 1.64/1.44
% 1.64/1.44 % (5339)Refutation not found, incomplete strategy
% 1.64/1.44 % (5339)------------------------------
% 1.64/1.44 % (5339)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.64/1.44 % (5339)Termination reason: Refutation not found, incomplete strategy
% 1.64/1.44
% 1.64/1.44
% 1.64/1.44 % (5339)Memory used [KB]: 5500
% 1.64/1.44 % (5339)Time elapsed: 0.004 s
% 1.64/1.44 % (5339)Instructions burned: 1 (million)
% 1.64/1.44 % (5339)------------------------------
% 1.64/1.44 % (5339)------------------------------
% 1.64/1.44 % (5338)Memory used [KB]: 5500
% 1.64/1.44 % (5338)Time elapsed: 0.004 s
% 1.64/1.44 % (5338)Instructions burned: 2 (million)
% 1.64/1.44 % (5338)------------------------------
% 1.64/1.44 % (5338)------------------------------
% 1.64/1.44 % (5341)Also succeeded, but the first one will report.
% 1.64/1.44 % (5340)Refutation found. Thanks to Tanya!
% 1.64/1.44 % SZS status Theorem for DTF2THF_5238
% 1.64/1.44 % SZS output start Proof for DTF2THF_5238
% 1.64/1.44 thf(func_def_10, type, ph1: !>[X0: $tType]:(X0)).
% 1.64/1.44 thf(f39,plain,(
% 1.64/1.44 $false),
% 1.64/1.44 inference(trivial_inequality_removal,[status(thm)],[f38])).
% 1.64/1.44 thf(f38,plain,(
% 1.64/1.44 ($false = $true)),
% 1.64/1.44 inference(superposition,[status(thm)],[f36,f34])).
% 1.64/1.44 thf(f34,plain,(
% 1.64/1.44 (sK3 = $true)),
% 1.64/1.44 inference(duplicate_literal_removal,[status(thm)],[f33])).
% 1.64/1.44 thf(f33,plain,(
% 1.64/1.44 (sK3 = $true) | (sK3 = $true)),
% 1.64/1.44 inference(not_proxy_clausification,[status(thm)],[f30])).
% 1.64/1.44 thf(f30,plain,(
% 1.64/1.44 ((~ sK3) = $false) | (sK3 = $true)),
% 1.64/1.44 inference(binary_proxy_clausification,[status(thm)],[f29])).
% 1.64/1.44 thf(f29,plain,(
% 1.64/1.44 (((~ sK2) | (~ sK3)) = $false) | (sK3 = $true)),
% 1.64/1.44 inference(not_proxy_clausification,[status(thm)],[f21])).
% 1.64/1.44 thf(f21,plain,(
% 1.64/1.44 (sK3 = $true) | ((~ ((~ sK2) | (~ sK3))) = $true)),
% 1.64/1.44 inference(binary_proxy_clausification,[status(thm)],[f12])).
% 1.64/1.44 thf(f12,plain,(
% 1.64/1.44 ((sK2 & sK3) = $true) | ((~ ((~ sK2) | (~ sK3))) = $true)),
% 1.64/1.44 inference(binary_proxy_clausification,[status(thm)],[f11])).
% 1.64/1.44 thf(f11,plain,(
% 1.64/1.44 ((sK2 & sK3) != (~ ((~ sK2) | (~ sK3))))),
% 1.64/1.44 inference(beta_eta_normalization,[status(thm)],[f10])).
% 1.64/1.44 thf(f10,plain,(
% 1.64/1.44 (((^[Y0 : $o]: (~ ((~ sK2) | (~ Y0)))) @ sK3) != (sK2 & sK3))),
% 1.64/1.44 inference(negative_extensionality,[status(thm)],[f9])).
% 1.64/1.44 thf(f9,plain,(
% 1.64/1.44 ((^[Y0 : $o]: (~ ((~ sK2) | (~ Y0)))) != (& @ sK2))),
% 1.64/1.44 inference(beta_eta_normalization,[status(thm)],[f8])).
% 1.64/1.44 thf(f8,plain,(
% 1.64/1.44 ((& @ sK2) != ((^[Y0 : $o]: ((^[Y1 : $o]: (~ ((~ Y0) | (~ Y1)))))) @ sK2))),
% 1.64/1.44 inference(negative_extensionality,[status(thm)],[f7])).
% 1.64/1.44 thf(f7,plain,(
% 1.64/1.44 (& != (^[Y0 : $o]: ((^[Y1 : $o]: (~ ((~ Y0) | (~ Y1)))))))),
% 1.64/1.44 inference(cnf_transformation,[status(thm)],[f6])).
% 1.64/1.44 thf(f6,plain,(
% 1.64/1.44 (& != (^[Y0 : $o]: ((^[Y1 : $o]: (~ ((~ Y0) | (~ Y1)))))))),
% 1.64/1.44 inference(flattening,[status(thm)],[f5])).
% 1.64/1.44 thf(f5,plain,(
% 1.64/1.44 ~(& = (^[Y0 : $o]: ((^[Y1 : $o]: (~ ((~ Y0) | (~ Y1)))))))),
% 1.64/1.44 inference(fool_elimination,[status(thm)],[f4])).
% 1.64/1.44 thf(f4,plain,(
% 1.64/1.44 ~((^[X0 : $o, X1 : $o] : (~(~X1 | ~X0))) = &)),
% 1.64/1.44 inference(rectify,[status(thm)],[f2])).
% 1.64/1.44 thf(f2,negated_conjecture,(
% 1.64/1.44 ~((^[X0 : $o, X1 : $o] : (~(~X1 | ~X0))) = &)),
% 1.64/1.44 inference(negated_conjecture,[status(cth)],[f1])).
% 1.64/1.44 thf(f1,conjecture,(
% 1.64/1.44 ((^[X0 : $o, X1 : $o] : (~(~X1 | ~X0))) = &)),
% 1.64/1.44 file('/export/starexec/sandbox/tmp/tmp.cRb9e5qvmw/DTF2THF_5238.p',conj)).
% 1.64/1.44 thf(f36,plain,(
% 1.64/1.44 (sK3 = $false)),
% 1.64/1.44 inference(trivial_inequality_removal,[status(thm)],[f35])).
% 1.64/1.44 thf(f35,plain,(
% 1.64/1.44 (sK3 = $false) | ($false = $true)),
% 1.64/1.44 inference(forward_demodulation,[status(thm)],[f20,f27])).
% 1.64/1.44 thf(f27,plain,(
% 1.64/1.44 (sK2 = $true)),
% 1.64/1.44 inference(duplicate_literal_removal,[status(thm)],[f26])).
% 1.64/1.44 thf(f26,plain,(
% 1.64/1.44 (sK2 = $true) | (sK2 = $true)),
% 1.64/1.44 inference(not_proxy_clausification,[status(thm)],[f25])).
% 1.64/1.44 thf(f25,plain,(
% 1.64/1.44 ($false = (~ sK2)) | (sK2 = $true)),
% 1.64/1.44 inference(binary_proxy_clausification,[status(thm)],[f23])).
% 1.64/1.44 thf(f23,plain,(
% 1.64/1.44 (((~ sK2) | (~ sK3)) = $false) | (sK2 = $true)),
% 1.64/1.44 inference(not_proxy_clausification,[status(thm)],[f22])).
% 1.64/1.44 thf(f22,plain,(
% 1.64/1.44 (sK2 = $true) | ((~ ((~ sK2) | (~ sK3))) = $true)),
% 1.64/1.44 inference(binary_proxy_clausification,[status(thm)],[f12])).
% 1.64/1.44 thf(f20,plain,(
% 1.64/1.44 ($false = sK2) | (sK3 = $false)),
% 1.64/1.44 inference(duplicate_literal_removal,[status(thm)],[f19])).
% 1.64/1.44 thf(f19,plain,(
% 1.64/1.44 ($false = sK2) | ($false = sK2) | (sK3 = $false)),
% 1.64/1.44 inference(not_proxy_clausification,[status(thm)],[f18])).
% 1.64/1.44 thf(f18,plain,(
% 1.64/1.44 ($false = sK2) | (sK3 = $false) | ((~ sK2) = $true)),
% 1.64/1.44 inference(duplicate_literal_removal,[status(thm)],[f17])).
% 1.64/1.44 thf(f17,plain,(
% 1.64/1.44 (sK3 = $false) | (sK3 = $false) | ((~ sK2) = $true) | ($false = sK2)),
% 1.64/1.44 inference(not_proxy_clausification,[status(thm)],[f16])).
% 1.64/1.44 thf(f16,plain,(
% 1.64/1.44 ((~ sK3) = $true) | (sK3 = $false) | ($false = sK2) | ((~ sK2) = $true)),
% 1.64/1.44 inference(binary_proxy_clausification,[status(thm)],[f15])).
% 1.64/1.44 thf(f15,plain,(
% 1.64/1.44 (((~ sK2) | (~ sK3)) = $true) | (sK3 = $false) | ($false = sK2)),
% 1.64/1.44 inference(binary_proxy_clausification,[status(thm)],[f14])).
% 1.64/1.44 thf(f14,plain,(
% 1.64/1.44 ((sK2 & sK3) = $false) | (((~ sK2) | (~ sK3)) = $true)),
% 1.64/1.44 inference(not_proxy_clausification,[status(thm)],[f13])).
% 1.64/1.44 thf(f13,plain,(
% 1.64/1.44 ((~ ((~ sK2) | (~ sK3))) = $false) | ((sK2 & sK3) = $false)),
% 1.64/1.44 inference(binary_proxy_clausification,[status(thm)],[f11])).
% 1.64/1.44 % SZS output end Proof for DTF2THF_5238
% 1.64/1.44 % (5340)------------------------------
% 1.64/1.44 % (5340)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.64/1.44 % (5340)Termination reason: Refutation
% 1.64/1.44
% 1.64/1.44 % (5340)Memory used [KB]: 5500
% 1.64/1.44 % (5340)Time elapsed: 0.003 s
% 1.64/1.44 % (5340)Instructions burned: 1 (million)
% 1.64/1.44 % (5340)------------------------------
% 1.64/1.44 % (5340)------------------------------
% 1.64/1.44 % (5334)Success in time 0.018 s
%------------------------------------------------------------------------------