%------------------------------------------------------------------------------
% File : DT2H2X---1.9.5
% Problem : SEU536^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 : n029.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:09 AM UTC 2026
% Result : Theorem 1.48s 1.27s
% Output : Refutation 1.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 3
% Syntax : Number of formulae : 16 ( 4 unt; 0 typ; 0 def)
% Number of atoms : 130 ( 39 equ; 0 cnn)
% Maximal formula atoms : 8 ( 8 avg)
% Number of connectives : 139 ( 29 ~; 7 |; 17 &; 74 @)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 8 ( 8 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 4 usr; 4 con; 0-2 aty)
% Number of variables : 37 ( 0 ^; 21 !; 16 ?; 37 :)
% Comments :
%------------------------------------------------------------------------------
thf(func_def_0,type,
in: $i > $i > $o ).
thf(func_def_4,type,
sK0: $i > $o ).
thf(f17,plain,
$false,
inference(subsumption_resolution,[status(thm)],[f16,f12]) ).
thf(f12,plain,
( ( sK0 @ sK2 )
!= $true ),
inference(cnf_transformation,[status(thm)],[f11]) ).
thf(f11,plain,
( ! [X2: $i] :
( ( ( in @ X2 @ sK1 )
!= $true )
| ( ( sK0 @ X2 )
= $true ) )
& ( ( in @ sK2 @ sK1 )
= $true )
& ( ( sK0 @ sK2 )
!= $true ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f8,f10,f9]) ).
thf(f9,plain,
( ? [X0: $i > $o,X1: $i] :
( ! [X2: $i] :
( ( $true
!= ( in @ X2 @ X1 ) )
| ( ( X0 @ X2 )
= $true ) )
& ? [X3: $i] :
( ( ( in @ X3 @ X1 )
= $true )
& ( ( X0 @ X3 )
!= $true ) ) )
=> ( ! [X2: $i] :
( ( ( in @ X2 @ sK1 )
!= $true )
| ( ( sK0 @ X2 )
= $true ) )
& ? [X3: $i] :
( ( ( in @ X3 @ sK1 )
= $true )
& ( ( sK0 @ X3 )
!= $true ) ) ) ),
introduced(definition,[],[choice_axiom]) ).
thf(f10,plain,
( ? [X3: $i] :
( ( ( in @ X3 @ sK1 )
= $true )
& ( ( sK0 @ X3 )
!= $true ) )
=> ( ( ( in @ sK2 @ sK1 )
= $true )
& ( ( sK0 @ sK2 )
!= $true ) ) ),
introduced(definition,[],[choice_axiom]) ).
thf(f8,plain,
? [X0: $i > $o,X1: $i] :
( ! [X2: $i] :
( ( $true
!= ( in @ X2 @ X1 ) )
| ( ( X0 @ X2 )
= $true ) )
& ? [X3: $i] :
( ( ( in @ X3 @ X1 )
= $true )
& ( ( X0 @ X3 )
!= $true ) ) ),
inference(rectify,[status(thm)],[f7]) ).
thf(f7,plain,
? [X0: $i > $o,X1: $i] :
( ! [X3: $i] :
( ( ( in @ X3 @ X1 )
!= $true )
| ( ( X0 @ X3 )
= $true ) )
& ? [X2: $i] :
( ( $true
= ( in @ X2 @ X1 ) )
& ( ( X0 @ X2 )
!= $true ) ) ),
inference(ennf_transformation,[status(thm)],[f6]) ).
thf(f6,plain,
~ ! [X0: $i > $o,X1: $i] :
( ~ ! [X2: $i] :
( ( $true
= ( in @ X2 @ X1 ) )
=> ( ( X0 @ X2 )
= $true ) )
=> ? [X3: $i] :
( ( ( X0 @ X3 )
!= $true )
& ( ( in @ X3 @ X1 )
= $true ) ) ),
inference(flattening,[status(thm)],[f5]) ).
thf(f5,plain,
~ ! [X0: $i > $o,X1: $i] :
( ~ ! [X2: $i] :
( ( $true
= ( in @ X2 @ X1 ) )
=> ( ( X0 @ X2 )
= $true ) )
=> ? [X3: $i] :
( ( ( in @ X3 @ X1 )
= $true )
& ( ( X0 @ X3 )
!= $true ) ) ),
inference(fool_elimination,[status(thm)],[f4]) ).
thf(f4,plain,
~ ! [X0: $i > $o,X1: $i] :
( ~ ! [X2: $i] :
( ( in @ X2 @ X1 )
=> ( X0 @ X2 ) )
=> ? [X3: $i] :
( ( in @ X3 @ X1 )
& ~ ( X0 @ X3 ) ) ),
inference(rectify,[status(thm)],[f2]) ).
thf(f2,negated_conjecture,
~ ! [X1: $i > $o,X0: $i] :
( ~ ! [X2: $i] :
( ( in @ X2 @ X0 )
=> ( X1 @ X2 ) )
=> ? [X2: $i] :
( ( in @ X2 @ X0 )
& ~ ( X1 @ X2 ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f1,conjecture,
! [X1: $i > $o,X0: $i] :
( ~ ! [X2: $i] :
( ( in @ X2 @ X0 )
=> ( X1 @ X2 ) )
=> ? [X2: $i] :
( ( in @ X2 @ X0 )
& ~ ( X1 @ X2 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.WKFqfdQlZF/DTF2THF_32729.p',quantDeMorgan1) ).
thf(f16,plain,
( ( sK0 @ sK2 )
= $true ),
inference(trivial_inequality_removal,[status(thm)],[f15]) ).
thf(f15,plain,
( ( $true != $true )
| ( ( sK0 @ sK2 )
= $true ) ),
inference(superposition,[status(thm)],[f14,f13]) ).
thf(f13,plain,
( ( in @ sK2 @ sK1 )
= $true ),
inference(cnf_transformation,[status(thm)],[f11]) ).
thf(f14,plain,
! [X2: $i] :
( ( ( in @ X2 @ sK1 )
!= $true )
| ( ( sK0 @ X2 )
= $true ) ),
inference(cnf_transformation,[status(thm)],[f11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU536^2 : TPTP v9.2.1. Released v3.7.0.
% 0.12/0.13 % Command : /export/starexec/sandbox2/solver/bin/run_DT2H2X /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.16/0.33 % Computer : n029.cluster.edu
% 0.16/0.33 % Model : x86_64 x86_64
% 0.16/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33 % Memory : 8042.1875MB
% 0.16/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.34 % CPULimit : 300
% 0.16/0.34 % WCLimit : 300
% 0.16/0.34 % DateTime : Tue Feb 24 12:26:14 EST 2026
% 0.16/0.34 % CPUTime :
% 0.16/0.34 Running /export/starexec/sandbox2/solver/bin/run_DT2H2X /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.19/0.46 ---- Original DTF file ---
% 0.19/0.47 thf(spec,logic,$$dhol).
% 0.19/0.47 %------------------------------------------------------------------------------
% 0.19/0.47 % File : SEU536^2 : TPTP v9.2.1. Released v3.7.0.
% 0.19/0.47 % Domain : Set Theory
% 0.19/0.47 % Problem : Preliminary Notions - Bounded Quantifier Laws
% 0.19/0.47 % Version : Especial > Reduced > Especial.
% 0.19/0.47 % English : (! A:i.! phi:i>o.~(! x:i.in x A -> phi x) ->
% 0.19/0.47 % (? x:i.in x A & ~(phi x)))
% 0.19/0.47
% 0.19/0.47 % Refs : [Bro08] Brown (2008), Email to G. Sutcliffe
% 0.19/0.47 % Source : [Bro08]
% 0.19/0.47 % Names : ZFC038l [Bro08]
% 0.19/0.47 % : ZFC045l [Bro08]
% 0.19/0.47
% 0.19/0.47 % Status : Theorem
% 0.19/0.47 % Rating : 0.17 v9.1.0, 0.12 v9.0.0, 0.17 v8.2.0, 0.18 v8.1.0, 0.08 v7.4.0, 0.11 v7.3.0, 0.10 v7.2.0, 0.12 v7.1.0, 0.14 v7.0.0, 0.12 v6.4.0, 0.14 v6.3.0, 0.17 v6.2.0, 0.00 v6.1.0, 0.17 v6.0.0, 0.00 v5.3.0, 0.25 v5.2.0, 0.00 v3.7.0
% 0.19/0.47 % Syntax : Number of formulae : 2 ( 0 unt; 1 typ; 0 def)
% 0.19/0.47 % Number of atoms : 2 ( 0 equ; 0 cnn)
% 0.19/0.47 % Maximal formula atoms : 2 ( 2 avg)
% 0.19/0.47 % Number of connectives : 11 ( 2 ~; 0 |; 1 &; 6 @)
% 0.19/0.47 % ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% 0.19/0.47 % Maximal formula depth : 9 ( 9 avg)
% 0.19/0.47 % Number of types : 2 ( 0 usr)
% 0.19/0.47 % Number of type conns : 3 ( 3 >; 0 *; 0 +; 0 <<)
% 0.19/0.47 % Number of symbols : 1 ( 1 usr; 0 con; 2-2 aty)
% 0.19/0.47 % Number of variables : 4 ( 0 ^; 3 !; 1 ?; 4 :)
% 0.19/0.47 % SPC : TH0_THM_NEQ_NAR
% 0.19/0.47
% 0.19/0.47 % Comments : http://mathgate.info/detsetitem.php?id=449
% 0.19/0.47 % : http://mathgate.info/detsetitem.php?id=120
% 0.19/0.47 %------------------------------------------------------------------------------
% 0.19/0.47 thf(in,type,
% 0.19/0.47 in: $i > $i > $o ).
% 0.19/0.47
% 0.19/0.47 thf(quantDeMorgan1,conjecture,
% 0.19/0.47 ! [A: $i,Xphi: $i > $o] :
% 0.19/0.47 ( ~ ! [Xx: $i] :
% 0.19/0.47 ( ( in @ Xx @ A )
% 0.19/0.47 => ( Xphi @ Xx ) )
% 0.19/0.47 => ? [Xx: $i] :
% 0.19/0.47 ( ( in @ Xx @ A )
% 0.19/0.47 & ~ ( Xphi @ Xx ) ) ) ).
% 0.19/0.47
% 0.19/0.47 %------------------------------------------------------------------------------
% 0.19/0.47 ------------------------
% 1.48/1.24 ---- Embedded in THF ---
% 1.48/1.24 %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.48/1.24 %%% Generated on Tue Feb 24 12:26:15 EST 2026
% 1.48/1.24 %%% using '$$dhol' embedding, version 1.3.0.
% 1.48/1.24 %%% Logic specification used:
% 1.48/1.24 %%% thf(spec, logic, $$dhol).
% 1.48/1.24
% 1.48/1.24 % SZS output start ListOfTHF for /export/starexec/sandbox2/tmp/tmp.WKFqfdQlZF/DTF2DTF32729.p
% See solution above
% 1.48/1.24 ------------------------
% 1.48/1.25 ---- Cleaned THF ---
% 1.48/1.25 thf(in,type,
% 1.48/1.25 in: $i > $i > $o ).
% 1.48/1.25
% 1.48/1.25 thf(quantDeMorgan1,conjecture,
% 1.48/1.25 ! [A: $i,Xphi: $i > $o] :
% 1.48/1.25 ( ~ ! [Xx: $i] :
% 1.48/1.25 ( ( in @ Xx @ A )
% 1.48/1.25 => ( Xphi @ Xx ) )
% 1.48/1.25 => ? [Xx: $i] :
% 1.48/1.25 ( ( in @ Xx @ A )
% 1.48/1.25 & ~ ( Xphi @ Xx ) ) ) ).
% 1.48/1.25 ------------------------
% 1.48/1.26 % (401)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_32729 for (2999ds/2Mi)
% 1.48/1.27 % (397)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on DTF2THF_32729 for (2999ds/183Mi)
% 1.48/1.27 % (399)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_32729 for (2999ds/27Mi)
% 1.48/1.27 % (401)Instruction limit reached!
% 1.48/1.27 % (401)------------------------------
% 1.48/1.27 % (401)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.48/1.27 % (401)Termination reason: Unknown
% 1.48/1.27 % (401)Termination phase: Saturation
% 1.48/1.27
% 1.48/1.27 % (401)Memory used [KB]: 5373
% 1.48/1.27 % (401)Time elapsed: 0.002 s
% 1.48/1.27 % (401)Instructions burned: 2 (million)
% 1.48/1.27 % (401)------------------------------
% 1.48/1.27 % (401)------------------------------
% 1.48/1.27 % (397)First to succeed.
% 1.48/1.27 % (399)Also succeeded, but the first one will report.
% 1.48/1.27 % (397)Refutation found. Thanks to Tanya!
% 1.48/1.27 % SZS status Theorem for DTF2THF_32729
% 1.48/1.27 % SZS output start Proof for DTF2THF_32729
% 1.48/1.27 thf(func_def_0, type, in: $i > $i > $o).
% 1.48/1.27 thf(func_def_4, type, sK0: $i > $o).
% 1.48/1.27 thf(f17,plain,(
% 1.48/1.27 $false),
% 1.48/1.27 inference(subsumption_resolution,[status(thm)],[f16,f12])).
% 1.48/1.27 thf(f12,plain,(
% 1.48/1.27 ((sK0 @ sK2) != $true)),
% 1.48/1.27 inference(cnf_transformation,[status(thm)],[f11])).
% 1.48/1.27 thf(f11,plain,(
% 1.48/1.27 ! [X2 : $i] : (((in @ X2 @ sK1) != $true) | ((sK0 @ X2) = $true)) & (((in @ sK2 @ sK1) = $true) & ((sK0 @ sK2) != $true))),
% 1.48/1.27 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f8,f10,f9])).
% 1.48/1.27 thf(f9,plain,(
% 1.48/1.27 ? [X0 : $i > $o,X1 : $i] : (! [X2 : $i] : (($true != (in @ X2 @ X1)) | ((X0 @ X2) = $true)) & ? [X3 : $i] : (((in @ X3 @ X1) = $true) & ((X0 @ X3) != $true))) => (! [X2 : $i] : (((in @ X2 @ sK1) != $true) | ((sK0 @ X2) = $true)) & ? [X3 : $i] : (((in @ X3 @ sK1) = $true) & ((sK0 @ X3) != $true)))),
% 1.48/1.27 introduced(definition,[],[choice_axiom])).
% 1.48/1.27 thf(f10,plain,(
% 1.48/1.27 ? [X3 : $i] : (((in @ X3 @ sK1) = $true) & ((sK0 @ X3) != $true)) => (((in @ sK2 @ sK1) = $true) & ((sK0 @ sK2) != $true))),
% 1.48/1.27 introduced(definition,[],[choice_axiom])).
% 1.48/1.27 thf(f8,plain,(
% 1.48/1.27 ? [X0 : $i > $o,X1 : $i] : (! [X2 : $i] : (($true != (in @ X2 @ X1)) | ((X0 @ X2) = $true)) & ? [X3 : $i] : (((in @ X3 @ X1) = $true) & ((X0 @ X3) != $true)))),
% 1.48/1.27 inference(rectify,[status(thm)],[f7])).
% 1.48/1.27 thf(f7,plain,(
% 1.48/1.27 ? [X0 : $i > $o,X1 : $i] : (! [X3 : $i] : (((in @ X3 @ X1) != $true) | ((X0 @ X3) = $true)) & ? [X2 : $i] : (($true = (in @ X2 @ X1)) & ((X0 @ X2) != $true)))),
% 1.48/1.27 inference(ennf_transformation,[status(thm)],[f6])).
% 1.48/1.27 thf(f6,plain,(
% 1.48/1.27 ~! [X0 : $i > $o,X1 : $i] : (~! [X2 : $i] : (($true = (in @ X2 @ X1)) => ((X0 @ X2) = $true)) => ? [X3 : $i] : (((X0 @ X3) != $true) & ((in @ X3 @ X1) = $true)))),
% 1.48/1.27 inference(flattening,[status(thm)],[f5])).
% 1.48/1.27 thf(f5,plain,(
% 1.48/1.27 ~! [X0 : $i > $o,X1 : $i] : (~! [X2 : $i] : (($true = (in @ X2 @ X1)) => ((X0 @ X2) = $true)) => ? [X3 : $i] : (((in @ X3 @ X1) = $true) & ~((X0 @ X3) = $true)))),
% 1.48/1.27 inference(fool_elimination,[status(thm)],[f4])).
% 1.48/1.27 thf(f4,plain,(
% 1.48/1.27 ~! [X0 : $i > $o,X1 : $i] : (~! [X2 : $i] : ((in @ X2 @ X1) => (X0 @ X2)) => ? [X3 : $i] : ((in @ X3 @ X1) & ~(X0 @ X3)))),
% 1.48/1.27 inference(rectify,[status(thm)],[f2])).
% 1.48/1.27 thf(f2,negated_conjecture,(
% 1.48/1.27 ~! [X1 : $i > $o,X0 : $i] : (~! [X2 : $i] : ((in @ X2 @ X0) => (X1 @ X2)) => ? [X2 : $i] : ((in @ X2 @ X0) & ~(X1 @ X2)))),
% 1.48/1.27 inference(negated_conjecture,[status(cth)],[f1])).
% 1.48/1.27 thf(f1,conjecture,(
% 1.48/1.27 ! [X1 : $i > $o,X0 : $i] : (~! [X2 : $i] : ((in @ X2 @ X0) => (X1 @ X2)) => ? [X2 : $i] : ((in @ X2 @ X0) & ~(X1 @ X2)))),
% 1.48/1.27 file('/export/starexec/sandbox2/tmp/tmp.WKFqfdQlZF/DTF2THF_32729.p',quantDeMorgan1)).
% 1.48/1.27 thf(f16,plain,(
% 1.48/1.27 ((sK0 @ sK2) = $true)),
% 1.48/1.27 inference(trivial_inequality_removal,[status(thm)],[f15])).
% 1.48/1.27 thf(f15,plain,(
% 1.48/1.27 ($true != $true) | ((sK0 @ sK2) = $true)),
% 1.48/1.27 inference(superposition,[status(thm)],[f14,f13])).
% 1.48/1.27 thf(f13,plain,(
% 1.48/1.27 ((in @ sK2 @ sK1) = $true)),
% 1.48/1.27 inference(cnf_transformation,[status(thm)],[f11])).
% 1.48/1.27 thf(f14,plain,(
% 1.48/1.27 ( ! [X2 : $i] : (((in @ X2 @ sK1) != $true) | ((sK0 @ X2) = $true)) )),
% 1.48/1.27 inference(cnf_transformation,[status(thm)],[f11])).
% 1.48/1.27 % SZS output end Proof for DTF2THF_32729
% 1.48/1.27 % (397)------------------------------
% 1.48/1.27 % (397)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.48/1.27 % (397)Termination reason: Refutation
% 1.48/1.27
% 1.48/1.27 % (397)Memory used [KB]: 5500
% 1.48/1.27 % (397)Time elapsed: 0.002 s
% 1.48/1.27 % (397)Instructions burned: 1 (million)
% 1.48/1.27 % (397)------------------------------
% 1.48/1.27 % (397)------------------------------
% 1.48/1.27 % (396)Success in time 0.005 s
%------------------------------------------------------------------------------