%------------------------------------------------------------------------------
% File : DT2H2X---1.9.5
% Problem : SEV053^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 : n028.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:40:10 AM UTC 2026
% Result : Theorem 1.30s 1.11s
% Output : Refutation 1.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 2
% Syntax : Number of formulae : 17 ( 4 unt; 0 typ; 0 def)
% Number of atoms : 136 ( 40 equ; 0 cnn)
% Maximal formula atoms : 5 ( 8 avg)
% Number of connectives : 258 ( 28 ~; 14 |; 16 &; 191 @)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 6 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 46 ( 0 ^; 42 !; 4 ?; 46 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
b: $tType ).
thf(type_def_7,type,
a: $tType ).
thf(func_def_0,type,
b: $tType ).
thf(func_def_1,type,
a: $tType ).
thf(func_def_2,type,
cF: b > b ).
thf(func_def_3,type,
cA: b > a ).
thf(func_def_4,type,
cL: a > a > $o ).
thf(func_def_8,type,
sK0: b ).
thf(f20,plain,
$false,
inference(subsumption_resolution,[status(thm)],[f18,f13]) ).
thf(f13,plain,
! [X0: b] :
( ( cL @ ( cA @ X0 ) @ ( cA @ ( cF @ X0 ) ) )
= $true ),
inference(cnf_transformation,[status(thm)],[f10]) ).
thf(f10,plain,
( ! [X0: b] :
( ( cL @ ( cA @ X0 ) @ ( cA @ ( cF @ X0 ) ) )
= $true )
& ! [X1: a,X2: a,X3: a] :
( ( ( cL @ X2 @ X1 )
!= $true )
| ( ( cL @ X3 @ X1 )
= $true )
| ( ( cL @ X3 @ X2 )
!= $true ) )
& ( ( cL @ ( cA @ sK0 ) @ ( cA @ ( cF @ ( cF @ sK0 ) ) ) )
!= $true ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f8,f9]) ).
thf(f9,plain,
( ? [X4: b] :
( ( cL @ ( cA @ X4 ) @ ( cA @ ( cF @ ( cF @ X4 ) ) ) )
!= $true )
=> ( ( cL @ ( cA @ sK0 ) @ ( cA @ ( cF @ ( cF @ sK0 ) ) ) )
!= $true ) ),
introduced(definition,[],[choice_axiom]) ).
thf(f8,plain,
( ! [X0: b] :
( ( cL @ ( cA @ X0 ) @ ( cA @ ( cF @ X0 ) ) )
= $true )
& ! [X1: a,X2: a,X3: a] :
( ( ( cL @ X2 @ X1 )
!= $true )
| ( ( cL @ X3 @ X1 )
= $true )
| ( ( cL @ X3 @ X2 )
!= $true ) )
& ? [X4: b] :
( ( cL @ ( cA @ X4 ) @ ( cA @ ( cF @ ( cF @ X4 ) ) ) )
!= $true ) ),
inference(rectify,[status(thm)],[f7]) ).
thf(f7,plain,
( ! [X3: b] :
( ( cL @ ( cA @ X3 ) @ ( cA @ ( cF @ X3 ) ) )
= $true )
& ! [X1: a,X0: a,X2: a] :
( ( ( cL @ X0 @ X1 )
!= $true )
| ( ( cL @ X2 @ X1 )
= $true )
| ( $true
!= ( cL @ X2 @ X0 ) ) )
& ? [X4: b] :
( ( cL @ ( cA @ X4 ) @ ( cA @ ( cF @ ( cF @ X4 ) ) ) )
!= $true ) ),
inference(flattening,[status(thm)],[f6]) ).
thf(f6,plain,
( ? [X4: b] :
( ( cL @ ( cA @ X4 ) @ ( cA @ ( cF @ ( cF @ X4 ) ) ) )
!= $true )
& ! [X2: a,X1: a,X0: a] :
( ( ( cL @ X2 @ X1 )
= $true )
| ( ( cL @ X0 @ X1 )
!= $true )
| ( $true
!= ( cL @ X2 @ X0 ) ) )
& ! [X3: b] :
( ( cL @ ( cA @ X3 ) @ ( cA @ ( cF @ X3 ) ) )
= $true ) ),
inference(ennf_transformation,[status(thm)],[f5]) ).
thf(f5,plain,
~ ( ( ! [X2: a,X1: a,X0: a] :
( ( ( ( cL @ X0 @ X1 )
= $true )
& ( $true
= ( cL @ X2 @ X0 ) ) )
=> ( ( cL @ X2 @ X1 )
= $true ) )
& ! [X3: b] :
( ( cL @ ( cA @ X3 ) @ ( cA @ ( cF @ X3 ) ) )
= $true ) )
=> ! [X4: b] :
( ( cL @ ( cA @ X4 ) @ ( cA @ ( cF @ ( cF @ X4 ) ) ) )
= $true ) ),
inference(fool_elimination,[status(thm)],[f4]) ).
thf(f4,plain,
~ ( ( ! [X0: a,X1: a,X2: a] :
( ( ( cL @ X2 @ X0 )
& ( cL @ X0 @ X1 ) )
=> ( cL @ X2 @ X1 ) )
& ! [X3: b] : ( cL @ ( cA @ X3 ) @ ( cA @ ( cF @ X3 ) ) ) )
=> ! [X4: b] : ( cL @ ( cA @ X4 ) @ ( cA @ ( cF @ ( cF @ X4 ) ) ) ) ),
inference(rectify,[status(thm)],[f2]) ).
thf(f2,negated_conjecture,
~ ( ( ! [X1: a,X2: a,X0: a] :
( ( ( cL @ X0 @ X1 )
& ( cL @ X1 @ X2 ) )
=> ( cL @ X0 @ X2 ) )
& ! [X3: b] : ( cL @ ( cA @ X3 ) @ ( cA @ ( cF @ X3 ) ) ) )
=> ! [X4: b] : ( cL @ ( cA @ X4 ) @ ( cA @ ( cF @ ( cF @ X4 ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f1,conjecture,
( ( ! [X1: a,X2: a,X0: a] :
( ( ( cL @ X0 @ X1 )
& ( cL @ X1 @ X2 ) )
=> ( cL @ X0 @ X2 ) )
& ! [X3: b] : ( cL @ ( cA @ X3 ) @ ( cA @ ( cF @ X3 ) ) ) )
=> ! [X4: b] : ( cL @ ( cA @ X4 ) @ ( cA @ ( cF @ ( cF @ X4 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.nhcbB2O3n3/DTF2THF_16253.p',cTHM89B_pme) ).
thf(f18,plain,
( ( cL @ ( cA @ sK0 ) @ ( cA @ ( cF @ sK0 ) ) )
!= $true ),
inference(trivial_inequality_removal,[status(thm)],[f16]) ).
thf(f16,plain,
( ( ( cL @ ( cA @ sK0 ) @ ( cA @ ( cF @ sK0 ) ) )
!= $true )
| ( $true != $true ) ),
inference(superposition,[status(thm)],[f15,f13]) ).
thf(f15,plain,
! [X0: a] :
( ( ( cL @ X0 @ ( cA @ ( cF @ ( cF @ sK0 ) ) ) )
!= $true )
| ( ( cL @ ( cA @ sK0 ) @ X0 )
!= $true ) ),
inference(trivial_inequality_removal,[status(thm)],[f14]) ).
thf(f14,plain,
! [X0: a] :
( ( $true != $true )
| ( ( cL @ ( cA @ sK0 ) @ X0 )
!= $true )
| ( ( cL @ X0 @ ( cA @ ( cF @ ( cF @ sK0 ) ) ) )
!= $true ) ),
inference(superposition,[status(thm)],[f11,f12]) ).
thf(f12,plain,
! [X2: a,X3: a,X1: a] :
( ( ( cL @ X3 @ X1 )
= $true )
| ( ( cL @ X3 @ X2 )
!= $true )
| ( ( cL @ X2 @ X1 )
!= $true ) ),
inference(cnf_transformation,[status(thm)],[f10]) ).
thf(f11,plain,
( ( cL @ ( cA @ sK0 ) @ ( cA @ ( cF @ ( cF @ sK0 ) ) ) )
!= $true ),
inference(cnf_transformation,[status(thm)],[f10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SEV053^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.12/0.32 % Computer : n028.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 300
% 0.12/0.32 % DateTime : Tue Feb 24 12:39:26 EST 2026
% 0.12/0.32 % CPUTime :
% 0.12/0.32 Running /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.15/0.43 ---- Original DTF file ---
% 0.15/0.43 thf(spec,logic,$$dhol).
% 0.15/0.43 %------------------------------------------------------------------------------
% 0.15/0.43 % File : SEV053^5 : TPTP v9.2.1. Released v4.0.0.
% 0.15/0.43 % Domain : Set Theory (Relations)
% 0.15/0.43 % Problem : TPS problem THM89B
% 0.15/0.43 % Version : Especial.
% 0.15/0.43 % English :
% 0.15/0.43
% 0.15/0.43 % Refs : [Bro09] Brown (2009), Email to Geoff Sutcliffe
% 0.15/0.43 % Source : [Bro09]
% 0.15/0.43 % Names : tps_0258 [Bro09]
% 0.15/0.43 % : THM89B [TPS]
% 0.15/0.43
% 0.15/0.43 % Status : Theorem
% 0.15/0.43 % Rating : 0.00 v6.2.0, 0.17 v6.0.0, 0.00 v4.0.1, 0.33 v4.0.0
% 0.15/0.43 % Syntax : Number of formulae : 6 ( 0 unt; 5 typ; 0 def)
% 0.15/0.43 % Number of atoms : 5 ( 0 equ; 0 cnn)
% 0.15/0.43 % Maximal formula atoms : 5 ( 5 avg)
% 0.15/0.43 % Number of connectives : 21 ( 0 ~; 0 |; 2 &; 17 @)
% 0.15/0.43 % ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% 0.15/0.43 % Maximal formula depth : 10 ( 10 avg)
% 0.15/0.43 % Number of types : 3 ( 2 usr)
% 0.15/0.43 % Number of type conns : 4 ( 4 >; 0 *; 0 +; 0 <<)
% 0.15/0.43 % Number of symbols : 3 ( 3 usr; 0 con; 1-2 aty)
% 0.15/0.43 % Number of variables : 5 ( 0 ^; 5 !; 0 ?; 5 :)
% 0.15/0.43 % SPC : TH0_THM_NEQ_NAR
% 0.15/0.43
% 0.15/0.43 % Comments : This problem is from the TPS library. Copyright (c) 2009 The TPS
% 0.15/0.43 % project in the Department of Mathematical Sciences at Carnegie
% 0.15/0.43 % Mellon University. Distributed under the Creative Commons copyleft
% 0.15/0.43 % license: http://creativecommons.org/licenses/by-sa/3.0/
% 0.15/0.43 % : Polymorphic definitions expanded.
% 0.15/0.43 %------------------------------------------------------------------------------
% 0.15/0.43 thf(b_type,type,
% 0.15/0.43 b: $tType ).
% 0.15/0.43
% 0.15/0.43 thf(a_type,type,
% 0.15/0.43 a: $tType ).
% 0.15/0.43
% 0.15/0.43 thf(cF,type,
% 0.15/0.43 cF: b > b ).
% 0.15/0.43
% 0.15/0.43 thf(cA,type,
% 0.15/0.43 cA: b > a ).
% 0.15/0.43
% 0.15/0.43 thf(cL,type,
% 0.15/0.43 cL: a > a > $o ).
% 0.15/0.43
% 0.15/0.43 thf(cTHM89B_pme,conjecture,
% 0.15/0.43 ( ( ! [Xx: a,Xy: a,Xz: a] :
% 0.15/0.43 ( ( ( cL @ Xx @ Xy )
% 0.15/0.43 & ( cL @ Xy @ Xz ) )
% 0.15/0.43 => ( cL @ Xx @ Xz ) )
% 0.15/0.43 & ! [X: b] : ( cL @ ( cA @ X ) @ ( cA @ ( cF @ X ) ) ) )
% 0.15/0.43 => ! [Y: b] : ( cL @ ( cA @ Y ) @ ( cA @ ( cF @ ( cF @ Y ) ) ) ) ) ).
% 0.15/0.43
% 0.15/0.43 %------------------------------------------------------------------------------
% 0.15/0.43 ------------------------
% 1.13/1.09 ---- Embedded in THF ---
% 1.13/1.09 %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.13/1.09 %%% Generated on Tue Feb 24 12:39:27 EST 2026
% 1.13/1.09 %%% using '$$dhol' embedding, version 1.3.0.
% 1.13/1.09 %%% Logic specification used:
% 1.13/1.09 %%% thf(spec, logic, $$dhol).
% 1.13/1.09
% 1.13/1.09 % SZS output start ListOfTHF for /export/starexec/sandbox/tmp/tmp.nhcbB2O3n3/DTF2DTF16253.p
% See solution above
% 1.13/1.09 ------------------------
% 1.13/1.10 ---- Cleaned THF ---
% 1.13/1.10 thf(b_type,type,
% 1.13/1.10 b: $tType ).
% 1.13/1.10
% 1.13/1.10 thf(a_type,type,
% 1.13/1.10 a: $tType ).
% 1.13/1.10
% 1.13/1.10 thf(cF,type,
% 1.13/1.10 cF: b > b ).
% 1.13/1.10
% 1.13/1.10 thf(cA,type,
% 1.13/1.10 cA: b > a ).
% 1.13/1.10
% 1.13/1.10 thf(cL,type,
% 1.13/1.10 cL: a > a > $o ).
% 1.13/1.10
% 1.13/1.10 thf(cTHM89B_pme,conjecture,
% 1.13/1.10 ( ( ! [Xx: a,Xy: a,Xz: a] :
% 1.13/1.10 ( ( ( cL @ Xx @ Xy )
% 1.13/1.10 & ( cL @ Xy @ Xz ) )
% 1.13/1.10 => ( cL @ Xx @ Xz ) )
% 1.13/1.10 & ! [X: b] : ( cL @ ( cA @ X ) @ ( cA @ ( cF @ X ) ) ) )
% 1.13/1.10 => ! [Y: b] : ( cL @ ( cA @ Y ) @ ( cA @ ( cF @ ( cF @ Y ) ) ) ) ) ).
% 1.13/1.10 ------------------------
% 1.13/1.11 % (16350)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on DTF2THF_16253 for (2999ds/183Mi)
% 1.30/1.11 % (16350)First to succeed.
% 1.30/1.11 % (16350)Refutation found. Thanks to Tanya!
% 1.30/1.11 % SZS status Theorem for DTF2THF_16253
% 1.30/1.11 % SZS output start Proof for DTF2THF_16253
% 1.30/1.11 thf(type_def_5, type, b: $tType).
% 1.30/1.11 thf(type_def_7, type, a: $tType).
% 1.30/1.11 thf(func_def_0, type, b: $tType).
% 1.30/1.11 thf(func_def_1, type, a: $tType).
% 1.30/1.11 thf(func_def_2, type, cF: b > b).
% 1.30/1.11 thf(func_def_3, type, cA: b > a).
% 1.30/1.11 thf(func_def_4, type, cL: a > a > $o).
% 1.30/1.11 thf(func_def_8, type, sK0: b).
% 1.30/1.11 thf(f20,plain,(
% 1.30/1.11 $false),
% 1.30/1.11 inference(subsumption_resolution,[status(thm)],[f18,f13])).
% 1.30/1.11 thf(f13,plain,(
% 1.30/1.11 ( ! [X0 : b] : (((cL @ (cA @ X0) @ (cA @ (cF @ X0))) = $true)) )),
% 1.30/1.11 inference(cnf_transformation,[status(thm)],[f10])).
% 1.30/1.11 thf(f10,plain,(
% 1.30/1.11 ! [X0 : b] : ((cL @ (cA @ X0) @ (cA @ (cF @ X0))) = $true) & ! [X1 : a,X2 : a,X3 : a] : (((cL @ X2 @ X1) != $true) | ((cL @ X3 @ X1) = $true) | ((cL @ X3 @ X2) != $true)) & ((cL @ (cA @ sK0) @ (cA @ (cF @ (cF @ sK0)))) != $true)),
% 1.30/1.11 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f8,f9])).
% 1.30/1.11 thf(f9,plain,(
% 1.30/1.11 ? [X4 : b] : ((cL @ (cA @ X4) @ (cA @ (cF @ (cF @ X4)))) != $true) => ((cL @ (cA @ sK0) @ (cA @ (cF @ (cF @ sK0)))) != $true)),
% 1.30/1.11 introduced(definition,[],[choice_axiom])).
% 1.30/1.11 thf(f8,plain,(
% 1.30/1.11 ! [X0 : b] : ((cL @ (cA @ X0) @ (cA @ (cF @ X0))) = $true) & ! [X1 : a,X2 : a,X3 : a] : (((cL @ X2 @ X1) != $true) | ((cL @ X3 @ X1) = $true) | ((cL @ X3 @ X2) != $true)) & ? [X4 : b] : ((cL @ (cA @ X4) @ (cA @ (cF @ (cF @ X4)))) != $true)),
% 1.30/1.11 inference(rectify,[status(thm)],[f7])).
% 1.30/1.11 thf(f7,plain,(
% 1.30/1.11 ! [X3 : b] : ((cL @ (cA @ X3) @ (cA @ (cF @ X3))) = $true) & ! [X1 : a,X0 : a,X2 : a] : (((cL @ X0 @ X1) != $true) | ((cL @ X2 @ X1) = $true) | ($true != (cL @ X2 @ X0))) & ? [X4 : b] : ((cL @ (cA @ X4) @ (cA @ (cF @ (cF @ X4)))) != $true)),
% 1.30/1.11 inference(flattening,[status(thm)],[f6])).
% 1.30/1.11 thf(f6,plain,(
% 1.30/1.11 ? [X4 : b] : ((cL @ (cA @ X4) @ (cA @ (cF @ (cF @ X4)))) != $true) & (! [X2 : a,X1 : a,X0 : a] : (((cL @ X2 @ X1) = $true) | (((cL @ X0 @ X1) != $true) | ($true != (cL @ X2 @ X0)))) & ! [X3 : b] : ((cL @ (cA @ X3) @ (cA @ (cF @ X3))) = $true))),
% 1.30/1.11 inference(ennf_transformation,[status(thm)],[f5])).
% 1.30/1.11 thf(f5,plain,(
% 1.30/1.11 ~((! [X2 : a,X1 : a,X0 : a] : ((((cL @ X0 @ X1) = $true) & ($true = (cL @ X2 @ X0))) => ((cL @ X2 @ X1) = $true)) & ! [X3 : b] : ((cL @ (cA @ X3) @ (cA @ (cF @ X3))) = $true)) => ! [X4 : b] : ((cL @ (cA @ X4) @ (cA @ (cF @ (cF @ X4)))) = $true))),
% 1.30/1.11 inference(fool_elimination,[status(thm)],[f4])).
% 1.30/1.11 thf(f4,plain,(
% 1.30/1.11 ~((! [X0 : a,X1 : a,X2 : a] : (((cL @ X2 @ X0) & (cL @ X0 @ X1)) => (cL @ X2 @ X1)) & ! [X3 : b] : (cL @ (cA @ X3) @ (cA @ (cF @ X3)))) => ! [X4 : b] : (cL @ (cA @ X4) @ (cA @ (cF @ (cF @ X4)))))),
% 1.30/1.11 inference(rectify,[status(thm)],[f2])).
% 1.30/1.11 thf(f2,negated_conjecture,(
% 1.30/1.11 ~((! [X1 : a,X2 : a,X0 : a] : (((cL @ X0 @ X1) & (cL @ X1 @ X2)) => (cL @ X0 @ X2)) & ! [X3 : b] : (cL @ (cA @ X3) @ (cA @ (cF @ X3)))) => ! [X4 : b] : (cL @ (cA @ X4) @ (cA @ (cF @ (cF @ X4)))))),
% 1.30/1.11 inference(negated_conjecture,[status(cth)],[f1])).
% 1.30/1.11 thf(f1,conjecture,(
% 1.30/1.11 (! [X1 : a,X2 : a,X0 : a] : (((cL @ X0 @ X1) & (cL @ X1 @ X2)) => (cL @ X0 @ X2)) & ! [X3 : b] : (cL @ (cA @ X3) @ (cA @ (cF @ X3)))) => ! [X4 : b] : (cL @ (cA @ X4) @ (cA @ (cF @ (cF @ X4))))),
% 1.30/1.11 file('/export/starexec/sandbox/tmp/tmp.nhcbB2O3n3/DTF2THF_16253.p',cTHM89B_pme)).
% 1.30/1.11 thf(f18,plain,(
% 1.30/1.11 ((cL @ (cA @ sK0) @ (cA @ (cF @ sK0))) != $true)),
% 1.30/1.11 inference(trivial_inequality_removal,[status(thm)],[f16])).
% 1.30/1.11 thf(f16,plain,(
% 1.30/1.11 ((cL @ (cA @ sK0) @ (cA @ (cF @ sK0))) != $true) | ($true != $true)),
% 1.30/1.11 inference(superposition,[status(thm)],[f15,f13])).
% 1.30/1.11 thf(f15,plain,(
% 1.30/1.11 ( ! [X0 : a] : (((cL @ X0 @ (cA @ (cF @ (cF @ sK0)))) != $true) | ((cL @ (cA @ sK0) @ X0) != $true)) )),
% 1.30/1.11 inference(trivial_inequality_removal,[status(thm)],[f14])).
% 1.30/1.11 thf(f14,plain,(
% 1.30/1.11 ( ! [X0 : a] : (($true != $true) | ((cL @ (cA @ sK0) @ X0) != $true) | ((cL @ X0 @ (cA @ (cF @ (cF @ sK0)))) != $true)) )),
% 1.30/1.11 inference(superposition,[status(thm)],[f11,f12])).
% 1.30/1.11 thf(f12,plain,(
% 1.30/1.11 ( ! [X2 : a,X3 : a,X1 : a] : (((cL @ X3 @ X1) = $true) | ((cL @ X3 @ X2) != $true) | ((cL @ X2 @ X1) != $true)) )),
% 1.30/1.11 inference(cnf_transformation,[status(thm)],[f10])).
% 1.30/1.11 thf(f11,plain,(
% 1.30/1.11 ((cL @ (cA @ sK0) @ (cA @ (cF @ (cF @ sK0)))) != $true)),
% 1.30/1.11 inference(cnf_transformation,[status(thm)],[f10])).
% 1.30/1.11 % SZS output end Proof for DTF2THF_16253
% 1.30/1.11 % (16350)------------------------------
% 1.30/1.11 % (16350)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.30/1.11 % (16350)Termination reason: Refutation
% 1.30/1.11
% 1.30/1.11 % (16350)Memory used [KB]: 5500
% 1.30/1.11 % (16350)Time elapsed: 0.003 s
% 1.30/1.11 % (16350)Instructions burned: 3 (million)
% 1.30/1.11 % (16350)------------------------------
% 1.30/1.11 % (16350)------------------------------
% 1.30/1.11 % (16349)Success in time 0.013 s
%------------------------------------------------------------------------------