%------------------------------------------------------------------------------
% File : DT2H2X---1.9.5
% Problem : SEU714^2 : 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 : n015.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:36:36 AM UTC 2026
% Result : Theorem 1.67s 1.46s
% Output : Refutation 1.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 7
% Syntax : Number of formulae : 45 ( 11 unt; 0 typ; 0 def)
% Number of atoms : 476 ( 134 equ; 0 cnn)
% Maximal formula atoms : 8 ( 10 avg)
% Number of connectives : 519 ( 56 ~; 43 |; 36 &; 355 @)
% ( 4 <=>; 25 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 16 ( 13 usr; 11 con; 0-2 aty)
% Number of variables : 101 ( 0 ^; 74 !; 27 ?; 101 :)
% Comments :
%------------------------------------------------------------------------------
thf(func_def_0,type,
in: $i > $i > $o ).
thf(func_def_1,type,
powerset: $i > $i ).
thf(func_def_4,type,
setminus: $i > $i > $i ).
thf(func_def_12,type,
sK4: $i > $i > $i ).
thf(f57,plain,
$false,
inference(subsumption_resolution,[status(thm)],[f56,f30]) ).
thf(f30,plain,
( $true
!= ( in @ ( setminus @ sK1 @ sK0 ) @ ( powerset @ sK1 ) ) ),
inference(cnf_transformation,[status(thm)],[f18]) ).
thf(f18,plain,
( ( ( in @ sK0 @ ( powerset @ sK1 ) )
= $true )
& ( $true
!= ( in @ ( setminus @ sK1 @ sK0 ) @ ( powerset @ sK1 ) ) )
& ( setminusEL = $true )
& ( powersetI = $true ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f16,f17]) ).
thf(f17,plain,
( ? [X0: $i,X1: $i] :
( ( $true
= ( in @ X0 @ ( powerset @ X1 ) ) )
& ( ( in @ ( setminus @ X1 @ X0 ) @ ( powerset @ X1 ) )
!= $true ) )
=> ( ( ( in @ sK0 @ ( powerset @ sK1 ) )
= $true )
& ( $true
!= ( in @ ( setminus @ sK1 @ sK0 ) @ ( powerset @ sK1 ) ) ) ) ),
introduced(definition,[],[choice_axiom]) ).
thf(f16,plain,
( ? [X0: $i,X1: $i] :
( ( $true
= ( in @ X0 @ ( powerset @ X1 ) ) )
& ( ( in @ ( setminus @ X1 @ X0 ) @ ( powerset @ X1 ) )
!= $true ) )
& ( setminusEL = $true )
& ( powersetI = $true ) ),
inference(rectify,[status(thm)],[f15]) ).
thf(f15,plain,
( ? [X1: $i,X0: $i] :
( ( ( in @ X1 @ ( powerset @ X0 ) )
= $true )
& ( ( in @ ( setminus @ X0 @ X1 ) @ ( powerset @ X0 ) )
!= $true ) )
& ( setminusEL = $true )
& ( powersetI = $true ) ),
inference(flattening,[status(thm)],[f14]) ).
thf(f14,plain,
( ? [X1: $i,X0: $i] :
( ( ( in @ X1 @ ( powerset @ X0 ) )
= $true )
& ( ( in @ ( setminus @ X0 @ X1 ) @ ( powerset @ X0 ) )
!= $true ) )
& ( setminusEL = $true )
& ( powersetI = $true ) ),
inference(ennf_transformation,[status(thm)],[f11]) ).
thf(f11,plain,
~ ( ( powersetI = $true )
=> ( ( setminusEL = $true )
=> ! [X0: $i,X1: $i] :
( ( ( in @ X1 @ ( powerset @ X0 ) )
= $true )
=> ( ( in @ ( setminus @ X0 @ X1 ) @ ( powerset @ X0 ) )
= $true ) ) ) ),
inference(fool_elimination,[status(thm)],[f10]) ).
thf(f10,plain,
~ ( powersetI
=> ( setminusEL
=> ! [X0: $i,X1: $i] :
( ( in @ X1 @ ( powerset @ X0 ) )
=> ( in @ ( setminus @ X0 @ X1 ) @ ( powerset @ X0 ) ) ) ) ),
inference(rectify,[status(thm)],[f4]) ).
thf(f4,negated_conjecture,
~ ( powersetI
=> ( setminusEL
=> ! [X0: $i,X3: $i] :
( ( in @ X3 @ ( powerset @ X0 ) )
=> ( in @ ( setminus @ X0 @ X3 ) @ ( powerset @ X0 ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f3]) ).
thf(f3,conjecture,
( powersetI
=> ( setminusEL
=> ! [X0: $i,X3: $i] :
( ( in @ X3 @ ( powerset @ X0 ) )
=> ( in @ ( setminus @ X0 @ X3 ) @ ( powerset @ X0 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.J9kT0swmdZ/DTF2THF_10275.p',complementT_lem) ).
thf(f56,plain,
( $true
= ( in @ ( setminus @ sK1 @ sK0 ) @ ( powerset @ sK1 ) ) ),
inference(trivial_inequality_removal,[status(thm)],[f55]) ).
thf(f55,plain,
( ( $true
= ( in @ ( setminus @ sK1 @ sK0 ) @ ( powerset @ sK1 ) ) )
| ( $true != $true ) ),
inference(superposition,[status(thm)],[f46,f54]) ).
thf(f54,plain,
( ( in @ ( sK4 @ ( setminus @ sK1 @ sK0 ) @ sK1 ) @ sK1 )
= $true ),
inference(trivial_inequality_removal,[status(thm)],[f53]) ).
thf(f53,plain,
( ( ( in @ ( sK4 @ ( setminus @ sK1 @ sK0 ) @ sK1 ) @ sK1 )
= $true )
| ( $true != $true ) ),
inference(superposition,[status(thm)],[f47,f52]) ).
thf(f52,plain,
( ( in @ ( sK4 @ ( setminus @ sK1 @ sK0 ) @ sK1 ) @ ( setminus @ sK1 @ sK0 ) )
= $true ),
inference(trivial_inequality_removal,[status(thm)],[f49]) ).
thf(f49,plain,
( ( ( in @ ( sK4 @ ( setminus @ sK1 @ sK0 ) @ sK1 ) @ ( setminus @ sK1 @ sK0 ) )
= $true )
| ( $true != $true ) ),
inference(superposition,[status(thm)],[f30,f48]) ).
thf(f48,plain,
! [X3: $i,X4: $i] :
( ( $true
= ( in @ X4 @ ( powerset @ X3 ) ) )
| ( ( in @ ( sK4 @ X4 @ X3 ) @ X4 )
= $true ) ),
inference(trivial_inequality_removal,[status(thm)],[f42]) ).
thf(f42,plain,
! [X3: $i,X4: $i] :
( ( $true
= ( in @ X4 @ ( powerset @ X3 ) ) )
| ( ( in @ ( sK4 @ X4 @ X3 ) @ X4 )
= $true )
| ( $true != $true ) ),
inference(definition_unfolding,[status(thm)],[f32,f28]) ).
thf(f28,plain,
powersetI = $true,
inference(cnf_transformation,[status(thm)],[f18]) ).
thf(f32,plain,
! [X3: $i,X4: $i] :
( ( ( in @ ( sK4 @ X4 @ X3 ) @ X4 )
= $true )
| ( $true
= ( in @ X4 @ ( powerset @ X3 ) ) )
| ( powersetI != $true ) ),
inference(cnf_transformation,[status(thm)],[f23]) ).
thf(f23,plain,
( ( ( powersetI = $true )
| ( ! [X2: $i] :
( ( $true
= ( in @ X2 @ sK2 ) )
| ( ( in @ X2 @ sK3 )
!= $true ) )
& ( ( in @ sK3 @ ( powerset @ sK2 ) )
!= $true ) ) )
& ( ! [X3: $i,X4: $i] :
( ( ( ( in @ ( sK4 @ X4 @ X3 ) @ X3 )
!= $true )
& ( ( in @ ( sK4 @ X4 @ X3 ) @ X4 )
= $true ) )
| ( $true
= ( in @ X4 @ ( powerset @ X3 ) ) ) )
| ( powersetI != $true ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3,sK4])],[f20,f22,f21]) ).
thf(f21,plain,
( ? [X0: $i,X1: $i] :
( ! [X2: $i] :
( ( ( in @ X2 @ X0 )
= $true )
| ( ( in @ X2 @ X1 )
!= $true ) )
& ( ( in @ X1 @ ( powerset @ X0 ) )
!= $true ) )
=> ( ! [X2: $i] :
( ( $true
= ( in @ X2 @ sK2 ) )
| ( ( in @ X2 @ sK3 )
!= $true ) )
& ( ( in @ sK3 @ ( powerset @ sK2 ) )
!= $true ) ) ),
introduced(definition,[],[choice_axiom]) ).
thf(f22,plain,
! [X3: $i,X4: $i] :
( ? [X5: $i] :
( ( ( in @ X5 @ X3 )
!= $true )
& ( ( in @ X5 @ X4 )
= $true ) )
=> ( ( ( in @ ( sK4 @ X4 @ X3 ) @ X3 )
!= $true )
& ( ( in @ ( sK4 @ X4 @ X3 ) @ X4 )
= $true ) ) ),
introduced(definition,[],[choice_axiom]) ).
thf(f20,plain,
( ( ( powersetI = $true )
| ? [X0: $i,X1: $i] :
( ! [X2: $i] :
( ( ( in @ X2 @ X0 )
= $true )
| ( ( in @ X2 @ X1 )
!= $true ) )
& ( ( in @ X1 @ ( powerset @ X0 ) )
!= $true ) ) )
& ( ! [X3: $i,X4: $i] :
( ? [X5: $i] :
( ( ( in @ X5 @ X3 )
!= $true )
& ( ( in @ X5 @ X4 )
= $true ) )
| ( $true
= ( in @ X4 @ ( powerset @ X3 ) ) ) )
| ( powersetI != $true ) ) ),
inference(rectify,[status(thm)],[f19]) ).
thf(f19,plain,
( ( ( powersetI = $true )
| ? [X1: $i,X0: $i] :
( ! [X2: $i] :
( ( ( in @ X2 @ X1 )
= $true )
| ( ( in @ X2 @ X0 )
!= $true ) )
& ( $true
!= ( in @ X0 @ ( powerset @ X1 ) ) ) ) )
& ( ! [X1: $i,X0: $i] :
( ? [X2: $i] :
( ( ( in @ X2 @ X1 )
!= $true )
& ( ( in @ X2 @ X0 )
= $true ) )
| ( $true
= ( in @ X0 @ ( powerset @ X1 ) ) ) )
| ( powersetI != $true ) ) ),
inference(nnf_transformation,[status(thm)],[f13]) ).
thf(f13,plain,
( ( powersetI = $true )
<=> ! [X1: $i,X0: $i] :
( ? [X2: $i] :
( ( ( in @ X2 @ X1 )
!= $true )
& ( ( in @ X2 @ X0 )
= $true ) )
| ( $true
= ( in @ X0 @ ( powerset @ X1 ) ) ) ) ),
inference(ennf_transformation,[status(thm)],[f7]) ).
thf(f7,plain,
( ( powersetI = $true )
<=> ! [X1: $i,X0: $i] :
( ! [X2: $i] :
( ( ( in @ X2 @ X0 )
= $true )
=> ( ( in @ X2 @ X1 )
= $true ) )
=> ( $true
= ( in @ X0 @ ( powerset @ X1 ) ) ) ) ),
inference(fool_elimination,[status(thm)],[f6]) ).
thf(f6,plain,
( powersetI
= ( ! [X0: $i,X1: $i] :
( ! [X2: $i] :
( ( in @ X2 @ X0 )
=> ( in @ X2 @ X1 ) )
=> ( in @ X0 @ ( powerset @ X1 ) ) ) ) ),
inference(rectify,[status(thm)],[f1]) ).
thf(f1,axiom,
( powersetI
= ( ! [X1: $i,X0: $i] :
( ! [X2: $i] :
( ( in @ X2 @ X1 )
=> ( in @ X2 @ X0 ) )
=> ( in @ X1 @ ( powerset @ X0 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.J9kT0swmdZ/DTF2THF_10275.p',powersetI) ).
thf(f47,plain,
! [X3: $i,X4: $i,X5: $i] :
( ( ( in @ X4 @ ( setminus @ X5 @ X3 ) )
!= $true )
| ( $true
= ( in @ X4 @ X5 ) ) ),
inference(trivial_inequality_removal,[status(thm)],[f45]) ).
thf(f45,plain,
! [X3: $i,X4: $i,X5: $i] :
( ( $true != $true )
| ( $true
= ( in @ X4 @ X5 ) )
| ( ( in @ X4 @ ( setminus @ X5 @ X3 ) )
!= $true ) ),
inference(definition_unfolding,[status(thm)],[f36,f29]) ).
thf(f29,plain,
setminusEL = $true,
inference(cnf_transformation,[status(thm)],[f18]) ).
thf(f36,plain,
! [X3: $i,X4: $i,X5: $i] :
( ( ( in @ X4 @ ( setminus @ X5 @ X3 ) )
!= $true )
| ( $true
= ( in @ X4 @ X5 ) )
| ( setminusEL != $true ) ),
inference(cnf_transformation,[status(thm)],[f27]) ).
thf(f27,plain,
( ( ( setminusEL = $true )
| ( ( ( in @ sK6 @ ( setminus @ sK7 @ sK5 ) )
= $true )
& ( ( in @ sK6 @ sK7 )
!= $true ) ) )
& ( ! [X3: $i,X4: $i,X5: $i] :
( ( ( in @ X4 @ ( setminus @ X5 @ X3 ) )
!= $true )
| ( $true
= ( in @ X4 @ X5 ) ) )
| ( setminusEL != $true ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK5,sK6,sK7])],[f25,f26]) ).
thf(f26,plain,
( ? [X0: $i,X1: $i,X2: $i] :
( ( $true
= ( in @ X1 @ ( setminus @ X2 @ X0 ) ) )
& ( ( in @ X1 @ X2 )
!= $true ) )
=> ( ( ( in @ sK6 @ ( setminus @ sK7 @ sK5 ) )
= $true )
& ( ( in @ sK6 @ sK7 )
!= $true ) ) ),
introduced(definition,[],[choice_axiom]) ).
thf(f25,plain,
( ( ( setminusEL = $true )
| ? [X0: $i,X1: $i,X2: $i] :
( ( $true
= ( in @ X1 @ ( setminus @ X2 @ X0 ) ) )
& ( ( in @ X1 @ X2 )
!= $true ) ) )
& ( ! [X3: $i,X4: $i,X5: $i] :
( ( ( in @ X4 @ ( setminus @ X5 @ X3 ) )
!= $true )
| ( $true
= ( in @ X4 @ X5 ) ) )
| ( setminusEL != $true ) ) ),
inference(rectify,[status(thm)],[f24]) ).
thf(f24,plain,
( ( ( setminusEL = $true )
| ? [X2: $i,X0: $i,X1: $i] :
( ( ( in @ X0 @ ( setminus @ X1 @ X2 ) )
= $true )
& ( ( in @ X0 @ X1 )
!= $true ) ) )
& ( ! [X2: $i,X0: $i,X1: $i] :
( ( ( in @ X0 @ ( setminus @ X1 @ X2 ) )
!= $true )
| ( ( in @ X0 @ X1 )
= $true ) )
| ( setminusEL != $true ) ) ),
inference(nnf_transformation,[status(thm)],[f12]) ).
thf(f12,plain,
( ( setminusEL = $true )
<=> ! [X2: $i,X0: $i,X1: $i] :
( ( ( in @ X0 @ ( setminus @ X1 @ X2 ) )
!= $true )
| ( ( in @ X0 @ X1 )
= $true ) ) ),
inference(ennf_transformation,[status(thm)],[f9]) ).
thf(f9,plain,
( ! [X0: $i,X2: $i,X1: $i] :
( ( ( in @ X0 @ ( setminus @ X1 @ X2 ) )
= $true )
=> ( ( in @ X0 @ X1 )
= $true ) )
<=> ( setminusEL = $true ) ),
inference(fool_elimination,[status(thm)],[f8]) ).
thf(f8,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( ( in @ X0 @ ( setminus @ X1 @ X2 ) )
=> ( in @ X0 @ X1 ) )
= setminusEL ),
inference(rectify,[status(thm)],[f2]) ).
thf(f2,axiom,
! [X2: $i,X0: $i,X1: $i] :
( ( ( in @ X2 @ ( setminus @ X0 @ X1 ) )
=> ( in @ X2 @ X0 ) )
= setminusEL ),
file('/export/starexec/sandbox/tmp/tmp.J9kT0swmdZ/DTF2THF_10275.p',setminusEL) ).
thf(f46,plain,
! [X3: $i,X4: $i] :
( ( ( in @ ( sK4 @ X4 @ X3 ) @ X3 )
!= $true )
| ( $true
= ( in @ X4 @ ( powerset @ X3 ) ) ) ),
inference(trivial_inequality_removal,[status(thm)],[f41]) ).
thf(f41,plain,
! [X3: $i,X4: $i] :
( ( $true
= ( in @ X4 @ ( powerset @ X3 ) ) )
| ( ( in @ ( sK4 @ X4 @ X3 ) @ X3 )
!= $true )
| ( $true != $true ) ),
inference(definition_unfolding,[status(thm)],[f33,f28]) ).
thf(f33,plain,
! [X3: $i,X4: $i] :
( ( ( in @ ( sK4 @ X4 @ X3 ) @ X3 )
!= $true )
| ( $true
= ( in @ X4 @ ( powerset @ X3 ) ) )
| ( powersetI != $true ) ),
inference(cnf_transformation,[status(thm)],[f23]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU714^2 : TPTP v9.2.1. Released v3.7.0.
% 0.11/0.13 % Command : /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.15/0.34 % Computer : n015.cluster.edu
% 0.15/0.34 % Model : x86_64 x86_64
% 0.15/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.34 % Memory : 8042.1875MB
% 0.15/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.34 % CPULimit : 300
% 0.15/0.34 % WCLimit : 300
% 0.15/0.34 % DateTime : Tue Feb 24 12:31:31 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.32/0.48 ---- Original DTF file ---
% 0.32/0.49 thf(spec,logic,$$dhol).
% 0.32/0.49 %------------------------------------------------------------------------------
% 0.32/0.49 % File : SEU714^2 : TPTP v9.2.1. Released v3.7.0.
% 0.32/0.49 % Domain : Set Theory
% 0.32/0.49 % Problem : Typed Set Theory - Types of Set Operators
% 0.32/0.49 % Version : Especial > Reduced > Especial.
% 0.32/0.49 % English : (! A:i.! X:i.in X (powerset A) -> in (setminus A X) (powerset A))
% 0.32/0.49
% 0.32/0.49 % Refs : [Bro08] Brown (2008), Email to G. Sutcliffe
% 0.32/0.49 % Source : [Bro08]
% 0.32/0.49 % Names : ZFC216l [Bro08]
% 0.32/0.49
% 0.32/0.49 % Status : Theorem
% 0.32/0.49 % 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 v5.1.0, 0.40 v5.0.0, 0.20 v4.1.0, 0.00 v3.7.0
% 0.32/0.49 % Syntax : Number of formulae : 8 ( 2 unt; 5 typ; 2 def)
% 0.32/0.49 % Number of atoms : 13 ( 2 equ; 0 cnn)
% 0.32/0.49 % Maximal formula atoms : 4 ( 4 avg)
% 0.32/0.49 % Number of connectives : 27 ( 0 ~; 0 |; 0 &; 21 @)
% 0.32/0.49 % ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% 0.32/0.49 % Maximal formula depth : 10 ( 4 avg)
% 0.32/0.49 % Number of types : 2 ( 0 usr)
% 0.32/0.49 % Number of type conns : 5 ( 5 >; 0 *; 0 +; 0 <<)
% 0.32/0.49 % Number of symbols : 6 ( 5 usr; 2 con; 0-2 aty)
% 0.32/0.49 % Number of variables : 8 ( 0 ^; 8 !; 0 ?; 8 :)
% 0.32/0.49 % SPC : TH0_THM_EQU_NAR
% 0.32/0.49
% 0.32/0.49 % Comments : http://mathgate.info/detsetitem.php?id=272
% 0.32/0.49 %------------------------------------------------------------------------------
% 0.32/0.49 thf(in_type,type,
% 0.32/0.49 in: $i > $i > $o ).
% 0.32/0.49
% 0.32/0.49 thf(powerset_type,type,
% 0.32/0.49 powerset: $i > $i ).
% 0.32/0.49
% 0.32/0.49 thf(powersetI_type,type,
% 0.32/0.49 powersetI: $o ).
% 0.32/0.49
% 0.32/0.49 thf(powersetI,definition,
% 0.32/0.49 ( powersetI
% 0.32/0.49 = ( ! [A: $i,B: $i] :
% 0.32/0.49 ( ! [Xx: $i] :
% 0.32/0.49 ( ( in @ Xx @ B )
% 0.32/0.49 => ( in @ Xx @ A ) )
% 0.32/0.49 => ( in @ B @ ( powerset @ A ) ) ) ) ) ).
% 0.32/0.49
% 0.32/0.49 thf(setminus_type,type,
% 0.32/0.49 setminus: $i > $i > $i ).
% 0.32/0.49
% 0.32/0.49 thf(setminusEL_type,type,
% 0.32/0.49 setminusEL: $o ).
% 0.32/0.49
% 0.32/0.49 thf(setminusEL,definition,
% 0.32/0.49 ( setminusEL
% 0.32/0.49 = ( ! [A: $i,B: $i,Xx: $i] :
% 0.32/0.49 ( ( in @ Xx @ ( setminus @ A @ B ) )
% 0.32/0.49 => ( in @ Xx @ A ) ) ) ) ).
% 0.32/0.49
% 0.32/0.49 thf(complementT_lem,conjecture,
% 0.32/0.49 ( powersetI
% 0.32/0.49 => ( setminusEL
% 0.32/0.49 => ! [A: $i,X: $i] :
% 0.32/0.49 ( ( in @ X @ ( powerset @ A ) )
% 0.32/0.49 => ( in @ ( setminus @ A @ X ) @ ( powerset @ A ) ) ) ) ) ).
% 0.32/0.49
% 0.32/0.49 %------------------------------------------------------------------------------
% 0.32/0.49 ------------------------
% 1.67/1.42 ---- Embedded in THF ---
% 1.67/1.42 %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.67/1.42 %%% Generated on Tue Feb 24 12:31:32 EST 2026
% 1.67/1.42 %%% using '$$dhol' embedding, version 1.3.0.
% 1.67/1.42 %%% Logic specification used:
% 1.67/1.42 %%% thf(spec, logic, $$dhol).
% 1.67/1.42
% 1.67/1.42 % SZS output start ListOfTHF for /export/starexec/sandbox/tmp/tmp.J9kT0swmdZ/DTF2DTF10275.p
% See solution above
% 1.67/1.42 ------------------------
% 1.67/1.43 ---- Cleaned THF ---
% 1.67/1.43 thf(in_type,type,
% 1.67/1.43 in: $i > $i > $o ).
% 1.67/1.43
% 1.67/1.43 thf(powerset_type,type,
% 1.67/1.43 powerset: $i > $i ).
% 1.67/1.43
% 1.67/1.43 thf(powersetI_type,type,
% 1.67/1.43 powersetI: $o ).
% 1.67/1.43
% 1.67/1.43 thf(powersetI,definition,
% 1.67/1.43 ( powersetI
% 1.67/1.43 = ( ! [A: $i,B: $i] :
% 1.67/1.43 ( ! [Xx: $i] :
% 1.67/1.43 ( ( in @ Xx @ B )
% 1.67/1.43 => ( in @ Xx @ A ) )
% 1.67/1.43 => ( in @ B @ ( powerset @ A ) ) ) ) ) ).
% 1.67/1.43
% 1.67/1.43 thf(setminus_type,type,
% 1.67/1.43 setminus: $i > $i > $i ).
% 1.67/1.43
% 1.67/1.43 thf(setminusEL_type,type,
% 1.67/1.43 setminusEL: $o ).
% 1.67/1.43
% 1.67/1.43 thf(setminusEL,definition,
% 1.67/1.43 ( setminusEL
% 1.67/1.43 = ( ! [A: $i,B: $i,Xx: $i] :
% 1.67/1.43 ( ( in @ Xx @ ( setminus @ A @ B ) )
% 1.67/1.43 => ( in @ Xx @ A ) ) ) ) ).
% 1.67/1.43
% 1.67/1.43 thf(complementT_lem,conjecture,
% 1.67/1.43 ( powersetI
% 1.67/1.43 => ( setminusEL
% 1.67/1.43 => ! [A: $i,X: $i] :
% 1.67/1.43 ( ( in @ X @ ( powerset @ A ) )
% 1.67/1.43 => ( in @ ( setminus @ A @ X ) @ ( powerset @ A ) ) ) ) ) ).
% 1.67/1.43 ------------------------
% 1.67/1.45 % (10374)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_10275 for (3000ds/4Mi)
% 1.67/1.45 % (10376)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on DTF2THF_10275 for (3000ds/2Mi)
% 1.67/1.45 % (10373)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on DTF2THF_10275 for (3000ds/183Mi)
% 1.67/1.45 % (10377)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_10275 for (3000ds/2Mi)
% 1.67/1.45 % (10375)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_10275 for (3000ds/27Mi)
% 1.67/1.45 % (10379)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on DTF2THF_10275 for (3000ds/18Mi)
% 1.67/1.45 % (10378)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_10275 for (3000ds/275Mi)
% 1.67/1.45 % (10376)Instruction limit reached!
% 1.67/1.45 % (10376)------------------------------
% 1.67/1.45 % (10376)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.67/1.45 % (10376)Termination reason: Unknown
% 1.67/1.45 % (10376)Termination phase: Saturation
% 1.67/1.45
% 1.67/1.45 % (10376)Memory used [KB]: 5500
% 1.67/1.45 % (10376)Time elapsed: 0.003 s
% 1.67/1.45 % (10376)Instructions burned: 2 (million)
% 1.67/1.45 % (10376)------------------------------
% 1.67/1.45 % (10376)------------------------------
% 1.67/1.45 % (10377)Instruction limit reached!
% 1.67/1.45 % (10377)------------------------------
% 1.67/1.45 % (10377)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.67/1.45 % (10377)Termination reason: Unknown
% 1.67/1.45 % (10377)Termination phase: Saturation
% 1.67/1.45
% 1.67/1.45 % (10377)Memory used [KB]: 895
% 1.67/1.45 % (10377)Time elapsed: 0.003 s
% 1.67/1.45 % (10377)Instructions burned: 2 (million)
% 1.67/1.45 % (10377)------------------------------
% 1.67/1.45 % (10377)------------------------------
% 1.67/1.46 % (10374)Instruction limit reached!
% 1.67/1.46 % (10374)------------------------------
% 1.67/1.46 % (10374)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.67/1.46 % (10374)Termination reason: Unknown
% 1.67/1.46 % (10374)Termination phase: Saturation
% 1.67/1.46
% 1.67/1.46 % (10374)Memory used [KB]: 5500
% 1.67/1.46 % (10374)Time elapsed: 0.004 s
% 1.67/1.46 % (10374)Instructions burned: 4 (million)
% 1.67/1.46 % (10374)------------------------------
% 1.67/1.46 % (10374)------------------------------
% 1.67/1.46 % (10379)First to succeed.
% 1.67/1.46 % (10373)Also succeeded, but the first one will report.
% 1.67/1.46 % (10375)Also succeeded, but the first one will report.
% 1.67/1.46 % (10379)Refutation found. Thanks to Tanya!
% 1.67/1.46 % SZS status Theorem for DTF2THF_10275
% 1.67/1.46 % SZS output start Proof for DTF2THF_10275
% 1.67/1.46 thf(func_def_0, type, in: $i > $i > $o).
% 1.67/1.46 thf(func_def_1, type, powerset: $i > $i).
% 1.67/1.46 thf(func_def_4, type, setminus: $i > $i > $i).
% 1.67/1.46 thf(func_def_12, type, sK4: $i > $i > $i).
% 1.67/1.46 thf(f57,plain,(
% 1.67/1.46 $false),
% 1.67/1.46 inference(subsumption_resolution,[status(thm)],[f56,f30])).
% 1.67/1.46 thf(f30,plain,(
% 1.67/1.46 ($true != (in @ (setminus @ sK1 @ sK0) @ (powerset @ sK1)))),
% 1.67/1.46 inference(cnf_transformation,[status(thm)],[f18])).
% 1.67/1.46 thf(f18,plain,(
% 1.67/1.46 (((in @ sK0 @ (powerset @ sK1)) = $true) & ($true != (in @ (setminus @ sK1 @ sK0) @ (powerset @ sK1)))) & (setminusEL = $true) & (powersetI = $true)),
% 1.67/1.46 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f16,f17])).
% 1.67/1.46 thf(f17,plain,(
% 1.67/1.46 ? [X0 : $i,X1 : $i] : (($true = (in @ X0 @ (powerset @ X1))) & ((in @ (setminus @ X1 @ X0) @ (powerset @ X1)) != $true)) => (((in @ sK0 @ (powerset @ sK1)) = $true) & ($true != (in @ (setminus @ sK1 @ sK0) @ (powerset @ sK1))))),
% 1.67/1.46 introduced(definition,[],[choice_axiom])).
% 1.67/1.46 thf(f16,plain,(
% 1.67/1.46 ? [X0 : $i,X1 : $i] : (($true = (in @ X0 @ (powerset @ X1))) & ((in @ (setminus @ X1 @ X0) @ (powerset @ X1)) != $true)) & (setminusEL = $true) & (powersetI = $true)),
% 1.67/1.46 inference(rectify,[status(thm)],[f15])).
% 1.67/1.46 thf(f15,plain,(
% 1.67/1.46 ? [X1 : $i,X0 : $i] : (((in @ X1 @ (powerset @ X0)) = $true) & ((in @ (setminus @ X0 @ X1) @ (powerset @ X0)) != $true)) & (setminusEL = $true) & (powersetI = $true)),
% 1.67/1.46 inference(flattening,[status(thm)],[f14])).
% 1.67/1.46 thf(f14,plain,(
% 1.67/1.46 (? [X1 : $i,X0 : $i] : (((in @ X1 @ (powerset @ X0)) = $true) & ((in @ (setminus @ X0 @ X1) @ (powerset @ X0)) != $true)) & (setminusEL = $true)) & (powersetI = $true)),
% 1.67/1.46 inference(ennf_transformation,[status(thm)],[f11])).
% 1.67/1.46 thf(f11,plain,(
% 1.67/1.46 ~((powersetI = $true) => ((setminusEL = $true) => ! [X0 : $i,X1 : $i] : (((in @ X1 @ (powerset @ X0)) = $true) => ((in @ (setminus @ X0 @ X1) @ (powerset @ X0)) = $true))))),
% 1.67/1.46 inference(fool_elimination,[status(thm)],[f10])).
% 1.67/1.46 thf(f10,plain,(
% 1.67/1.46 ~(powersetI => (setminusEL => ! [X0 : $i,X1 : $i] : ((in @ X1 @ (powerset @ X0)) => (in @ (setminus @ X0 @ X1) @ (powerset @ X0)))))),
% 1.67/1.46 inference(rectify,[status(thm)],[f4])).
% 1.67/1.46 thf(f4,negated_conjecture,(
% 1.67/1.46 ~(powersetI => (setminusEL => ! [X0 : $i,X3 : $i] : ((in @ X3 @ (powerset @ X0)) => (in @ (setminus @ X0 @ X3) @ (powerset @ X0)))))),
% 1.67/1.46 inference(negated_conjecture,[status(cth)],[f3])).
% 1.67/1.46 thf(f3,conjecture,(
% 1.67/1.46 powersetI => (setminusEL => ! [X0 : $i,X3 : $i] : ((in @ X3 @ (powerset @ X0)) => (in @ (setminus @ X0 @ X3) @ (powerset @ X0))))),
% 1.67/1.46 file('/export/starexec/sandbox/tmp/tmp.J9kT0swmdZ/DTF2THF_10275.p',complementT_lem)).
% 1.67/1.46 thf(f56,plain,(
% 1.67/1.46 ($true = (in @ (setminus @ sK1 @ sK0) @ (powerset @ sK1)))),
% 1.67/1.46 inference(trivial_inequality_removal,[status(thm)],[f55])).
% 1.67/1.46 thf(f55,plain,(
% 1.67/1.46 ($true = (in @ (setminus @ sK1 @ sK0) @ (powerset @ sK1))) | ($true != $true)),
% 1.67/1.46 inference(superposition,[status(thm)],[f46,f54])).
% 1.67/1.46 thf(f54,plain,(
% 1.67/1.46 ((in @ (sK4 @ (setminus @ sK1 @ sK0) @ sK1) @ sK1) = $true)),
% 1.67/1.46 inference(trivial_inequality_removal,[status(thm)],[f53])).
% 1.67/1.46 thf(f53,plain,(
% 1.67/1.46 ((in @ (sK4 @ (setminus @ sK1 @ sK0) @ sK1) @ sK1) = $true) | ($true != $true)),
% 1.67/1.46 inference(superposition,[status(thm)],[f47,f52])).
% 1.67/1.46 thf(f52,plain,(
% 1.67/1.46 ((in @ (sK4 @ (setminus @ sK1 @ sK0) @ sK1) @ (setminus @ sK1 @ sK0)) = $true)),
% 1.67/1.46 inference(trivial_inequality_removal,[status(thm)],[f49])).
% 1.67/1.46 thf(f49,plain,(
% 1.67/1.46 ((in @ (sK4 @ (setminus @ sK1 @ sK0) @ sK1) @ (setminus @ sK1 @ sK0)) = $true) | ($true != $true)),
% 1.67/1.46 inference(superposition,[status(thm)],[f30,f48])).
% 1.67/1.46 thf(f48,plain,(
% 1.67/1.46 ( ! [X3 : $i,X4 : $i] : (($true = (in @ X4 @ (powerset @ X3))) | ((in @ (sK4 @ X4 @ X3) @ X4) = $true)) )),
% 1.67/1.46 inference(trivial_inequality_removal,[status(thm)],[f42])).
% 1.67/1.46 thf(f42,plain,(
% 1.67/1.46 ( ! [X3 : $i,X4 : $i] : (($true = (in @ X4 @ (powerset @ X3))) | ((in @ (sK4 @ X4 @ X3) @ X4) = $true) | ($true != $true)) )),
% 1.67/1.46 inference(definition_unfolding,[status(thm)],[f32,f28])).
% 1.67/1.46 thf(f28,plain,(
% 1.67/1.46 (powersetI = $true)),
% 1.67/1.46 inference(cnf_transformation,[status(thm)],[f18])).
% 1.67/1.46 thf(f32,plain,(
% 1.67/1.46 ( ! [X3 : $i,X4 : $i] : (((in @ (sK4 @ X4 @ X3) @ X4) = $true) | ($true = (in @ X4 @ (powerset @ X3))) | (powersetI != $true)) )),
% 1.67/1.46 inference(cnf_transformation,[status(thm)],[f23])).
% 1.67/1.46 thf(f23,plain,(
% 1.67/1.46 ((powersetI = $true) | (! [X2 : $i] : (($true = (in @ X2 @ sK2)) | ((in @ X2 @ sK3) != $true)) & ((in @ sK3 @ (powerset @ sK2)) != $true))) & (! [X3 : $i,X4 : $i] : ((((in @ (sK4 @ X4 @ X3) @ X3) != $true) & ((in @ (sK4 @ X4 @ X3) @ X4) = $true)) | ($true = (in @ X4 @ (powerset @ X3)))) | (powersetI != $true))),
% 1.67/1.46 inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3,sK4])],[f20,f22,f21])).
% 1.67/1.46 thf(f21,plain,(
% 1.67/1.46 ? [X0 : $i,X1 : $i] : (! [X2 : $i] : (((in @ X2 @ X0) = $true) | ((in @ X2 @ X1) != $true)) & ((in @ X1 @ (powerset @ X0)) != $true)) => (! [X2 : $i] : (($true = (in @ X2 @ sK2)) | ((in @ X2 @ sK3) != $true)) & ((in @ sK3 @ (powerset @ sK2)) != $true))),
% 1.67/1.46 introduced(definition,[],[choice_axiom])).
% 1.67/1.46 thf(f22,plain,(
% 1.67/1.46 ! [X3 : $i,X4 : $i] : (? [X5 : $i] : (((in @ X5 @ X3) != $true) & ((in @ X5 @ X4) = $true)) => (((in @ (sK4 @ X4 @ X3) @ X3) != $true) & ((in @ (sK4 @ X4 @ X3) @ X4) = $true)))),
% 1.67/1.46 introduced(definition,[],[choice_axiom])).
% 1.67/1.46 thf(f20,plain,(
% 1.67/1.46 ((powersetI = $true) | ? [X0 : $i,X1 : $i] : (! [X2 : $i] : (((in @ X2 @ X0) = $true) | ((in @ X2 @ X1) != $true)) & ((in @ X1 @ (powerset @ X0)) != $true))) & (! [X3 : $i,X4 : $i] : (? [X5 : $i] : (((in @ X5 @ X3) != $true) & ((in @ X5 @ X4) = $true)) | ($true = (in @ X4 @ (powerset @ X3)))) | (powersetI != $true))),
% 1.67/1.46 inference(rectify,[status(thm)],[f19])).
% 1.67/1.46 thf(f19,plain,(
% 1.67/1.46 ((powersetI = $true) | ? [X1 : $i,X0 : $i] : (! [X2 : $i] : (((in @ X2 @ X1) = $true) | ((in @ X2 @ X0) != $true)) & ($true != (in @ X0 @ (powerset @ X1))))) & (! [X1 : $i,X0 : $i] : (? [X2 : $i] : (((in @ X2 @ X1) != $true) & ((in @ X2 @ X0) = $true)) | ($true = (in @ X0 @ (powerset @ X1)))) | (powersetI != $true))),
% 1.67/1.46 inference(nnf_transformation,[status(thm)],[f13])).
% 1.67/1.46 thf(f13,plain,(
% 1.67/1.46 (powersetI = $true) <=> ! [X1 : $i,X0 : $i] : (? [X2 : $i] : (((in @ X2 @ X1) != $true) & ((in @ X2 @ X0) = $true)) | ($true = (in @ X0 @ (powerset @ X1))))),
% 1.67/1.46 inference(ennf_transformation,[status(thm)],[f7])).
% 1.67/1.46 thf(f7,plain,(
% 1.67/1.46 (powersetI = $true) <=> ! [X1 : $i,X0 : $i] : (! [X2 : $i] : (((in @ X2 @ X0) = $true) => ((in @ X2 @ X1) = $true)) => ($true = (in @ X0 @ (powerset @ X1))))),
% 1.67/1.46 inference(fool_elimination,[status(thm)],[f6])).
% 1.67/1.46 thf(f6,plain,(
% 1.67/1.46 (powersetI = ! [X0 : $i,X1 : $i] : (! [X2 : $i] : ((in @ X2 @ X0) => (in @ X2 @ X1)) => (in @ X0 @ (powerset @ X1))))),
% 1.67/1.46 inference(rectify,[status(thm)],[f1])).
% 1.67/1.46 thf(f1,axiom,(
% 1.67/1.46 (powersetI = ! [X1 : $i,X0 : $i] : (! [X2 : $i] : ((in @ X2 @ X1) => (in @ X2 @ X0)) => (in @ X1 @ (powerset @ X0))))),
% 1.67/1.46 file('/export/starexec/sandbox/tmp/tmp.J9kT0swmdZ/DTF2THF_10275.p',powersetI)).
% 1.67/1.46 thf(f47,plain,(
% 1.67/1.46 ( ! [X3 : $i,X4 : $i,X5 : $i] : (((in @ X4 @ (setminus @ X5 @ X3)) != $true) | ($true = (in @ X4 @ X5))) )),
% 1.67/1.46 inference(trivial_inequality_removal,[status(thm)],[f45])).
% 1.67/1.46 thf(f45,plain,(
% 1.67/1.46 ( ! [X3 : $i,X4 : $i,X5 : $i] : (($true != $true) | ($true = (in @ X4 @ X5)) | ((in @ X4 @ (setminus @ X5 @ X3)) != $true)) )),
% 1.67/1.46 inference(definition_unfolding,[status(thm)],[f36,f29])).
% 1.67/1.46 thf(f29,plain,(
% 1.67/1.46 (setminusEL = $true)),
% 1.67/1.46 inference(cnf_transformation,[status(thm)],[f18])).
% 1.67/1.46 thf(f36,plain,(
% 1.67/1.46 ( ! [X3 : $i,X4 : $i,X5 : $i] : (((in @ X4 @ (setminus @ X5 @ X3)) != $true) | ($true = (in @ X4 @ X5)) | (setminusEL != $true)) )),
% 1.67/1.46 inference(cnf_transformation,[status(thm)],[f27])).
% 1.67/1.46 thf(f27,plain,(
% 1.67/1.46 ((setminusEL = $true) | (((in @ sK6 @ (setminus @ sK7 @ sK5)) = $true) & ((in @ sK6 @ sK7) != $true))) & (! [X3 : $i,X4 : $i,X5 : $i] : (((in @ X4 @ (setminus @ X5 @ X3)) != $true) | ($true = (in @ X4 @ X5))) | (setminusEL != $true))),
% 1.67/1.46 inference(skolemisation,[status(esa),new_symbols(skolem,[sK5,sK6,sK7])],[f25,f26])).
% 1.67/1.46 thf(f26,plain,(
% 1.67/1.46 ? [X0 : $i,X1 : $i,X2 : $i] : (($true = (in @ X1 @ (setminus @ X2 @ X0))) & ((in @ X1 @ X2) != $true)) => (((in @ sK6 @ (setminus @ sK7 @ sK5)) = $true) & ((in @ sK6 @ sK7) != $true))),
% 1.67/1.46 introduced(definition,[],[choice_axiom])).
% 1.67/1.46 thf(f25,plain,(
% 1.67/1.46 ((setminusEL = $true) | ? [X0 : $i,X1 : $i,X2 : $i] : (($true = (in @ X1 @ (setminus @ X2 @ X0))) & ((in @ X1 @ X2) != $true))) & (! [X3 : $i,X4 : $i,X5 : $i] : (((in @ X4 @ (setminus @ X5 @ X3)) != $true) | ($true = (in @ X4 @ X5))) | (setminusEL != $true))),
% 1.67/1.46 inference(rectify,[status(thm)],[f24])).
% 1.67/1.46 thf(f24,plain,(
% 1.67/1.46 ((setminusEL = $true) | ? [X2 : $i,X0 : $i,X1 : $i] : (((in @ X0 @ (setminus @ X1 @ X2)) = $true) & ((in @ X0 @ X1) != $true))) & (! [X2 : $i,X0 : $i,X1 : $i] : (((in @ X0 @ (setminus @ X1 @ X2)) != $true) | ((in @ X0 @ X1) = $true)) | (setminusEL != $true))),
% 1.67/1.46 inference(nnf_transformation,[status(thm)],[f12])).
% 1.67/1.46 thf(f12,plain,(
% 1.67/1.46 (setminusEL = $true) <=> ! [X2 : $i,X0 : $i,X1 : $i] : (((in @ X0 @ (setminus @ X1 @ X2)) != $true) | ((in @ X0 @ X1) = $true))),
% 1.67/1.46 inference(ennf_transformation,[status(thm)],[f9])).
% 1.67/1.46 thf(f9,plain,(
% 1.67/1.46 ! [X0 : $i,X2 : $i,X1 : $i] : (((in @ X0 @ (setminus @ X1 @ X2)) = $true) => ((in @ X0 @ X1) = $true)) <=> (setminusEL = $true)),
% 1.67/1.46 inference(fool_elimination,[status(thm)],[f8])).
% 1.67/1.46 thf(f8,plain,(
% 1.67/1.46 (! [X0 : $i,X1 : $i,X2 : $i] : ((in @ X0 @ (setminus @ X1 @ X2)) => (in @ X0 @ X1)) = setminusEL)),
% 1.67/1.46 inference(rectify,[status(thm)],[f2])).
% 1.67/1.46 thf(f2,axiom,(
% 1.67/1.46 (! [X2 : $i,X0 : $i,X1 : $i] : ((in @ X2 @ (setminus @ X0 @ X1)) => (in @ X2 @ X0)) = setminusEL)),
% 1.67/1.46 file('/export/starexec/sandbox/tmp/tmp.J9kT0swmdZ/DTF2THF_10275.p',setminusEL)).
% 1.67/1.46 thf(f46,plain,(
% 1.67/1.46 ( ! [X3 : $i,X4 : $i] : (((in @ (sK4 @ X4 @ X3) @ X3) != $true) | ($true = (in @ X4 @ (powerset @ X3)))) )),
% 1.67/1.46 inference(trivial_inequality_removal,[status(thm)],[f41])).
% 1.67/1.46 thf(f41,plain,(
% 1.67/1.46 ( ! [X3 : $i,X4 : $i] : (($true = (in @ X4 @ (powerset @ X3))) | ((in @ (sK4 @ X4 @ X3) @ X3) != $true) | ($true != $true)) )),
% 1.67/1.46 inference(definition_unfolding,[status(thm)],[f33,f28])).
% 1.67/1.46 thf(f33,plain,(
% 1.67/1.46 ( ! [X3 : $i,X4 : $i] : (((in @ (sK4 @ X4 @ X3) @ X3) != $true) | ($true = (in @ X4 @ (powerset @ X3))) | (powersetI != $true)) )),
% 1.67/1.46 inference(cnf_transformation,[status(thm)],[f23])).
% 1.67/1.46 % SZS output end Proof for DTF2THF_10275
% 1.67/1.46 % (10379)------------------------------
% 1.67/1.46 % (10379)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.67/1.46 % (10379)Termination reason: Refutation
% 1.67/1.46
% 1.67/1.46 % (10379)Memory used [KB]: 5500
% 1.67/1.46 % (10379)Time elapsed: 0.006 s
% 1.67/1.46 % (10379)Instructions burned: 4 (million)
% 1.67/1.46 % (10379)------------------------------
% 1.67/1.46 % (10379)------------------------------
% 1.67/1.46 % (10372)Success in time 0.02 s
%------------------------------------------------------------------------------