%------------------------------------------------------------------------------
% File : DT2H2X---1.9.5
% Problem : SYO358^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 : n005.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:54:02 AM UTC 2026
% Result : Theorem 1.49s 1.27s
% Output : Refutation 1.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 4
% Syntax : Number of formulae : 24 ( 3 unt; 0 typ; 2 def)
% Number of atoms : 218 ( 73 equ; 0 cnn)
% Maximal formula atoms : 12 ( 9 avg)
% Number of connectives : 182 ( 47 ~; 36 |; 32 &; 49 @)
% ( 2 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 19 ( 19 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 8 usr; 8 con; 0-2 aty)
% Number of variables : 19 ( 0 ^; 15 !; 4 ?; 19 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
atype: $tType ).
thf(func_def_0,type,
atype: $tType ).
thf(func_def_2,type,
v: atype ).
thf(func_def_4,type,
u: atype ).
thf(func_def_8,type,
sK0: atype > $o ).
thf(func_def_11,type,
ph2:
!>[X0: $tType] : X0 ).
thf(f41,plain,
$false,
inference(avatar_sat_refutation,[status(thm)],[f25,f26,f40]) ).
thf(f40,plain,
spl1_2,
inference(avatar_contradiction_clause,[status(thm)],[f39]) ).
thf(f39,plain,
( $false
| spl1_2 ),
inference(subsumption_resolution,[status(thm)],[f38,f13]) ).
thf(f13,plain,
( ( sK0 @ u )
= $true ),
inference(cnf_transformation,[status(thm)],[f11]) ).
thf(f11,plain,
( ( ( ( b != $true )
& ( b = $true ) )
| ( ( sK0 @ v )
!= $true ) )
& ( ( a = $true )
| ( a != $true ) )
& ( ( sK0 @ u )
= $true )
& ! [X1: atype > $o] :
( ( ( X1 @ u )
!= $true )
| ( ( X1 @ v )
= $true ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f9,f10]) ).
thf(f10,plain,
( ? [X0: atype > $o] :
( ( ( ( b != $true )
& ( b = $true ) )
| ( ( X0 @ v )
!= $true ) )
& ( ( a = $true )
| ( a != $true ) )
& ( ( X0 @ u )
= $true ) )
=> ( ( ( ( b != $true )
& ( b = $true ) )
| ( ( sK0 @ v )
!= $true ) )
& ( ( a = $true )
| ( a != $true ) )
& ( ( sK0 @ u )
= $true ) ) ),
introduced(definition,[],[choice_axiom]) ).
thf(f9,plain,
( ? [X0: atype > $o] :
( ( ( ( b != $true )
& ( b = $true ) )
| ( ( X0 @ v )
!= $true ) )
& ( ( a = $true )
| ( a != $true ) )
& ( ( X0 @ u )
= $true ) )
& ! [X1: atype > $o] :
( ( ( X1 @ u )
!= $true )
| ( ( X1 @ v )
= $true ) ) ),
inference(rectify,[status(thm)],[f8]) ).
thf(f8,plain,
( ? [X1: atype > $o] :
( ( ( ( b != $true )
& ( b = $true ) )
| ( ( X1 @ v )
!= $true ) )
& ( ( a = $true )
| ( a != $true ) )
& ( ( X1 @ u )
= $true ) )
& ! [X0: atype > $o] :
( ( ( X0 @ u )
!= $true )
| ( ( X0 @ v )
= $true ) ) ),
inference(flattening,[status(thm)],[f7]) ).
thf(f7,plain,
( ? [X1: atype > $o] :
( ( ( ( b != $true )
& ( b = $true ) )
| ( ( X1 @ v )
!= $true ) )
& ( ( X1 @ u )
= $true )
& ( ( a = $true )
| ( a != $true ) ) )
& ! [X0: atype > $o] :
( ( ( X0 @ u )
!= $true )
| ( ( X0 @ v )
= $true ) ) ),
inference(ennf_transformation,[status(thm)],[f6]) ).
thf(f6,plain,
~ ( ! [X0: atype > $o] :
( ( ( X0 @ u )
= $true )
=> ( ( X0 @ v )
= $true ) )
=> ! [X1: atype > $o] :
( ( ( ( X1 @ u )
= $true )
& ( ( a = $true )
| ( a != $true ) ) )
=> ( ( ( b = $true )
| ( b != $true ) )
& ( ( X1 @ v )
= $true ) ) ) ),
inference(flattening,[status(thm)],[f5]) ).
thf(f5,plain,
~ ( ! [X0: atype > $o] :
( ( ( X0 @ u )
= $true )
=> ( ( X0 @ v )
= $true ) )
=> ! [X1: atype > $o] :
( ( ( ( X1 @ u )
= $true )
& ( ( a = $true )
| ( a != $true ) ) )
=> ( ( ( b = $true )
| ( b != $true ) )
& ( ( X1 @ v )
= $true ) ) ) ),
inference(fool_elimination,[status(thm)],[f4]) ).
thf(f4,plain,
~ ( ! [X0: atype > $o] :
( ( X0 @ u )
=> ( X0 @ v ) )
=> ! [X1: atype > $o] :
( ( ( X1 @ u )
& ( a
| ~ a ) )
=> ( ( b
| ~ b )
& ( X1 @ v ) ) ) ),
inference(rectify,[status(thm)],[f2]) ).
thf(f2,negated_conjecture,
~ ( ! [X0: atype > $o] :
( ( X0 @ u )
=> ( X0 @ v ) )
=> ! [X1: atype > $o] :
( ( ( X1 @ u )
& ( a
| ~ a ) )
=> ( ( b
| ~ b )
& ( X1 @ v ) ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f1,conjecture,
( ! [X0: atype > $o] :
( ( X0 @ u )
=> ( X0 @ v ) )
=> ! [X1: atype > $o] :
( ( ( X1 @ u )
& ( a
| ~ a ) )
=> ( ( b
| ~ b )
& ( X1 @ v ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.TGg90qq1ER/DTF2THF_32210.p',cE2LEIBEQ1_pme) ).
thf(f38,plain,
( ( ( sK0 @ u )
!= $true )
| spl1_2 ),
inference(trivial_inequality_removal,[status(thm)],[f32]) ).
thf(f32,plain,
( ( ( sK0 @ u )
!= $true )
| ( $true != $true )
| spl1_2 ),
inference(superposition,[status(thm)],[f24,f12]) ).
thf(f12,plain,
! [X1: atype > $o] :
( ( ( X1 @ v )
= $true )
| ( ( X1 @ u )
!= $true ) ),
inference(cnf_transformation,[status(thm)],[f11]) ).
thf(f24,plain,
( ( ( sK0 @ v )
!= $true )
| spl1_2 ),
inference(avatar_component_clause,[status(thm)],[f22]) ).
thf(f22,definition,
( spl1_2
<=> ( ( sK0 @ v )
= $true ) ),
introduced(definition,[new_symbols(naming,[spl1_2])],[avatar_definition]) ).
thf(f26,plain,
( spl1_1
| ~ spl1_2 ),
inference(avatar_split_clause,[status(thm)],[f15,f22,f18]) ).
thf(f18,definition,
( spl1_1
<=> ( b = $true ) ),
introduced(definition,[new_symbols(naming,[spl1_1])],[avatar_definition]) ).
thf(f15,plain,
( ( ( sK0 @ v )
!= $true )
| ( b = $true ) ),
inference(cnf_transformation,[status(thm)],[f11]) ).
thf(f25,plain,
( ~ spl1_1
| ~ spl1_2 ),
inference(avatar_split_clause,[status(thm)],[f16,f22,f18]) ).
thf(f16,plain,
( ( b != $true )
| ( ( sK0 @ v )
!= $true ) ),
inference(cnf_transformation,[status(thm)],[f11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYO358^5 : TPTP v9.2.1. Released v4.0.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 : n005.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:28:29 EST 2026
% 0.15/0.34 % CPUTime :
% 0.15/0.34 Running /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.18/0.45 ---- Original DTF file ---
% 0.18/0.45 thf(spec,logic,$$dhol).
% 0.18/0.45 %------------------------------------------------------------------------------
% 0.18/0.45 % File : SYO358^5 : TPTP v9.2.1. Released v4.0.0.
% 0.18/0.45 % Domain : Syntactic
% 0.18/0.45 % Problem : TPS problem E2LEIBEQ1
% 0.18/0.45 % Version : Especial.
% 0.18/0.45 % English : Example from [Ben99] about alternative defns of equality.
% 0.18/0.45
% 0.18/0.45 % Refs : [Ben99] Benzmueller (1999), Equality and Extensionality in Hig
% 0.18/0.45 % : [Bro09] Brown (2009), Email to Geoff Sutcliffe
% 0.18/0.45 % Source : [Bro09]
% 0.18/0.45 % Names : tps_0222 [Bro09]
% 0.18/0.45 % : E2LEIBEQ1 [TPS]
% 0.18/0.45
% 0.18/0.45 % Status : Theorem
% 0.18/0.45 % Rating : 0.08 v9.1.0, 0.00 v9.0.0, 0.08 v8.2.0, 0.09 v8.1.0, 0.00 v7.5.0, 0.08 v7.4.0, 0.00 v6.2.0, 0.17 v6.1.0, 0.00 v4.0.0
% 0.18/0.45 % Syntax : Number of formulae : 6 ( 0 unt; 5 typ; 0 def)
% 0.18/0.45 % Number of atoms : 4 ( 0 equ; 0 cnn)
% 0.18/0.45 % Maximal formula atoms : 4 ( 4 avg)
% 0.18/0.45 % Number of connectives : 13 ( 2 ~; 2 |; 2 &; 4 @)
% 0.18/0.45 % ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% 0.18/0.45 % Maximal formula depth : 7 ( 7 avg)
% 0.18/0.45 % Number of types : 2 ( 1 usr)
% 0.18/0.45 % Number of type conns : 2 ( 2 >; 0 *; 0 +; 0 <<)
% 0.18/0.45 % Number of symbols : 4 ( 4 usr; 4 con; 0-0 aty)
% 0.18/0.45 % Number of variables : 2 ( 0 ^; 2 !; 0 ?; 2 :)
% 0.18/0.45 % SPC : TH0_THM_NEQ_NAR
% 0.18/0.45
% 0.18/0.45 % Comments : This problem is from the TPS library. Copyright (c) 2009 The TPS
% 0.18/0.45 % project in the Department of Mathematical Sciences at Carnegie
% 0.18/0.45 % Mellon University. Distributed under the Creative Commons copyleft
% 0.18/0.45 % license: http://creativecommons.org/licenses/by-sa/3.0/
% 0.18/0.45 % : Polymorphic definitions expanded.
% 0.18/0.45 %------------------------------------------------------------------------------
% 0.18/0.45 thf(a_type,type,
% 0.18/0.45 atype: $tType ).
% 0.18/0.45
% 0.18/0.45 thf(a,type,
% 0.18/0.45 a: $o ).
% 0.18/0.45
% 0.18/0.45 thf(v,type,
% 0.18/0.45 v: atype ).
% 0.18/0.45
% 0.18/0.45 thf(b,type,
% 0.18/0.45 b: $o ).
% 0.18/0.45
% 0.18/0.45 thf(u,type,
% 0.18/0.45 u: atype ).
% 0.18/0.45
% 0.18/0.45 thf(cE2LEIBEQ1_pme,conjecture,
% 0.18/0.45 ( ! [Xq: atype > $o] :
% 0.18/0.45 ( ( Xq @ u )
% 0.18/0.45 => ( Xq @ v ) )
% 0.18/0.45 => ! [P: atype > $o] :
% 0.18/0.45 ( ( ( a
% 0.18/0.45 | ~ a )
% 0.18/0.45 & ( P @ u ) )
% 0.18/0.45 => ( ( b
% 0.18/0.45 | ~ b )
% 0.18/0.45 & ( P @ v ) ) ) ) ).
% 0.18/0.45
% 0.18/0.45 %------------------------------------------------------------------------------
% 0.18/0.45 ------------------------
% 1.49/1.24 ---- Embedded in THF ---
% 1.49/1.25 %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.49/1.25 %%% Generated on Tue Feb 24 14:28:30 EST 2026
% 1.49/1.25 %%% using '$$dhol' embedding, version 1.3.0.
% 1.49/1.25 %%% Logic specification used:
% 1.49/1.25 %%% thf(spec, logic, $$dhol).
% 1.49/1.25
% 1.49/1.25 % SZS output start ListOfTHF for /export/starexec/sandbox/tmp/tmp.TGg90qq1ER/DTF2DTF32210.p
% See solution above
% 1.49/1.25 ------------------------
% 1.49/1.25 ---- Cleaned THF ---
% 1.49/1.25 thf(a_type,type,
% 1.49/1.25 atype: $tType ).
% 1.49/1.25
% 1.49/1.25 thf(a,type,
% 1.49/1.25 a: $o ).
% 1.49/1.25
% 1.49/1.25 thf(v,type,
% 1.49/1.25 v: atype ).
% 1.49/1.25
% 1.49/1.25 thf(b,type,
% 1.49/1.25 b: $o ).
% 1.49/1.25
% 1.49/1.25 thf(u,type,
% 1.49/1.25 u: atype ).
% 1.49/1.25
% 1.49/1.25 thf(cE2LEIBEQ1_pme,conjecture,
% 1.49/1.25 ( ! [Xq: atype > $o] :
% 1.49/1.25 ( ( Xq @ u )
% 1.49/1.25 => ( Xq @ v ) )
% 1.49/1.25 => ! [P: atype > $o] :
% 1.49/1.25 ( ( ( a
% 1.49/1.25 | ~ a )
% 1.49/1.25 & ( P @ u ) )
% 1.49/1.25 => ( ( b
% 1.49/1.25 | ~ b )
% 1.49/1.25 & ( P @ v ) ) ) ) ).
% 1.49/1.25 ------------------------
% 1.49/1.27 % (32399)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on DTF2THF_32210 for (2999ds/183Mi)
% 1.49/1.27 % (32404)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_32210 for (2999ds/275Mi)
% 1.49/1.27 % (32400)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_32210 for (2999ds/4Mi)
% 1.49/1.27 % (32404)First to succeed.
% 1.49/1.27 % (32399)Also succeeded, but the first one will report.
% 1.49/1.27 % (32400)Also succeeded, but the first one will report.
% 1.49/1.27 % (32404)Refutation found. Thanks to Tanya!
% 1.49/1.27 % SZS status Theorem for DTF2THF_32210
% 1.49/1.27 % SZS output start Proof for DTF2THF_32210
% 1.49/1.27 thf(type_def_5, type, atype: $tType).
% 1.49/1.27 thf(func_def_0, type, atype: $tType).
% 1.49/1.27 thf(func_def_2, type, v: atype).
% 1.49/1.27 thf(func_def_4, type, u: atype).
% 1.49/1.27 thf(func_def_8, type, sK0: atype > $o).
% 1.49/1.27 thf(func_def_11, type, ph2: !>[X0: $tType]:(X0)).
% 1.49/1.27 thf(f41,plain,(
% 1.49/1.27 $false),
% 1.49/1.27 inference(avatar_sat_refutation,[status(thm)],[f25,f26,f40])).
% 1.49/1.27 thf(f40,plain,(
% 1.49/1.27 spl1_2),
% 1.49/1.27 inference(avatar_contradiction_clause,[status(thm)],[f39])).
% 1.49/1.27 thf(f39,plain,(
% 1.49/1.27 $false | spl1_2),
% 1.49/1.27 inference(subsumption_resolution,[status(thm)],[f38,f13])).
% 1.49/1.27 thf(f13,plain,(
% 1.49/1.27 ((sK0 @ u) = $true)),
% 1.49/1.27 inference(cnf_transformation,[status(thm)],[f11])).
% 1.49/1.27 thf(f11,plain,(
% 1.49/1.27 ((((b != $true) & (b = $true)) | ((sK0 @ v) != $true)) & ((a = $true) | (a != $true)) & ((sK0 @ u) = $true)) & ! [X1 : atype > $o] : (((X1 @ u) != $true) | ((X1 @ v) = $true))),
% 1.49/1.27 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f9,f10])).
% 1.49/1.27 thf(f10,plain,(
% 1.49/1.27 ? [X0 : atype > $o] : ((((b != $true) & (b = $true)) | ((X0 @ v) != $true)) & ((a = $true) | (a != $true)) & ((X0 @ u) = $true)) => ((((b != $true) & (b = $true)) | ((sK0 @ v) != $true)) & ((a = $true) | (a != $true)) & ((sK0 @ u) = $true))),
% 1.49/1.27 introduced(definition,[],[choice_axiom])).
% 1.49/1.27 thf(f9,plain,(
% 1.49/1.27 ? [X0 : atype > $o] : ((((b != $true) & (b = $true)) | ((X0 @ v) != $true)) & ((a = $true) | (a != $true)) & ((X0 @ u) = $true)) & ! [X1 : atype > $o] : (((X1 @ u) != $true) | ((X1 @ v) = $true))),
% 1.49/1.27 inference(rectify,[status(thm)],[f8])).
% 1.49/1.27 thf(f8,plain,(
% 1.49/1.27 ? [X1 : atype > $o] : ((((b != $true) & (b = $true)) | ((X1 @ v) != $true)) & ((a = $true) | (a != $true)) & ((X1 @ u) = $true)) & ! [X0 : atype > $o] : (((X0 @ u) != $true) | ((X0 @ v) = $true))),
% 1.49/1.27 inference(flattening,[status(thm)],[f7])).
% 1.49/1.27 thf(f7,plain,(
% 1.49/1.27 ? [X1 : atype > $o] : ((((b != $true) & (b = $true)) | ((X1 @ v) != $true)) & (((X1 @ u) = $true) & ((a = $true) | (a != $true)))) & ! [X0 : atype > $o] : (((X0 @ u) != $true) | ((X0 @ v) = $true))),
% 1.49/1.27 inference(ennf_transformation,[status(thm)],[f6])).
% 1.49/1.27 thf(f6,plain,(
% 1.49/1.27 ~(! [X0 : atype > $o] : (((X0 @ u) = $true) => ((X0 @ v) = $true)) => ! [X1 : atype > $o] : ((((X1 @ u) = $true) & ((a = $true) | (a != $true))) => (((b = $true) | (b != $true)) & ((X1 @ v) = $true))))),
% 1.49/1.27 inference(flattening,[status(thm)],[f5])).
% 1.49/1.27 thf(f5,plain,(
% 1.49/1.27 ~(! [X0 : atype > $o] : (((X0 @ u) = $true) => ((X0 @ v) = $true)) => ! [X1 : atype > $o] : ((((X1 @ u) = $true) & ((a = $true) | ~(a = $true))) => (((b = $true) | ~(b = $true)) & ((X1 @ v) = $true))))),
% 1.49/1.27 inference(fool_elimination,[status(thm)],[f4])).
% 1.49/1.27 thf(f4,plain,(
% 1.49/1.27 ~(! [X0 : atype > $o] : ((X0 @ u) => (X0 @ v)) => ! [X1 : atype > $o] : (((X1 @ u) & (a | ~a)) => ((b | ~b) & (X1 @ v))))),
% 1.49/1.27 inference(rectify,[status(thm)],[f2])).
% 1.49/1.27 thf(f2,negated_conjecture,(
% 1.49/1.27 ~(! [X0 : atype > $o] : ((X0 @ u) => (X0 @ v)) => ! [X1 : atype > $o] : (((X1 @ u) & (a | ~a)) => ((b | ~b) & (X1 @ v))))),
% 1.49/1.27 inference(negated_conjecture,[status(cth)],[f1])).
% 1.49/1.27 thf(f1,conjecture,(
% 1.49/1.27 ! [X0 : atype > $o] : ((X0 @ u) => (X0 @ v)) => ! [X1 : atype > $o] : (((X1 @ u) & (a | ~a)) => ((b | ~b) & (X1 @ v)))),
% 1.49/1.27 file('/export/starexec/sandbox/tmp/tmp.TGg90qq1ER/DTF2THF_32210.p',cE2LEIBEQ1_pme)).
% 1.49/1.27 thf(f38,plain,(
% 1.49/1.27 ((sK0 @ u) != $true) | spl1_2),
% 1.49/1.27 inference(trivial_inequality_removal,[status(thm)],[f32])).
% 1.49/1.27 thf(f32,plain,(
% 1.49/1.27 ((sK0 @ u) != $true) | ($true != $true) | spl1_2),
% 1.49/1.27 inference(superposition,[status(thm)],[f24,f12])).
% 1.49/1.27 thf(f12,plain,(
% 1.49/1.27 ( ! [X1 : atype > $o] : (((X1 @ v) = $true) | ((X1 @ u) != $true)) )),
% 1.49/1.27 inference(cnf_transformation,[status(thm)],[f11])).
% 1.49/1.27 thf(f24,plain,(
% 1.49/1.27 ((sK0 @ v) != $true) | spl1_2),
% 1.49/1.27 inference(avatar_component_clause,[status(thm)],[f22])).
% 1.49/1.27 thf(f22,definition,(
% 1.49/1.27 spl1_2 <=> ((sK0 @ v) = $true)),
% 1.49/1.27 introduced(definition,[new_symbols(naming,[spl1_2])],[avatar_definition])).
% 1.49/1.27 thf(f26,plain,(
% 1.49/1.27 spl1_1 | ~spl1_2),
% 1.49/1.27 inference(avatar_split_clause,[status(thm)],[f15,f22,f18])).
% 1.49/1.27 thf(f18,definition,(
% 1.49/1.27 spl1_1 <=> (b = $true)),
% 1.49/1.27 introduced(definition,[new_symbols(naming,[spl1_1])],[avatar_definition])).
% 1.49/1.27 thf(f15,plain,(
% 1.49/1.27 ((sK0 @ v) != $true) | (b = $true)),
% 1.49/1.27 inference(cnf_transformation,[status(thm)],[f11])).
% 1.49/1.27 thf(f25,plain,(
% 1.49/1.27 ~spl1_1 | ~spl1_2),
% 1.49/1.27 inference(avatar_split_clause,[status(thm)],[f16,f22,f18])).
% 1.49/1.27 thf(f16,plain,(
% 1.49/1.27 (b != $true) | ((sK0 @ v) != $true)),
% 1.49/1.27 inference(cnf_transformation,[status(thm)],[f11])).
% 1.49/1.27 % SZS output end Proof for DTF2THF_32210
% 1.49/1.27 % (32404)------------------------------
% 1.49/1.27 % (32404)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.49/1.27 % (32404)Termination reason: Refutation
% 1.49/1.27
% 1.49/1.27 % (32404)Memory used [KB]: 5500
% 1.49/1.27 % (32404)Time elapsed: 0.002 s
% 1.49/1.27 % (32404)Instructions burned: 2 (million)
% 1.49/1.27 % (32404)------------------------------
% 1.49/1.27 % (32404)------------------------------
% 1.49/1.27 % (32398)Success in time 0.005 s
%------------------------------------------------------------------------------