%------------------------------------------------------------------------------
% File : DT2H2X---1.9.5
% Problem : SEU721^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 : n010.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:40 AM UTC 2026
% Result : Theorem 1.69s 1.41s
% Output : Refutation 1.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 6
% Syntax : Number of formulae : 28 ( 7 unt; 0 typ; 0 def)
% Number of atoms : 372 ( 98 equ; 0 cnn)
% Maximal formula atoms : 10 ( 13 avg)
% Number of connectives : 411 ( 42 ~; 16 |; 41 &; 278 @)
% ( 2 <=>; 32 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 7 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 14 ( 11 usr; 10 con; 0-2 aty)
% Number of variables : 77 ( 0 ^; 50 !; 27 ?; 77 :)
% Comments :
%------------------------------------------------------------------------------
thf(func_def_0,type,
in: $i > $i > $o ).
thf(func_def_1,type,
powerset: $i > $i ).
thf(func_def_2,type,
binintersect: $i > $i > $i ).
thf(f36,plain,
$false,
inference(subsumption_resolution,[status(thm)],[f35,f25]) ).
thf(f25,plain,
( ( in @ sK6 @ sK4 )
!= $true ),
inference(cnf_transformation,[status(thm)],[f20]) ).
thf(f20,plain,
( ( ( in @ sK4 @ ( powerset @ sK3 ) )
= $true )
& ( ( in @ sK5 @ ( powerset @ sK3 ) )
= $true )
& ( ( in @ sK6 @ sK3 )
= $true )
& ( ( in @ sK6 @ ( binintersect @ sK4 @ sK5 ) )
= $true )
& ( ( in @ sK6 @ sK4 )
!= $true )
& ( binintersectEL = $true ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4,sK5,sK6])],[f12,f19,f18,f17]) ).
thf(f17,plain,
( ? [X0: $i,X1: $i] :
( ( ( in @ X1 @ ( powerset @ X0 ) )
= $true )
& ? [X2: $i] :
( ( ( in @ X2 @ ( powerset @ X0 ) )
= $true )
& ? [X3: $i] :
( ( ( in @ X3 @ X0 )
= $true )
& ( $true
= ( in @ X3 @ ( binintersect @ X1 @ X2 ) ) )
& ( ( in @ X3 @ X1 )
!= $true ) ) ) )
=> ( ( ( in @ sK4 @ ( powerset @ sK3 ) )
= $true )
& ? [X2: $i] :
( ( $true
= ( in @ X2 @ ( powerset @ sK3 ) ) )
& ? [X3: $i] :
( ( ( in @ X3 @ sK3 )
= $true )
& ( ( in @ X3 @ ( binintersect @ sK4 @ X2 ) )
= $true )
& ( ( in @ X3 @ sK4 )
!= $true ) ) ) ) ),
introduced(definition,[],[choice_axiom]) ).
thf(f18,plain,
( ? [X2: $i] :
( ( $true
= ( in @ X2 @ ( powerset @ sK3 ) ) )
& ? [X3: $i] :
( ( ( in @ X3 @ sK3 )
= $true )
& ( ( in @ X3 @ ( binintersect @ sK4 @ X2 ) )
= $true )
& ( ( in @ X3 @ sK4 )
!= $true ) ) )
=> ( ( ( in @ sK5 @ ( powerset @ sK3 ) )
= $true )
& ? [X3: $i] :
( ( ( in @ X3 @ sK3 )
= $true )
& ( ( in @ X3 @ ( binintersect @ sK4 @ sK5 ) )
= $true )
& ( ( in @ X3 @ sK4 )
!= $true ) ) ) ),
introduced(definition,[],[choice_axiom]) ).
thf(f19,plain,
( ? [X3: $i] :
( ( ( in @ X3 @ sK3 )
= $true )
& ( ( in @ X3 @ ( binintersect @ sK4 @ sK5 ) )
= $true )
& ( ( in @ X3 @ sK4 )
!= $true ) )
=> ( ( ( in @ sK6 @ sK3 )
= $true )
& ( ( in @ sK6 @ ( binintersect @ sK4 @ sK5 ) )
= $true )
& ( ( in @ sK6 @ sK4 )
!= $true ) ) ),
introduced(definition,[],[choice_axiom]) ).
thf(f12,plain,
( ? [X0: $i,X1: $i] :
( ( ( in @ X1 @ ( powerset @ X0 ) )
= $true )
& ? [X2: $i] :
( ( ( in @ X2 @ ( powerset @ X0 ) )
= $true )
& ? [X3: $i] :
( ( ( in @ X3 @ X0 )
= $true )
& ( $true
= ( in @ X3 @ ( binintersect @ X1 @ X2 ) ) )
& ( ( in @ X3 @ X1 )
!= $true ) ) ) )
& ( binintersectEL = $true ) ),
inference(flattening,[status(thm)],[f11]) ).
thf(f11,plain,
( ? [X1: $i,X0: $i] :
( ? [X2: $i] :
( ? [X3: $i] :
( ( $true
= ( in @ X3 @ ( binintersect @ X1 @ X2 ) ) )
& ( ( in @ X3 @ X1 )
!= $true )
& ( ( in @ X3 @ X0 )
= $true ) )
& ( ( in @ X2 @ ( powerset @ X0 ) )
= $true ) )
& ( ( in @ X1 @ ( powerset @ X0 ) )
= $true ) )
& ( binintersectEL = $true ) ),
inference(ennf_transformation,[status(thm)],[f9]) ).
thf(f9,plain,
~ ( ( binintersectEL = $true )
=> ! [X1: $i,X0: $i] :
( ( ( in @ X1 @ ( powerset @ X0 ) )
= $true )
=> ! [X2: $i] :
( ( ( in @ X2 @ ( powerset @ X0 ) )
= $true )
=> ! [X3: $i] :
( ( ( in @ X3 @ X0 )
= $true )
=> ( ( ( in @ X3 @ X1 )
!= $true )
=> ( $true
!= ( in @ X3 @ ( binintersect @ X1 @ X2 ) ) ) ) ) ) ) ),
inference(flattening,[status(thm)],[f6]) ).
thf(f6,plain,
~ ( ( binintersectEL = $true )
=> ! [X0: $i,X1: $i] :
( ( ( in @ X1 @ ( powerset @ X0 ) )
= $true )
=> ! [X2: $i] :
( ( ( in @ X2 @ ( powerset @ X0 ) )
= $true )
=> ! [X3: $i] :
( ( ( in @ X3 @ X0 )
= $true )
=> ( ( ( in @ X3 @ X1 )
!= $true )
=> ( $true
!= ( in @ X3 @ ( binintersect @ X1 @ X2 ) ) ) ) ) ) ) ),
inference(fool_elimination,[status(thm)],[f5]) ).
thf(f5,plain,
~ ( binintersectEL
=> ! [X0: $i,X1: $i] :
( ( in @ X1 @ ( powerset @ X0 ) )
=> ! [X2: $i] :
( ( in @ X2 @ ( powerset @ X0 ) )
=> ! [X3: $i] :
( ( in @ X3 @ X0 )
=> ( ~ ( in @ X3 @ X1 )
=> ~ ( in @ X3 @ ( binintersect @ X1 @ X2 ) ) ) ) ) ) ),
inference(rectify,[status(thm)],[f3]) ).
thf(f3,negated_conjecture,
~ ( binintersectEL
=> ! [X0: $i,X3: $i] :
( ( in @ X3 @ ( powerset @ X0 ) )
=> ! [X4: $i] :
( ( in @ X4 @ ( powerset @ X0 ) )
=> ! [X2: $i] :
( ( in @ X2 @ X0 )
=> ( ~ ( in @ X2 @ X3 )
=> ~ ( in @ X2 @ ( binintersect @ X3 @ X4 ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f2]) ).
thf(f2,conjecture,
( binintersectEL
=> ! [X0: $i,X3: $i] :
( ( in @ X3 @ ( powerset @ X0 ) )
=> ! [X4: $i] :
( ( in @ X4 @ ( powerset @ X0 ) )
=> ! [X2: $i] :
( ( in @ X2 @ X0 )
=> ( ~ ( in @ X2 @ X3 )
=> ~ ( in @ X2 @ ( binintersect @ X3 @ X4 ) ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.o0W22bbtlY/DTF2THF_13490.p',binintersectTELcontra) ).
thf(f35,plain,
( ( in @ sK6 @ sK4 )
= $true ),
inference(trivial_inequality_removal,[status(thm)],[f34]) ).
thf(f34,plain,
( ( $true != $true )
| ( ( in @ sK6 @ sK4 )
= $true ) ),
inference(superposition,[status(thm)],[f33,f26]) ).
thf(f26,plain,
( ( in @ sK6 @ ( binintersect @ sK4 @ sK5 ) )
= $true ),
inference(cnf_transformation,[status(thm)],[f20]) ).
thf(f33,plain,
! [X3: $i,X4: $i,X5: $i] :
( ( $true
!= ( in @ X5 @ ( binintersect @ X4 @ X3 ) ) )
| ( ( in @ X5 @ X4 )
= $true ) ),
inference(trivial_inequality_removal,[status(thm)],[f32]) ).
thf(f32,plain,
! [X3: $i,X4: $i,X5: $i] :
( ( $true != $true )
| ( $true
!= ( in @ X5 @ ( binintersect @ X4 @ X3 ) ) )
| ( ( in @ X5 @ X4 )
= $true ) ),
inference(definition_unfolding,[status(thm)],[f21,f24]) ).
thf(f24,plain,
binintersectEL = $true,
inference(cnf_transformation,[status(thm)],[f20]) ).
thf(f21,plain,
! [X3: $i,X4: $i,X5: $i] :
( ( $true
!= ( in @ X5 @ ( binintersect @ X4 @ X3 ) ) )
| ( ( in @ X5 @ X4 )
= $true )
| ( binintersectEL != $true ) ),
inference(cnf_transformation,[status(thm)],[f16]) ).
thf(f16,plain,
( ( ( binintersectEL = $true )
| ( ( ( in @ sK2 @ ( binintersect @ sK1 @ sK0 ) )
= $true )
& ( $true
!= ( in @ sK2 @ sK1 ) ) ) )
& ( ! [X3: $i,X4: $i,X5: $i] :
( ( $true
!= ( in @ X5 @ ( binintersect @ X4 @ X3 ) ) )
| ( ( in @ X5 @ X4 )
= $true ) )
| ( binintersectEL != $true ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f14,f15]) ).
thf(f15,plain,
( ? [X0: $i,X1: $i,X2: $i] :
( ( ( in @ X2 @ ( binintersect @ X1 @ X0 ) )
= $true )
& ( $true
!= ( in @ X2 @ X1 ) ) )
=> ( ( ( in @ sK2 @ ( binintersect @ sK1 @ sK0 ) )
= $true )
& ( $true
!= ( in @ sK2 @ sK1 ) ) ) ),
introduced(definition,[],[choice_axiom]) ).
thf(f14,plain,
( ( ( binintersectEL = $true )
| ? [X0: $i,X1: $i,X2: $i] :
( ( ( in @ X2 @ ( binintersect @ X1 @ X0 ) )
= $true )
& ( $true
!= ( in @ X2 @ X1 ) ) ) )
& ( ! [X3: $i,X4: $i,X5: $i] :
( ( $true
!= ( in @ X5 @ ( binintersect @ X4 @ X3 ) ) )
| ( ( in @ X5 @ X4 )
= $true ) )
| ( binintersectEL != $true ) ) ),
inference(rectify,[status(thm)],[f13]) ).
thf(f13,plain,
( ( ( binintersectEL = $true )
| ? [X2: $i,X1: $i,X0: $i] :
( ( ( in @ X0 @ ( binintersect @ X1 @ X2 ) )
= $true )
& ( ( in @ X0 @ X1 )
!= $true ) ) )
& ( ! [X2: $i,X1: $i,X0: $i] :
( ( ( in @ X0 @ ( binintersect @ X1 @ X2 ) )
!= $true )
| ( ( in @ X0 @ X1 )
= $true ) )
| ( binintersectEL != $true ) ) ),
inference(nnf_transformation,[status(thm)],[f10]) ).
thf(f10,plain,
( ( binintersectEL = $true )
<=> ! [X2: $i,X1: $i,X0: $i] :
( ( ( in @ X0 @ ( binintersect @ X1 @ X2 ) )
!= $true )
| ( ( in @ X0 @ X1 )
= $true ) ) ),
inference(ennf_transformation,[status(thm)],[f8]) ).
thf(f8,plain,
( ! [X2: $i,X1: $i,X0: $i] :
( ( ( in @ X0 @ ( binintersect @ X1 @ X2 ) )
= $true )
=> ( ( in @ X0 @ X1 )
= $true ) )
<=> ( binintersectEL = $true ) ),
inference(fool_elimination,[status(thm)],[f7]) ).
thf(f7,plain,
( binintersectEL
= ( ! [X0: $i,X1: $i,X2: $i] :
( ( in @ X0 @ ( binintersect @ X1 @ X2 ) )
=> ( in @ X0 @ X1 ) ) ) ),
inference(rectify,[status(thm)],[f1]) ).
thf(f1,axiom,
( binintersectEL
= ( ! [X2: $i,X0: $i,X1: $i] :
( ( in @ X2 @ ( binintersect @ X0 @ X1 ) )
=> ( in @ X2 @ X0 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.o0W22bbtlY/DTF2THF_13490.p',binintersectEL) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SEU721^2 : TPTP v9.2.1. Released v3.7.0.
% 0.12/0.13 % Command : /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.15/0.34 % Computer : n010.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:33 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.19/0.44 ---- Original DTF file ---
% 0.19/0.44 thf(spec,logic,$$dhol).
% 0.19/0.44 %------------------------------------------------------------------------------
% 0.19/0.44 % File : SEU721^2 : TPTP v9.2.1. Released v3.7.0.
% 0.19/0.44 % Domain : Set Theory
% 0.19/0.44 % Problem : Typed Set Theory - Laws for Typed Sets
% 0.19/0.44 % Version : Especial > Reduced > Especial.
% 0.19/0.44 % English : (! A:i.! X:i.in X (powerset A) -> (! Y:i.in Y (powerset A) ->
% 0.19/0.44 % (! x:i.in x A -> ~(in x X) -> ~(in x (binintersect X Y)))))
% 0.19/0.44
% 0.19/0.44 % Refs : [Bro08] Brown (2008), Email to G. Sutcliffe
% 0.19/0.44 % Source : [Bro08]
% 0.19/0.44 % Names : ZFC223l [Bro08]
% 0.19/0.44
% 0.19/0.44 % Status : Theorem
% 0.19/0.44 % 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.19/0.44 % Syntax : Number of formulae : 6 ( 1 unt; 4 typ; 1 def)
% 0.19/0.44 % Number of atoms : 10 ( 1 equ; 0 cnn)
% 0.19/0.44 % Maximal formula atoms : 6 ( 5 avg)
% 0.19/0.44 % Number of connectives : 28 ( 2 ~; 0 |; 0 &; 20 @)
% 0.19/0.44 % ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% 0.19/0.44 % Maximal formula depth : 14 ( 8 avg)
% 0.19/0.44 % Number of types : 2 ( 0 usr)
% 0.19/0.44 % Number of type conns : 5 ( 5 >; 0 *; 0 +; 0 <<)
% 0.19/0.44 % Number of symbols : 5 ( 4 usr; 1 con; 0-2 aty)
% 0.19/0.44 % Number of variables : 7 ( 0 ^; 7 !; 0 ?; 7 :)
% 0.19/0.44 % SPC : TH0_THM_EQU_NAR
% 0.19/0.44
% 0.19/0.44 % Comments : http://mathgate.info/detsetitem.php?id=281
% 0.19/0.44 %------------------------------------------------------------------------------
% 0.19/0.44 thf(in_type,type,
% 0.19/0.44 in: $i > $i > $o ).
% 0.19/0.44
% 0.19/0.44 thf(powerset_type,type,
% 0.19/0.44 powerset: $i > $i ).
% 0.19/0.44
% 0.19/0.44 thf(binintersect_type,type,
% 0.19/0.44 binintersect: $i > $i > $i ).
% 0.19/0.44
% 0.19/0.44 thf(binintersectEL_type,type,
% 0.19/0.44 binintersectEL: $o ).
% 0.19/0.44
% 0.19/0.44 thf(binintersectEL,definition,
% 0.19/0.44 ( binintersectEL
% 0.19/0.44 = ( ! [A: $i,B: $i,Xx: $i] :
% 0.19/0.44 ( ( in @ Xx @ ( binintersect @ A @ B ) )
% 0.19/0.44 => ( in @ Xx @ A ) ) ) ) ).
% 0.19/0.44
% 0.19/0.44 thf(binintersectTELcontra,conjecture,
% 0.19/0.44 ( binintersectEL
% 0.19/0.44 => ! [A: $i,X: $i] :
% 0.19/0.44 ( ( in @ X @ ( powerset @ A ) )
% 0.19/0.44 => ! [Y: $i] :
% 0.19/0.44 ( ( in @ Y @ ( powerset @ A ) )
% 0.19/0.44 => ! [Xx: $i] :
% 0.19/0.44 ( ( in @ Xx @ A )
% 0.19/0.44 => ( ~ ( in @ Xx @ X )
% 0.19/0.44 => ~ ( in @ Xx @ ( binintersect @ X @ Y ) ) ) ) ) ) ) ).
% 0.19/0.44
% 0.19/0.44 %------------------------------------------------------------------------------
% 0.19/0.44 ------------------------
% 1.51/1.38 ---- Embedded in THF ---
% 1.51/1.38 %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.51/1.38 %%% Generated on Tue Feb 24 12:31:34 EST 2026
% 1.51/1.38 %%% using '$$dhol' embedding, version 1.3.0.
% 1.51/1.38 %%% Logic specification used:
% 1.51/1.38 %%% thf(spec, logic, $$dhol).
% 1.51/1.38
% 1.51/1.38 % SZS output start ListOfTHF for /export/starexec/sandbox/tmp/tmp.o0W22bbtlY/DTF2DTF13490.p
% See solution above
% 1.51/1.38 ------------------------
% 1.51/1.39 ---- Cleaned THF ---
% 1.51/1.39 thf(in_type,type,
% 1.51/1.39 in: $i > $i > $o ).
% 1.51/1.39
% 1.51/1.39 thf(powerset_type,type,
% 1.51/1.39 powerset: $i > $i ).
% 1.51/1.39
% 1.51/1.39 thf(binintersect_type,type,
% 1.51/1.39 binintersect: $i > $i > $i ).
% 1.51/1.39
% 1.51/1.39 thf(binintersectEL_type,type,
% 1.51/1.39 binintersectEL: $o ).
% 1.51/1.39
% 1.51/1.39 thf(binintersectEL,definition,
% 1.51/1.39 ( binintersectEL
% 1.51/1.39 = ( ! [A: $i,B: $i,Xx: $i] :
% 1.51/1.39 ( ( in @ Xx @ ( binintersect @ A @ B ) )
% 1.51/1.39 => ( in @ Xx @ A ) ) ) ) ).
% 1.51/1.39
% 1.51/1.39 thf(binintersectTELcontra,conjecture,
% 1.51/1.39 ( binintersectEL
% 1.51/1.39 => ! [A: $i,X: $i] :
% 1.51/1.39 ( ( in @ X @ ( powerset @ A ) )
% 1.51/1.39 => ! [Y: $i] :
% 1.51/1.39 ( ( in @ Y @ ( powerset @ A ) )
% 1.51/1.39 => ! [Xx: $i] :
% 1.51/1.39 ( ( in @ Xx @ A )
% 1.51/1.39 => ( ~ ( in @ Xx @ X )
% 1.51/1.39 => ~ ( in @ Xx @ ( binintersect @ X @ Y ) ) ) ) ) ) ) ).
% 1.51/1.39 ------------------------
% 1.69/1.41 % (13592)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_13490 for (2999ds/275Mi)
% 1.69/1.41 % (13587)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on DTF2THF_13490 for (2999ds/183Mi)
% 1.69/1.41 % (13588)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_13490 for (2999ds/4Mi)
% 1.69/1.41 % (13589)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_13490 for (2999ds/27Mi)
% 1.69/1.41 % (13591)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_13490 for (2999ds/2Mi)
% 1.69/1.41 % (13593)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on DTF2THF_13490 for (2999ds/18Mi)
% 1.69/1.41 % (13590)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on DTF2THF_13490 for (2999ds/2Mi)
% 1.69/1.41 % (13590)Instruction limit reached!
% 1.69/1.41 % (13590)------------------------------
% 1.69/1.41 % (13590)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.69/1.41 % (13590)Termination reason: Unknown
% 1.69/1.41 % (13590)Termination phase: Property scanning
% 1.69/1.41
% 1.69/1.41 % (13590)Memory used [KB]: 895
% 1.69/1.41 % (13590)Time elapsed: 0.003 s
% 1.69/1.41 % (13590)Instructions burned: 2 (million)
% 1.69/1.41 % (13590)------------------------------
% 1.69/1.41 % (13590)------------------------------
% 1.69/1.41 % (13591)Instruction limit reached!
% 1.69/1.41 % (13591)------------------------------
% 1.69/1.41 % (13591)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.69/1.41 % (13591)Termination reason: Unknown
% 1.69/1.41 % (13591)Termination phase: Property scanning
% 1.69/1.41
% 1.69/1.41 % (13591)Memory used [KB]: 895
% 1.69/1.41 % (13591)Time elapsed: 0.003 s
% 1.69/1.41 % (13591)Instructions burned: 2 (million)
% 1.69/1.41 % (13591)------------------------------
% 1.69/1.41 % (13591)------------------------------
% 1.69/1.41 % (13592)First to succeed.
% 1.69/1.41 % (13588)Instruction limit reached!
% 1.69/1.41 % (13588)------------------------------
% 1.69/1.41 % (13588)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.69/1.41 % (13588)Termination reason: Unknown
% 1.69/1.41 % (13588)Termination phase: Saturation
% 1.69/1.41
% 1.69/1.41 % (13588)Memory used [KB]: 5500
% 1.69/1.41 % (13588)Time elapsed: 0.005 s
% 1.69/1.41 % (13588)Instructions burned: 4 (million)
% 1.69/1.41 % (13588)------------------------------
% 1.69/1.41 % (13588)------------------------------
% 1.69/1.41 % (13589)Also succeeded, but the first one will report.
% 1.69/1.41 % (13587)Also succeeded, but the first one will report.
% 1.69/1.41 % (13592)Refutation found. Thanks to Tanya!
% 1.69/1.41 % SZS status Theorem for DTF2THF_13490
% 1.69/1.41 % SZS output start Proof for DTF2THF_13490
% 1.69/1.41 thf(func_def_0, type, in: $i > $i > $o).
% 1.69/1.41 thf(func_def_1, type, powerset: $i > $i).
% 1.69/1.41 thf(func_def_2, type, binintersect: $i > $i > $i).
% 1.69/1.41 thf(f36,plain,(
% 1.69/1.41 $false),
% 1.69/1.41 inference(subsumption_resolution,[status(thm)],[f35,f25])).
% 1.69/1.41 thf(f25,plain,(
% 1.69/1.41 ((in @ sK6 @ sK4) != $true)),
% 1.69/1.41 inference(cnf_transformation,[status(thm)],[f20])).
% 1.69/1.41 thf(f20,plain,(
% 1.69/1.41 (((in @ sK4 @ (powerset @ sK3)) = $true) & (((in @ sK5 @ (powerset @ sK3)) = $true) & (((in @ sK6 @ sK3) = $true) & ((in @ sK6 @ (binintersect @ sK4 @ sK5)) = $true) & ((in @ sK6 @ sK4) != $true)))) & (binintersectEL = $true)),
% 1.69/1.41 inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4,sK5,sK6])],[f12,f19,f18,f17])).
% 1.69/1.41 thf(f17,plain,(
% 1.69/1.41 ? [X0 : $i,X1 : $i] : (((in @ X1 @ (powerset @ X0)) = $true) & ? [X2 : $i] : (((in @ X2 @ (powerset @ X0)) = $true) & ? [X3 : $i] : (((in @ X3 @ X0) = $true) & ($true = (in @ X3 @ (binintersect @ X1 @ X2))) & ((in @ X3 @ X1) != $true)))) => (((in @ sK4 @ (powerset @ sK3)) = $true) & ? [X2 : $i] : (($true = (in @ X2 @ (powerset @ sK3))) & ? [X3 : $i] : (((in @ X3 @ sK3) = $true) & ((in @ X3 @ (binintersect @ sK4 @ X2)) = $true) & ((in @ X3 @ sK4) != $true))))),
% 1.69/1.41 introduced(definition,[],[choice_axiom])).
% 1.69/1.41 thf(f18,plain,(
% 1.69/1.41 ? [X2 : $i] : (($true = (in @ X2 @ (powerset @ sK3))) & ? [X3 : $i] : (((in @ X3 @ sK3) = $true) & ((in @ X3 @ (binintersect @ sK4 @ X2)) = $true) & ((in @ X3 @ sK4) != $true))) => (((in @ sK5 @ (powerset @ sK3)) = $true) & ? [X3 : $i] : (((in @ X3 @ sK3) = $true) & ((in @ X3 @ (binintersect @ sK4 @ sK5)) = $true) & ((in @ X3 @ sK4) != $true)))),
% 1.69/1.41 introduced(definition,[],[choice_axiom])).
% 1.69/1.41 thf(f19,plain,(
% 1.69/1.41 ? [X3 : $i] : (((in @ X3 @ sK3) = $true) & ((in @ X3 @ (binintersect @ sK4 @ sK5)) = $true) & ((in @ X3 @ sK4) != $true)) => (((in @ sK6 @ sK3) = $true) & ((in @ sK6 @ (binintersect @ sK4 @ sK5)) = $true) & ((in @ sK6 @ sK4) != $true))),
% 1.69/1.41 introduced(definition,[],[choice_axiom])).
% 1.69/1.41 thf(f12,plain,(
% 1.69/1.41 ? [X0 : $i,X1 : $i] : (((in @ X1 @ (powerset @ X0)) = $true) & ? [X2 : $i] : (((in @ X2 @ (powerset @ X0)) = $true) & ? [X3 : $i] : (((in @ X3 @ X0) = $true) & ($true = (in @ X3 @ (binintersect @ X1 @ X2))) & ((in @ X3 @ X1) != $true)))) & (binintersectEL = $true)),
% 1.69/1.41 inference(flattening,[status(thm)],[f11])).
% 1.69/1.41 thf(f11,plain,(
% 1.69/1.41 ? [X1 : $i,X0 : $i] : (? [X2 : $i] : (? [X3 : $i] : ((($true = (in @ X3 @ (binintersect @ X1 @ X2))) & ((in @ X3 @ X1) != $true)) & ((in @ X3 @ X0) = $true)) & ((in @ X2 @ (powerset @ X0)) = $true)) & ((in @ X1 @ (powerset @ X0)) = $true)) & (binintersectEL = $true)),
% 1.69/1.41 inference(ennf_transformation,[status(thm)],[f9])).
% 1.69/1.41 thf(f9,plain,(
% 1.69/1.41 ~((binintersectEL = $true) => ! [X1 : $i,X0 : $i] : (((in @ X1 @ (powerset @ X0)) = $true) => ! [X2 : $i] : (((in @ X2 @ (powerset @ X0)) = $true) => ! [X3 : $i] : (((in @ X3 @ X0) = $true) => (((in @ X3 @ X1) != $true) => ($true != (in @ X3 @ (binintersect @ X1 @ X2))))))))),
% 1.69/1.41 inference(flattening,[status(thm)],[f6])).
% 1.69/1.41 thf(f6,plain,(
% 1.69/1.41 ~((binintersectEL = $true) => ! [X0 : $i,X1 : $i] : (((in @ X1 @ (powerset @ X0)) = $true) => ! [X2 : $i] : (((in @ X2 @ (powerset @ X0)) = $true) => ! [X3 : $i] : (((in @ X3 @ X0) = $true) => (~((in @ X3 @ X1) = $true) => ~($true = (in @ X3 @ (binintersect @ X1 @ X2))))))))),
% 1.69/1.41 inference(fool_elimination,[status(thm)],[f5])).
% 1.69/1.41 thf(f5,plain,(
% 1.69/1.41 ~(binintersectEL => ! [X0 : $i,X1 : $i] : ((in @ X1 @ (powerset @ X0)) => ! [X2 : $i] : ((in @ X2 @ (powerset @ X0)) => ! [X3 : $i] : ((in @ X3 @ X0) => (~(in @ X3 @ X1) => ~(in @ X3 @ (binintersect @ X1 @ X2)))))))),
% 1.69/1.41 inference(rectify,[status(thm)],[f3])).
% 1.69/1.41 thf(f3,negated_conjecture,(
% 1.69/1.41 ~(binintersectEL => ! [X0 : $i,X3 : $i] : ((in @ X3 @ (powerset @ X0)) => ! [X4 : $i] : ((in @ X4 @ (powerset @ X0)) => ! [X2 : $i] : ((in @ X2 @ X0) => (~(in @ X2 @ X3) => ~(in @ X2 @ (binintersect @ X3 @ X4)))))))),
% 1.69/1.41 inference(negated_conjecture,[status(cth)],[f2])).
% 1.69/1.41 thf(f2,conjecture,(
% 1.69/1.41 binintersectEL => ! [X0 : $i,X3 : $i] : ((in @ X3 @ (powerset @ X0)) => ! [X4 : $i] : ((in @ X4 @ (powerset @ X0)) => ! [X2 : $i] : ((in @ X2 @ X0) => (~(in @ X2 @ X3) => ~(in @ X2 @ (binintersect @ X3 @ X4))))))),
% 1.69/1.41 file('/export/starexec/sandbox/tmp/tmp.o0W22bbtlY/DTF2THF_13490.p',binintersectTELcontra)).
% 1.69/1.41 thf(f35,plain,(
% 1.69/1.41 ((in @ sK6 @ sK4) = $true)),
% 1.69/1.41 inference(trivial_inequality_removal,[status(thm)],[f34])).
% 1.69/1.41 thf(f34,plain,(
% 1.69/1.41 ($true != $true) | ((in @ sK6 @ sK4) = $true)),
% 1.69/1.41 inference(superposition,[status(thm)],[f33,f26])).
% 1.69/1.41 thf(f26,plain,(
% 1.69/1.41 ((in @ sK6 @ (binintersect @ sK4 @ sK5)) = $true)),
% 1.69/1.41 inference(cnf_transformation,[status(thm)],[f20])).
% 1.69/1.41 thf(f33,plain,(
% 1.69/1.41 ( ! [X3 : $i,X4 : $i,X5 : $i] : (($true != (in @ X5 @ (binintersect @ X4 @ X3))) | ((in @ X5 @ X4) = $true)) )),
% 1.69/1.41 inference(trivial_inequality_removal,[status(thm)],[f32])).
% 1.69/1.41 thf(f32,plain,(
% 1.69/1.41 ( ! [X3 : $i,X4 : $i,X5 : $i] : (($true != $true) | ($true != (in @ X5 @ (binintersect @ X4 @ X3))) | ((in @ X5 @ X4) = $true)) )),
% 1.69/1.41 inference(definition_unfolding,[status(thm)],[f21,f24])).
% 1.69/1.41 thf(f24,plain,(
% 1.69/1.41 (binintersectEL = $true)),
% 1.69/1.41 inference(cnf_transformation,[status(thm)],[f20])).
% 1.69/1.41 thf(f21,plain,(
% 1.69/1.41 ( ! [X3 : $i,X4 : $i,X5 : $i] : (($true != (in @ X5 @ (binintersect @ X4 @ X3))) | ((in @ X5 @ X4) = $true) | (binintersectEL != $true)) )),
% 1.69/1.41 inference(cnf_transformation,[status(thm)],[f16])).
% 1.69/1.41 thf(f16,plain,(
% 1.69/1.41 ((binintersectEL = $true) | (((in @ sK2 @ (binintersect @ sK1 @ sK0)) = $true) & ($true != (in @ sK2 @ sK1)))) & (! [X3 : $i,X4 : $i,X5 : $i] : (($true != (in @ X5 @ (binintersect @ X4 @ X3))) | ((in @ X5 @ X4) = $true)) | (binintersectEL != $true))),
% 1.69/1.41 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f14,f15])).
% 1.69/1.41 thf(f15,plain,(
% 1.69/1.41 ? [X0 : $i,X1 : $i,X2 : $i] : (((in @ X2 @ (binintersect @ X1 @ X0)) = $true) & ($true != (in @ X2 @ X1))) => (((in @ sK2 @ (binintersect @ sK1 @ sK0)) = $true) & ($true != (in @ sK2 @ sK1)))),
% 1.69/1.41 introduced(definition,[],[choice_axiom])).
% 1.69/1.41 thf(f14,plain,(
% 1.69/1.41 ((binintersectEL = $true) | ? [X0 : $i,X1 : $i,X2 : $i] : (((in @ X2 @ (binintersect @ X1 @ X0)) = $true) & ($true != (in @ X2 @ X1)))) & (! [X3 : $i,X4 : $i,X5 : $i] : (($true != (in @ X5 @ (binintersect @ X4 @ X3))) | ((in @ X5 @ X4) = $true)) | (binintersectEL != $true))),
% 1.69/1.41 inference(rectify,[status(thm)],[f13])).
% 1.69/1.41 thf(f13,plain,(
% 1.69/1.41 ((binintersectEL = $true) | ? [X2 : $i,X1 : $i,X0 : $i] : (((in @ X0 @ (binintersect @ X1 @ X2)) = $true) & ((in @ X0 @ X1) != $true))) & (! [X2 : $i,X1 : $i,X0 : $i] : (((in @ X0 @ (binintersect @ X1 @ X2)) != $true) | ((in @ X0 @ X1) = $true)) | (binintersectEL != $true))),
% 1.69/1.41 inference(nnf_transformation,[status(thm)],[f10])).
% 1.69/1.41 thf(f10,plain,(
% 1.69/1.41 (binintersectEL = $true) <=> ! [X2 : $i,X1 : $i,X0 : $i] : (((in @ X0 @ (binintersect @ X1 @ X2)) != $true) | ((in @ X0 @ X1) = $true))),
% 1.69/1.41 inference(ennf_transformation,[status(thm)],[f8])).
% 1.69/1.41 thf(f8,plain,(
% 1.69/1.41 ! [X2 : $i,X1 : $i,X0 : $i] : (((in @ X0 @ (binintersect @ X1 @ X2)) = $true) => ((in @ X0 @ X1) = $true)) <=> (binintersectEL = $true)),
% 1.69/1.41 inference(fool_elimination,[status(thm)],[f7])).
% 1.69/1.41 thf(f7,plain,(
% 1.69/1.41 (binintersectEL = ! [X0 : $i,X1 : $i,X2 : $i] : ((in @ X0 @ (binintersect @ X1 @ X2)) => (in @ X0 @ X1)))),
% 1.69/1.41 inference(rectify,[status(thm)],[f1])).
% 1.69/1.41 thf(f1,axiom,(
% 1.69/1.41 (binintersectEL = ! [X2 : $i,X0 : $i,X1 : $i] : ((in @ X2 @ (binintersect @ X0 @ X1)) => (in @ X2 @ X0)))),
% 1.69/1.41 file('/export/starexec/sandbox/tmp/tmp.o0W22bbtlY/DTF2THF_13490.p',binintersectEL)).
% 1.69/1.41 % SZS output end Proof for DTF2THF_13490
% 1.69/1.41 % (13592)------------------------------
% 1.69/1.41 % (13592)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.69/1.41 % (13592)Termination reason: Refutation
% 1.69/1.41
% 1.69/1.41 % (13592)Memory used [KB]: 5500
% 1.69/1.41 % (13592)Time elapsed: 0.005 s
% 1.69/1.41 % (13592)Instructions burned: 3 (million)
% 1.69/1.41 % (13592)------------------------------
% 1.69/1.41 % (13592)------------------------------
% 1.69/1.41 % (13586)Success in time 0.011 s
%------------------------------------------------------------------------------