%------------------------------------------------------------------------------
% File : DT2H2X---1.9.5
% Problem : SEU561^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 : n011.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:17 AM UTC 2026
% Result : Theorem 1.61s 1.35s
% Output : Refutation 1.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 3
% Syntax : Number of formulae : 19 ( 12 unt; 0 typ; 0 def)
% Number of atoms : 98 ( 27 equ; 0 cnn)
% Maximal formula atoms : 4 ( 5 avg)
% Number of connectives : 92 ( 11 ~; 0 |; 6 &; 55 @)
% ( 0 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 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)
% ( 5 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 30 ( 16 ^; 10 !; 4 ?; 30 :)
% Comments :
%------------------------------------------------------------------------------
thf(func_def_0,type,
in: $i > $i > $o ).
thf(func_def_1,type,
subset: $i > $i > $o ).
thf(f26,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[f25]) ).
thf(f25,plain,
$true = $false,
inference(beta_eta_normalization,[status(thm)],[f24]) ).
thf(f24,plain,
( $false
= ( ^ [Y0: $i] : $true
@ sK3 ) ),
inference(sigma_clausification,[status(thm)],[f23]) ).
thf(f23,plain,
( $true
!= ( !! @ $i
@ ^ [Y0: $i] : $true ) ),
inference(boolean_simplification,[status(thm)],[f22]) ).
thf(f22,plain,
( $true
!= ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ Y0 @ sK0 )
=> ( in @ Y0 @ sK0 ) ) ) ),
inference(beta_eta_normalization,[status(thm)],[f20]) ).
thf(f20,plain,
( $true
!= ( ^ [Y0: $i,Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y0 )
=> ( in @ Y2 @ Y1 ) ) )
@ sK0
@ sK0 ) ),
inference(definition_unfolding,[status(thm)],[f16,f18,f17]) ).
thf(f17,plain,
sK1 = sK0,
inference(cnf_transformation,[status(thm)],[f14]) ).
thf(f14,plain,
( ( sK1 = sK0 )
& ( $true
!= ( subset @ sK1 @ sK0 ) )
& ( subsetI1 = $true ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f12,f13]) ).
thf(f13,plain,
( ? [X0: $i,X1: $i] :
( ( X0 = X1 )
& ( $true
!= ( subset @ X1 @ X0 ) ) )
=> ( ( sK1 = sK0 )
& ( $true
!= ( subset @ sK1 @ sK0 ) ) ) ),
introduced(definition,[],[choice_axiom]) ).
thf(f12,plain,
( ? [X0: $i,X1: $i] :
( ( X0 = X1 )
& ( $true
!= ( subset @ X1 @ X0 ) ) )
& ( subsetI1 = $true ) ),
inference(ennf_transformation,[status(thm)],[f7]) ).
thf(f7,plain,
~ ( ( subsetI1 = $true )
=> ! [X0: $i,X1: $i] :
( ( X0 = X1 )
=> ( $true
= ( subset @ X1 @ X0 ) ) ) ),
inference(fool_elimination,[status(thm)],[f6]) ).
thf(f6,plain,
~ ( subsetI1
=> ! [X0: $i,X1: $i] :
( ( X0 = X1 )
=> ( subset @ X1 @ X0 ) ) ),
inference(rectify,[status(thm)],[f4]) ).
thf(f4,negated_conjecture,
~ ( subsetI1
=> ! [X1: $i,X0: $i] :
( ( X0 = X1 )
=> ( subset @ X0 @ X1 ) ) ),
inference(negated_conjecture,[status(cth)],[f3]) ).
thf(f3,conjecture,
( subsetI1
=> ! [X1: $i,X0: $i] :
( ( X0 = X1 )
=> ( subset @ X0 @ X1 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.DfO6xcmBoH/DTF2THF_3314.p',eqimpsubset1) ).
thf(f18,plain,
( subset
= ( ^ [Y0: $i,Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y0 )
=> ( in @ Y2 @ Y1 ) ) ) ) ),
inference(cnf_transformation,[status(thm)],[f11]) ).
thf(f11,plain,
( subset
= ( ^ [Y0: $i,Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y0 )
=> ( in @ Y2 @ Y1 ) ) ) ) ),
inference(fool_elimination,[status(thm)],[f10]) ).
thf(f10,plain,
( ( ^ [X0: $i,X1: $i] :
! [X2: $i] :
( ( in @ X2 @ X0 )
=> ( in @ X2 @ X1 ) ) )
= subset ),
inference(rectify,[status(thm)],[f1]) ).
thf(f1,axiom,
( ( ^ [X0: $i,X1: $i] :
! [X2: $i] :
( ( in @ X2 @ X0 )
=> ( in @ X2 @ X1 ) ) )
= subset ),
file('/export/starexec/sandbox/tmp/tmp.DfO6xcmBoH/DTF2THF_3314.p',subset) ).
thf(f16,plain,
( $true
!= ( subset @ sK1 @ sK0 ) ),
inference(cnf_transformation,[status(thm)],[f14]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU561^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.17/0.34 % Computer : n011.cluster.edu
% 0.17/0.34 % Model : x86_64 x86_64
% 0.17/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.34 % Memory : 8042.1875MB
% 0.17/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.34 % CPULimit : 300
% 0.17/0.34 % WCLimit : 300
% 0.17/0.34 % DateTime : Tue Feb 24 12:26:32 EST 2026
% 0.17/0.34 % CPUTime :
% 0.17/0.34 Running /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.28/0.47 ---- Original DTF file ---
% 0.28/0.47 thf(spec,logic,$$dhol).
% 0.28/0.47 %------------------------------------------------------------------------------
% 0.28/0.47 % File : SEU561^2 : TPTP v9.2.1. Released v3.7.0.
% 0.28/0.47 % Domain : Set Theory
% 0.28/0.47 % Problem : Preliminary Notions - Relations on Sets - Subsets
% 0.28/0.47 % Version : Especial > Reduced > Especial.
% 0.28/0.47 % English : (! A:i.! B:i.A = B -> subset A B)
% 0.28/0.47
% 0.28/0.47 % Refs : [Bro08] Brown (2008), Email to G. Sutcliffe
% 0.28/0.47 % Source : [Bro08]
% 0.28/0.47 % Names : ZFC063l [Bro08]
% 0.28/0.47
% 0.28/0.47 % Status : Theorem
% 0.28/0.47 % 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.0.0, 0.40 v4.1.0, 0.00 v3.7.0
% 0.28/0.47 % Syntax : Number of formulae : 6 ( 2 unt; 3 typ; 2 def)
% 0.28/0.47 % Number of atoms : 12 ( 3 equ; 0 cnn)
% 0.28/0.47 % Maximal formula atoms : 3 ( 4 avg)
% 0.28/0.47 % Number of connectives : 17 ( 0 ~; 0 |; 0 &; 12 @)
% 0.28/0.47 % ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% 0.28/0.47 % Maximal formula depth : 7 ( 3 avg)
% 0.28/0.47 % Number of types : 2 ( 0 usr)
% 0.28/0.47 % Number of type conns : 4 ( 4 >; 0 *; 0 +; 0 <<)
% 0.28/0.47 % Number of symbols : 4 ( 3 usr; 1 con; 0-2 aty)
% 0.28/0.47 % Number of variables : 8 ( 2 ^; 6 !; 0 ?; 8 :)
% 0.28/0.47 % SPC : TH0_THM_EQU_NAR
% 0.28/0.47
% 0.28/0.47 % Comments : http://mathgate.info/detsetitem.php?id=395
% 0.28/0.47 %------------------------------------------------------------------------------
% 0.28/0.47 thf(in_type,type,
% 0.28/0.47 in: $i > $i > $o ).
% 0.28/0.47
% 0.28/0.47 thf(subset_type,type,
% 0.28/0.47 subset: $i > $i > $o ).
% 0.28/0.47
% 0.28/0.47 thf(subset,definition,
% 0.28/0.47 ( subset
% 0.28/0.47 = ( ^ [A: $i,B: $i] :
% 0.28/0.47 ! [Xx: $i] :
% 0.28/0.47 ( ( in @ Xx @ A )
% 0.28/0.47 => ( in @ Xx @ B ) ) ) ) ).
% 0.28/0.47
% 0.28/0.47 thf(subsetI1_type,type,
% 0.28/0.47 subsetI1: $o ).
% 0.28/0.47
% 0.28/0.47 thf(subsetI1,definition,
% 0.28/0.47 ( subsetI1
% 0.28/0.47 = ( ! [A: $i,B: $i] :
% 0.28/0.47 ( ! [Xx: $i] :
% 0.28/0.47 ( ( in @ Xx @ A )
% 0.28/0.47 => ( in @ Xx @ B ) )
% 0.28/0.47 => ( subset @ A @ B ) ) ) ) ).
% 0.28/0.47
% 0.28/0.47 thf(eqimpsubset1,conjecture,
% 0.28/0.47 ( subsetI1
% 0.28/0.47 => ! [A: $i,B: $i] :
% 0.28/0.47 ( ( A = B )
% 0.28/0.47 => ( subset @ A @ B ) ) ) ).
% 0.28/0.47
% 0.28/0.47 %------------------------------------------------------------------------------
% 0.28/0.47 ------------------------
% 1.61/1.32 ---- Embedded in THF ---
% 1.61/1.32 %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.61/1.32 %%% Generated on Tue Feb 24 12:26:33 EST 2026
% 1.61/1.32 %%% using '$$dhol' embedding, version 1.3.0.
% 1.61/1.32 %%% Logic specification used:
% 1.61/1.32 %%% thf(spec, logic, $$dhol).
% 1.61/1.32
% 1.61/1.32 % SZS output start ListOfTHF for /export/starexec/sandbox/tmp/tmp.DfO6xcmBoH/DTF2DTF3314.p
% See solution above
% 1.61/1.32 ------------------------
% 1.61/1.33 ---- Cleaned THF ---
% 1.61/1.34 thf(in_type,type,
% 1.61/1.34 in: $i > $i > $o ).
% 1.61/1.34
% 1.61/1.34 thf(subset_type,type,
% 1.61/1.34 subset: $i > $i > $o ).
% 1.61/1.34
% 1.61/1.34 thf(subset,definition,
% 1.61/1.34 ( subset
% 1.61/1.34 = ( ^ [A: $i,B: $i] :
% 1.61/1.34 ! [Xx: $i] :
% 1.61/1.34 ( ( in @ Xx @ A )
% 1.61/1.34 => ( in @ Xx @ B ) ) ) ) ).
% 1.61/1.34
% 1.61/1.34 thf(subsetI1_type,type,
% 1.61/1.34 subsetI1: $o ).
% 1.61/1.34
% 1.61/1.34 thf(subsetI1,definition,
% 1.61/1.34 ( subsetI1
% 1.61/1.34 = ( ! [A: $i,B: $i] :
% 1.61/1.34 ( ! [Xx: $i] :
% 1.61/1.34 ( ( in @ Xx @ A )
% 1.61/1.34 => ( in @ Xx @ B ) )
% 1.61/1.34 => ( subset @ A @ B ) ) ) ) ).
% 1.61/1.34
% 1.61/1.34 thf(eqimpsubset1,conjecture,
% 1.61/1.34 ( subsetI1
% 1.61/1.34 => ! [A: $i,B: $i] :
% 1.61/1.34 ( ( A = B )
% 1.61/1.34 => ( subset @ A @ B ) ) ) ).
% 1.61/1.34 ------------------------
% 1.61/1.35 % (3506)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_3314 for (2999ds/2Mi)
% 1.61/1.35 % (3503)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_3314 for (2999ds/4Mi)
% 1.61/1.35 % (3505)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on DTF2THF_3314 for (2999ds/2Mi)
% 1.61/1.35 % (3506)Instruction limit reached!
% 1.61/1.35 % (3506)------------------------------
% 1.61/1.35 % (3506)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.61/1.35 % (3506)Termination reason: Unknown
% 1.61/1.35 % (3506)Termination phase: Saturation
% 1.61/1.35
% 1.61/1.35 % (3506)Memory used [KB]: 5373
% 1.61/1.35 % (3506)Time elapsed: 0.002 s
% 1.61/1.35 % (3506)Instructions burned: 2 (million)
% 1.61/1.35 % (3506)------------------------------
% 1.61/1.35 % (3506)------------------------------
% 1.61/1.35 % (3505)First to succeed.
% 1.61/1.35 % (3503)Also succeeded, but the first one will report.
% 1.61/1.35 % (3505)Refutation found. Thanks to Tanya!
% 1.61/1.35 % SZS status Theorem for DTF2THF_3314
% 1.61/1.35 % SZS output start Proof for DTF2THF_3314
% 1.61/1.35 thf(func_def_0, type, in: $i > $i > $o).
% 1.61/1.35 thf(func_def_1, type, subset: $i > $i > $o).
% 1.61/1.35 thf(f26,plain,(
% 1.61/1.35 $false),
% 1.61/1.35 inference(trivial_inequality_removal,[status(thm)],[f25])).
% 1.61/1.35 thf(f25,plain,(
% 1.61/1.35 ($true = $false)),
% 1.61/1.35 inference(beta_eta_normalization,[status(thm)],[f24])).
% 1.61/1.35 thf(f24,plain,(
% 1.61/1.35 ($false = ((^[Y0 : $i]: ($true)) @ sK3))),
% 1.61/1.35 inference(sigma_clausification,[status(thm)],[f23])).
% 1.61/1.35 thf(f23,plain,(
% 1.61/1.35 ($true != (!! @ $i @ (^[Y0 : $i]: ($true))))),
% 1.61/1.35 inference(boolean_simplification,[status(thm)],[f22])).
% 1.61/1.35 thf(f22,plain,(
% 1.61/1.35 ($true != (!! @ $i @ (^[Y0 : $i]: ((in @ Y0 @ sK0) => (in @ Y0 @ sK0)))))),
% 1.61/1.35 inference(beta_eta_normalization,[status(thm)],[f20])).
% 1.61/1.35 thf(f20,plain,(
% 1.61/1.35 ($true != ((^[Y0 : $i]: ((^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y0) => (in @ Y2 @ Y1))))))) @ sK0 @ sK0))),
% 1.61/1.35 inference(definition_unfolding,[status(thm)],[f16,f18,f17])).
% 1.61/1.35 thf(f17,plain,(
% 1.61/1.35 (sK1 = sK0)),
% 1.61/1.35 inference(cnf_transformation,[status(thm)],[f14])).
% 1.61/1.35 thf(f14,plain,(
% 1.61/1.35 ((sK1 = sK0) & ($true != (subset @ sK1 @ sK0))) & (subsetI1 = $true)),
% 1.61/1.35 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f12,f13])).
% 1.61/1.35 thf(f13,plain,(
% 1.61/1.35 ? [X0 : $i,X1 : $i] : ((X0 = X1) & ($true != (subset @ X1 @ X0))) => ((sK1 = sK0) & ($true != (subset @ sK1 @ sK0)))),
% 1.61/1.35 introduced(definition,[],[choice_axiom])).
% 1.61/1.35 thf(f12,plain,(
% 1.61/1.35 ? [X0 : $i,X1 : $i] : ((X0 = X1) & ($true != (subset @ X1 @ X0))) & (subsetI1 = $true)),
% 1.61/1.35 inference(ennf_transformation,[status(thm)],[f7])).
% 1.61/1.35 thf(f7,plain,(
% 1.61/1.35 ~((subsetI1 = $true) => ! [X0 : $i,X1 : $i] : ((X0 = X1) => ($true = (subset @ X1 @ X0))))),
% 1.61/1.35 inference(fool_elimination,[status(thm)],[f6])).
% 1.61/1.35 thf(f6,plain,(
% 1.61/1.35 ~(subsetI1 => ! [X0 : $i,X1 : $i] : ((X0 = X1) => (subset @ X1 @ X0)))),
% 1.61/1.35 inference(rectify,[status(thm)],[f4])).
% 1.61/1.35 thf(f4,negated_conjecture,(
% 1.61/1.35 ~(subsetI1 => ! [X1 : $i,X0 : $i] : ((X0 = X1) => (subset @ X0 @ X1)))),
% 1.61/1.35 inference(negated_conjecture,[status(cth)],[f3])).
% 1.61/1.35 thf(f3,conjecture,(
% 1.61/1.35 subsetI1 => ! [X1 : $i,X0 : $i] : ((X0 = X1) => (subset @ X0 @ X1))),
% 1.61/1.35 file('/export/starexec/sandbox/tmp/tmp.DfO6xcmBoH/DTF2THF_3314.p',eqimpsubset1)).
% 1.61/1.35 thf(f18,plain,(
% 1.61/1.35 (subset = (^[Y0 : $i]: ((^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y0) => (in @ Y2 @ Y1))))))))),
% 1.61/1.35 inference(cnf_transformation,[status(thm)],[f11])).
% 1.61/1.35 thf(f11,plain,(
% 1.61/1.35 (subset = (^[Y0 : $i]: ((^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y0) => (in @ Y2 @ Y1))))))))),
% 1.61/1.35 inference(fool_elimination,[status(thm)],[f10])).
% 1.61/1.35 thf(f10,plain,(
% 1.61/1.35 ((^[X0 : $i, X1 : $i] : (! [X2 : $i] : ((in @ X2 @ X0) => (in @ X2 @ X1)))) = subset)),
% 1.61/1.35 inference(rectify,[status(thm)],[f1])).
% 1.61/1.35 thf(f1,axiom,(
% 1.61/1.35 ((^[X0 : $i, X1 : $i] : (! [X2 : $i] : ((in @ X2 @ X0) => (in @ X2 @ X1)))) = subset)),
% 1.61/1.35 file('/export/starexec/sandbox/tmp/tmp.DfO6xcmBoH/DTF2THF_3314.p',subset)).
% 1.61/1.35 thf(f16,plain,(
% 1.61/1.35 ($true != (subset @ sK1 @ sK0))),
% 1.61/1.35 inference(cnf_transformation,[status(thm)],[f14])).
% 1.61/1.35 % SZS output end Proof for DTF2THF_3314
% 1.61/1.35 % (3505)------------------------------
% 1.61/1.35 % (3505)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.61/1.35 % (3505)Termination reason: Refutation
% 1.61/1.35
% 1.61/1.35 % (3505)Memory used [KB]: 5500
% 1.61/1.35 % (3505)Time elapsed: 0.002 s
% 1.61/1.35 % (3505)Instructions burned: 1 (million)
% 1.61/1.35 % (3505)------------------------------
% 1.61/1.35 % (3505)------------------------------
% 1.61/1.35 % (3501)Success in time 0.008 s
%------------------------------------------------------------------------------