%------------------------------------------------------------------------------
% File : DT2H2X---1.9.5
% Problem : SEU607^2 : TPTP v9.2.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/run_DT2H2X /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% Computer : n025.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:35:34 AM UTC 2026
% Result : Theorem 1.49s 1.23s
% Output : Refutation 1.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 3
% Syntax : Number of formulae : 29 ( 18 unt; 0 typ; 0 def)
% Number of atoms : 176 ( 39 equ; 0 cnn)
% Maximal formula atoms : 4 ( 6 avg)
% Number of connectives : 239 ( 20 ~; 3 |; 6 &; 173 @)
% ( 0 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 6 usr; 7 con; 0-2 aty)
% ( 15 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 60 ( 18 ^; 36 !; 6 ?; 60 :)
% Comments :
%------------------------------------------------------------------------------
thf(func_def_0,type,
in: $i > $i > $o ).
thf(func_def_1,type,
setminus: $i > $i > $i ).
thf(f40,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[f39]) ).
thf(f39,plain,
$false = $true,
inference(superposition,[status(thm)],[f26,f36]) ).
thf(f36,plain,
( ( in @ sK0 @ sK1 )
= $true ),
inference(trivial_inequality_removal,[status(thm)],[f32]) ).
thf(f32,plain,
( ( ( in @ sK0 @ sK1 )
= $true )
| ( $false = $true ) ),
inference(superposition,[status(thm)],[f24,f13]) ).
thf(f13,plain,
( ( in @ sK0 @ ( setminus @ sK1 @ sK2 ) )
= $true ),
inference(cnf_transformation,[status(thm)],[f12]) ).
thf(f12,plain,
( ( setminusEL = $true )
& ( ( in @ sK0 @ sK1 )
!= $true )
& ( ( in @ sK0 @ ( setminus @ sK1 @ sK2 ) )
= $true ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f10,f11]) ).
thf(f11,plain,
( ? [X0: $i,X1: $i,X2: $i] :
( ( ( in @ X0 @ X1 )
!= $true )
& ( ( in @ X0 @ ( setminus @ X1 @ X2 ) )
= $true ) )
=> ( ( ( in @ sK0 @ sK1 )
!= $true )
& ( ( in @ sK0 @ ( setminus @ sK1 @ sK2 ) )
= $true ) ) ),
introduced(definition,[],[choice_axiom]) ).
thf(f10,plain,
( ( setminusEL = $true )
& ? [X0: $i,X1: $i,X2: $i] :
( ( ( in @ X0 @ X1 )
!= $true )
& ( ( in @ X0 @ ( setminus @ X1 @ X2 ) )
= $true ) ) ),
inference(ennf_transformation,[status(thm)],[f9]) ).
thf(f9,plain,
~ ( ( setminusEL = $true )
=> ! [X0: $i,X1: $i,X2: $i] :
( ( ( in @ X0 @ X1 )
!= $true )
=> ( ( in @ X0 @ ( setminus @ X1 @ X2 ) )
!= $true ) ) ),
inference(flattening,[status(thm)],[f8]) ).
thf(f8,plain,
~ ( ( setminusEL = $true )
=> ! [X0: $i,X1: $i,X2: $i] :
( ( ( in @ X0 @ X1 )
!= $true )
=> ( ( in @ X0 @ ( setminus @ X1 @ X2 ) )
!= $true ) ) ),
inference(fool_elimination,[status(thm)],[f7]) ).
thf(f7,plain,
~ ( setminusEL
=> ! [X0: $i,X1: $i,X2: $i] :
( ~ ( in @ X0 @ X1 )
=> ~ ( in @ X0 @ ( setminus @ X1 @ X2 ) ) ) ),
inference(rectify,[status(thm)],[f3]) ).
thf(f3,negated_conjecture,
~ ( setminusEL
=> ! [X2: $i,X0: $i,X1: $i] :
( ~ ( in @ X2 @ X0 )
=> ~ ( in @ X2 @ ( setminus @ X0 @ X1 ) ) ) ),
inference(negated_conjecture,[status(cth)],[f2]) ).
thf(f2,conjecture,
( setminusEL
=> ! [X2: $i,X0: $i,X1: $i] :
( ~ ( in @ X2 @ X0 )
=> ~ ( in @ X2 @ ( setminus @ X0 @ X1 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.FFeJN88kP1/DTF2THF_13138.p',setminusILneg) ).
thf(f24,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( ( in @ X2 @ ( setminus @ X3 @ X1 ) )
= $false )
| ( ( in @ X2 @ X3 )
= $true ) ),
inference(binary_proxy_clausification,[status(thm)],[f23]) ).
thf(f23,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( ( in @ X2 @ ( setminus @ X3 @ X1 ) )
=> ( in @ X2 @ X3 ) )
= $true ),
inference(beta_eta_normalization,[status(thm)],[f22]) ).
thf(f22,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( ^ [Y0: $i] :
( ( in @ X2 @ ( setminus @ Y0 @ X1 ) )
=> ( in @ X2 @ Y0 ) )
@ X3 )
= $true ),
inference(pi_clausification,[status(thm)],[f21]) ).
thf(f21,plain,
! [X2: $i,X1: $i] :
( ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ X2 @ ( setminus @ Y0 @ X1 ) )
=> ( in @ X2 @ Y0 ) ) )
= $true ),
inference(beta_eta_normalization,[status(thm)],[f20]) ).
thf(f20,plain,
! [X2: $i,X1: $i] :
( $true
= ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y0 @ ( setminus @ Y1 @ X1 ) )
=> ( in @ Y0 @ Y1 ) ) )
@ X2 ) ),
inference(pi_clausification,[status(thm)],[f19]) ).
thf(f19,plain,
! [X1: $i] :
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y0 @ ( setminus @ Y1 @ X1 ) )
=> ( in @ Y0 @ Y1 ) ) ) )
= $true ),
inference(beta_eta_normalization,[status(thm)],[f18]) ).
thf(f18,plain,
! [X1: $i] :
( ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y1 @ ( setminus @ Y2 @ Y0 ) )
=> ( in @ Y1 @ Y2 ) ) ) )
@ X1 )
= $true ),
inference(pi_clausification,[status(thm)],[f17]) ).
thf(f17,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y1 @ ( setminus @ Y2 @ Y0 ) )
=> ( in @ Y1 @ Y2 ) ) ) ) )
= $true ),
inference(definition_unfolding,[status(thm)],[f16,f15]) ).
thf(f15,plain,
setminusEL = $true,
inference(cnf_transformation,[status(thm)],[f12]) ).
thf(f16,plain,
( setminusEL
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y1 @ ( setminus @ Y2 @ Y0 ) )
=> ( in @ Y1 @ Y2 ) ) ) ) ) ),
inference(cnf_transformation,[status(thm)],[f6]) ).
thf(f6,plain,
( setminusEL
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y1 @ ( setminus @ Y2 @ Y0 ) )
=> ( in @ Y1 @ Y2 ) ) ) ) ) ),
inference(fool_elimination,[status(thm)],[f5]) ).
thf(f5,plain,
( setminusEL
= ( ! [X0: $i,X1: $i,X2: $i] :
( ( in @ X1 @ ( setminus @ X0 @ X2 ) )
=> ( in @ X1 @ X0 ) ) ) ),
inference(rectify,[status(thm)],[f1]) ).
thf(f1,axiom,
( setminusEL
= ( ! [X0: $i,X2: $i,X1: $i] :
( ( in @ X2 @ ( setminus @ X0 @ X1 ) )
=> ( in @ X2 @ X0 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.FFeJN88kP1/DTF2THF_13138.p',setminusEL) ).
thf(f26,plain,
( ( in @ sK0 @ sK1 )
= $false ),
inference(trivial_inequality_removal,[status(thm)],[f25]) ).
thf(f25,plain,
( ( ( in @ sK0 @ sK1 )
= $false )
| ( $true != $true ) ),
inference(fool_paramodulation,[status(thm)],[f14]) ).
thf(f14,plain,
( ( in @ sK0 @ sK1 )
!= $true ),
inference(cnf_transformation,[status(thm)],[f12]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SEU607^2 : TPTP v9.2.1. Released v3.7.0.
% 0.00/0.12 % Command : /export/starexec/sandbox2/solver/bin/run_DT2H2X /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.17/0.33 % Computer : n025.cluster.edu
% 0.17/0.33 % Model : x86_64 x86_64
% 0.17/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.33 % Memory : 8042.1875MB
% 0.17/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.33 % CPULimit : 300
% 0.17/0.33 % WCLimit : 300
% 0.17/0.33 % DateTime : Tue Feb 24 12:28:27 EST 2026
% 0.17/0.33 % CPUTime :
% 0.17/0.33 Running /export/starexec/sandbox2/solver/bin/run_DT2H2X /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.30/0.45 ---- Original DTF file ---
% 0.30/0.46 thf(spec,logic,$$dhol).
% 0.30/0.46 %------------------------------------------------------------------------------
% 0.30/0.46 % File : SEU607^2 : TPTP v9.2.1. Released v3.7.0.
% 0.30/0.46 % Domain : Set Theory
% 0.30/0.46 % Problem : Preliminary Notions - Operations on Sets - Set Difference
% 0.30/0.46 % Version : Especial > Reduced > Especial.
% 0.30/0.46 % English : (! A:i.! B:i.! x:i.~(in x A) -> ~(in x (setminus A B)))
% 0.30/0.46
% 0.30/0.46 % Refs : [Bro08] Brown (2008), Email to G. Sutcliffe
% 0.30/0.46 % Source : [Bro08]
% 0.30/0.46 % Names : ZFC109l [Bro08]
% 0.30/0.46
% 0.30/0.46 % Status : Theorem
% 0.30/0.46 % 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 v4.1.0, 0.00 v3.7.0
% 0.30/0.46 % Syntax : Number of formulae : 5 ( 1 unt; 3 typ; 1 def)
% 0.30/0.46 % Number of atoms : 7 ( 1 equ; 0 cnn)
% 0.30/0.46 % Maximal formula atoms : 3 ( 3 avg)
% 0.30/0.46 % Number of connectives : 17 ( 2 ~; 0 |; 0 &; 12 @)
% 0.30/0.46 % ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% 0.30/0.46 % Maximal formula depth : 10 ( 6 avg)
% 0.30/0.46 % Number of types : 2 ( 0 usr)
% 0.30/0.46 % Number of type conns : 4 ( 4 >; 0 *; 0 +; 0 <<)
% 0.30/0.46 % Number of symbols : 4 ( 3 usr; 1 con; 0-2 aty)
% 0.30/0.46 % Number of variables : 6 ( 0 ^; 6 !; 0 ?; 6 :)
% 0.30/0.46 % SPC : TH0_THM_EQU_NAR
% 0.30/0.46
% 0.30/0.46 % Comments : http://mathgate.info/detsetitem.php?id=462
% 0.30/0.46 %------------------------------------------------------------------------------
% 0.30/0.46 thf(in_type,type,
% 0.30/0.46 in: $i > $i > $o ).
% 0.30/0.46
% 0.30/0.46 thf(setminus_type,type,
% 0.30/0.46 setminus: $i > $i > $i ).
% 0.30/0.46
% 0.30/0.46 thf(setminusEL_type,type,
% 0.30/0.46 setminusEL: $o ).
% 0.30/0.46
% 0.30/0.46 thf(setminusEL,definition,
% 0.30/0.46 ( setminusEL
% 0.30/0.46 = ( ! [A: $i,B: $i,Xx: $i] :
% 0.30/0.46 ( ( in @ Xx @ ( setminus @ A @ B ) )
% 0.30/0.46 => ( in @ Xx @ A ) ) ) ) ).
% 0.30/0.46
% 0.30/0.46 thf(setminusILneg,conjecture,
% 0.30/0.46 ( setminusEL
% 0.30/0.46 => ! [A: $i,B: $i,Xx: $i] :
% 0.30/0.46 ( ~ ( in @ Xx @ A )
% 0.30/0.46 => ~ ( in @ Xx @ ( setminus @ A @ B ) ) ) ) ).
% 0.30/0.46
% 0.30/0.46 %------------------------------------------------------------------------------
% 0.30/0.46 ------------------------
% 1.49/1.21 ---- Embedded in THF ---
% 1.49/1.21 %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.49/1.21 %%% Generated on Tue Feb 24 12:28:28 EST 2026
% 1.49/1.21 %%% using '$$dhol' embedding, version 1.3.0.
% 1.49/1.21 %%% Logic specification used:
% 1.49/1.21 %%% thf(spec, logic, $$dhol).
% 1.49/1.21
% 1.49/1.21 % SZS output start ListOfTHF for /export/starexec/sandbox2/tmp/tmp.FFeJN88kP1/DTF2DTF13138.p
% See solution above
% 1.49/1.21 ------------------------
% 1.49/1.21 ---- Cleaned THF ---
% 1.49/1.22 thf(in_type,type,
% 1.49/1.22 in: $i > $i > $o ).
% 1.49/1.22
% 1.49/1.22 thf(setminus_type,type,
% 1.49/1.22 setminus: $i > $i > $i ).
% 1.49/1.22
% 1.49/1.22 thf(setminusEL_type,type,
% 1.49/1.22 setminusEL: $o ).
% 1.49/1.22
% 1.49/1.22 thf(setminusEL,definition,
% 1.49/1.22 ( setminusEL
% 1.49/1.22 = ( ! [A: $i,B: $i,Xx: $i] :
% 1.49/1.22 ( ( in @ Xx @ ( setminus @ A @ B ) )
% 1.49/1.22 => ( in @ Xx @ A ) ) ) ) ).
% 1.49/1.22
% 1.49/1.22 thf(setminusILneg,conjecture,
% 1.49/1.22 ( setminusEL
% 1.49/1.22 => ! [A: $i,B: $i,Xx: $i] :
% 1.49/1.22 ( ~ ( in @ Xx @ A )
% 1.49/1.22 => ~ ( in @ Xx @ ( setminus @ A @ B ) ) ) ) ).
% 1.49/1.22 ------------------------
% 1.49/1.23 % (13356)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_13138 for (3000ds/4Mi)
% 1.49/1.23 % (13356)First to succeed.
% 1.49/1.23 % (13356)Refutation found. Thanks to Tanya!
% 1.49/1.23 % SZS status Theorem for DTF2THF_13138
% 1.49/1.23 % SZS output start Proof for DTF2THF_13138
% 1.49/1.23 thf(func_def_0, type, in: $i > $i > $o).
% 1.49/1.23 thf(func_def_1, type, setminus: $i > $i > $i).
% 1.49/1.23 thf(f40,plain,(
% 1.49/1.23 $false),
% 1.49/1.23 inference(trivial_inequality_removal,[status(thm)],[f39])).
% 1.49/1.23 thf(f39,plain,(
% 1.49/1.23 ($false = $true)),
% 1.49/1.23 inference(superposition,[status(thm)],[f26,f36])).
% 1.49/1.23 thf(f36,plain,(
% 1.49/1.23 ((in @ sK0 @ sK1) = $true)),
% 1.49/1.23 inference(trivial_inequality_removal,[status(thm)],[f32])).
% 1.49/1.23 thf(f32,plain,(
% 1.49/1.23 ((in @ sK0 @ sK1) = $true) | ($false = $true)),
% 1.49/1.23 inference(superposition,[status(thm)],[f24,f13])).
% 1.49/1.23 thf(f13,plain,(
% 1.49/1.23 ((in @ sK0 @ (setminus @ sK1 @ sK2)) = $true)),
% 1.49/1.23 inference(cnf_transformation,[status(thm)],[f12])).
% 1.49/1.23 thf(f12,plain,(
% 1.49/1.23 (setminusEL = $true) & (((in @ sK0 @ sK1) != $true) & ((in @ sK0 @ (setminus @ sK1 @ sK2)) = $true))),
% 1.49/1.23 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f10,f11])).
% 1.49/1.23 thf(f11,plain,(
% 1.49/1.23 ? [X0 : $i,X1 : $i,X2 : $i] : (((in @ X0 @ X1) != $true) & ((in @ X0 @ (setminus @ X1 @ X2)) = $true)) => (((in @ sK0 @ sK1) != $true) & ((in @ sK0 @ (setminus @ sK1 @ sK2)) = $true))),
% 1.49/1.23 introduced(definition,[],[choice_axiom])).
% 1.49/1.23 thf(f10,plain,(
% 1.49/1.23 (setminusEL = $true) & ? [X0 : $i,X1 : $i,X2 : $i] : (((in @ X0 @ X1) != $true) & ((in @ X0 @ (setminus @ X1 @ X2)) = $true))),
% 1.49/1.23 inference(ennf_transformation,[status(thm)],[f9])).
% 1.49/1.23 thf(f9,plain,(
% 1.49/1.23 ~((setminusEL = $true) => ! [X0 : $i,X1 : $i,X2 : $i] : (((in @ X0 @ X1) != $true) => ((in @ X0 @ (setminus @ X1 @ X2)) != $true)))),
% 1.49/1.23 inference(flattening,[status(thm)],[f8])).
% 1.49/1.23 thf(f8,plain,(
% 1.49/1.23 ~((setminusEL = $true) => ! [X0 : $i,X1 : $i,X2 : $i] : (~((in @ X0 @ X1) = $true) => ~((in @ X0 @ (setminus @ X1 @ X2)) = $true)))),
% 1.49/1.23 inference(fool_elimination,[status(thm)],[f7])).
% 1.49/1.23 thf(f7,plain,(
% 1.49/1.23 ~(setminusEL => ! [X0 : $i,X1 : $i,X2 : $i] : (~(in @ X0 @ X1) => ~(in @ X0 @ (setminus @ X1 @ X2))))),
% 1.49/1.23 inference(rectify,[status(thm)],[f3])).
% 1.49/1.23 thf(f3,negated_conjecture,(
% 1.49/1.23 ~(setminusEL => ! [X2 : $i,X0 : $i,X1 : $i] : (~(in @ X2 @ X0) => ~(in @ X2 @ (setminus @ X0 @ X1))))),
% 1.49/1.23 inference(negated_conjecture,[status(cth)],[f2])).
% 1.49/1.23 thf(f2,conjecture,(
% 1.49/1.23 setminusEL => ! [X2 : $i,X0 : $i,X1 : $i] : (~(in @ X2 @ X0) => ~(in @ X2 @ (setminus @ X0 @ X1)))),
% 1.49/1.23 file('/export/starexec/sandbox2/tmp/tmp.FFeJN88kP1/DTF2THF_13138.p',setminusILneg)).
% 1.49/1.23 thf(f24,plain,(
% 1.49/1.23 ( ! [X2 : $i,X3 : $i,X1 : $i] : (((in @ X2 @ (setminus @ X3 @ X1)) = $false) | ((in @ X2 @ X3) = $true)) )),
% 1.49/1.23 inference(binary_proxy_clausification,[status(thm)],[f23])).
% 1.49/1.23 thf(f23,plain,(
% 1.49/1.23 ( ! [X2 : $i,X3 : $i,X1 : $i] : ((((in @ X2 @ (setminus @ X3 @ X1)) => (in @ X2 @ X3)) = $true)) )),
% 1.49/1.23 inference(beta_eta_normalization,[status(thm)],[f22])).
% 1.49/1.23 thf(f22,plain,(
% 1.49/1.23 ( ! [X2 : $i,X3 : $i,X1 : $i] : ((((^[Y0 : $i]: ((in @ X2 @ (setminus @ Y0 @ X1)) => (in @ X2 @ Y0))) @ X3) = $true)) )),
% 1.49/1.23 inference(pi_clausification,[status(thm)],[f21])).
% 1.49/1.23 thf(f21,plain,(
% 1.49/1.23 ( ! [X2 : $i,X1 : $i] : (((!! @ $i @ (^[Y0 : $i]: ((in @ X2 @ (setminus @ Y0 @ X1)) => (in @ X2 @ Y0)))) = $true)) )),
% 1.49/1.23 inference(beta_eta_normalization,[status(thm)],[f20])).
% 1.49/1.23 thf(f20,plain,(
% 1.49/1.23 ( ! [X2 : $i,X1 : $i] : (($true = ((^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((in @ Y0 @ (setminus @ Y1 @ X1)) => (in @ Y0 @ Y1))))) @ X2))) )),
% 1.49/1.23 inference(pi_clausification,[status(thm)],[f19])).
% 1.49/1.23 thf(f19,plain,(
% 1.49/1.23 ( ! [X1 : $i] : (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((in @ Y0 @ (setminus @ Y1 @ X1)) => (in @ Y0 @ Y1)))))) = $true)) )),
% 1.49/1.23 inference(beta_eta_normalization,[status(thm)],[f18])).
% 1.49/1.23 thf(f18,plain,(
% 1.49/1.23 ( ! [X1 : $i] : ((((^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y1 @ (setminus @ Y2 @ Y0)) => (in @ Y1 @ Y2))))))) @ X1) = $true)) )),
% 1.49/1.23 inference(pi_clausification,[status(thm)],[f17])).
% 1.49/1.23 thf(f17,plain,(
% 1.49/1.23 ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y1 @ (setminus @ Y2 @ Y0)) => (in @ Y1 @ Y2)))))))) = $true)),
% 1.49/1.23 inference(definition_unfolding,[status(thm)],[f16,f15])).
% 1.49/1.23 thf(f15,plain,(
% 1.49/1.23 (setminusEL = $true)),
% 1.49/1.23 inference(cnf_transformation,[status(thm)],[f12])).
% 1.49/1.23 thf(f16,plain,(
% 1.49/1.23 (setminusEL = (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y1 @ (setminus @ Y2 @ Y0)) => (in @ Y1 @ Y2)))))))))),
% 1.49/1.23 inference(cnf_transformation,[status(thm)],[f6])).
% 1.49/1.23 thf(f6,plain,(
% 1.49/1.23 (setminusEL = (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y1 @ (setminus @ Y2 @ Y0)) => (in @ Y1 @ Y2)))))))))),
% 1.49/1.23 inference(fool_elimination,[status(thm)],[f5])).
% 1.49/1.23 thf(f5,plain,(
% 1.49/1.23 (setminusEL = ! [X0 : $i,X1 : $i,X2 : $i] : ((in @ X1 @ (setminus @ X0 @ X2)) => (in @ X1 @ X0)))),
% 1.49/1.23 inference(rectify,[status(thm)],[f1])).
% 1.49/1.23 thf(f1,axiom,(
% 1.49/1.23 (setminusEL = ! [X0 : $i,X2 : $i,X1 : $i] : ((in @ X2 @ (setminus @ X0 @ X1)) => (in @ X2 @ X0)))),
% 1.49/1.23 file('/export/starexec/sandbox2/tmp/tmp.FFeJN88kP1/DTF2THF_13138.p',setminusEL)).
% 1.49/1.23 thf(f26,plain,(
% 1.49/1.23 ((in @ sK0 @ sK1) = $false)),
% 1.49/1.23 inference(trivial_inequality_removal,[status(thm)],[f25])).
% 1.49/1.23 thf(f25,plain,(
% 1.49/1.23 ((in @ sK0 @ sK1) = $false) | ($true != $true)),
% 1.49/1.23 inference(fool_paramodulation,[status(thm)],[f14])).
% 1.49/1.23 thf(f14,plain,(
% 1.49/1.23 ((in @ sK0 @ sK1) != $true)),
% 1.49/1.23 inference(cnf_transformation,[status(thm)],[f12])).
% 1.49/1.23 % SZS output end Proof for DTF2THF_13138
% 1.49/1.23 % (13356)------------------------------
% 1.49/1.23 % (13356)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.49/1.23 % (13356)Termination reason: Refutation
% 1.49/1.23
% 1.49/1.23 % (13356)Memory used [KB]: 5500
% 1.49/1.23 % (13356)Time elapsed: 0.003 s
% 1.49/1.23 % (13356)Instructions burned: 2 (million)
% 1.49/1.23 % (13356)------------------------------
% 1.49/1.23 % (13356)------------------------------
% 1.49/1.23 % (13354)Success in time 0.012 s
%------------------------------------------------------------------------------