%------------------------------------------------------------------------------
% File : DT2H2X---1.9.5
% Problem : SEU612^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 : n003.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:36 AM UTC 2026
% Result : Theorem 1.57s 1.34s
% Output : Refutation 1.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 28
% Number of leaves : 5
% Syntax : Number of formulae : 56 ( 38 unt; 0 typ; 0 def)
% Number of atoms : 407 ( 88 equ; 0 cnn)
% Maximal formula atoms : 6 ( 7 avg)
% Number of connectives : 604 ( 43 ~; 20 |; 16 &; 435 @)
% ( 0 <=>; 57 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 23 ( 23 >; 0 *; 0 +; 0 <<)
% Number of symbols : 14 ( 10 usr; 8 con; 0-2 aty)
% ( 33 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 131 ( 62 ^; 60 !; 9 ?; 131 :)
% Comments :
%------------------------------------------------------------------------------
thf(func_def_0,type,
in: $i > $i > $o ).
thf(func_def_1,type,
dsetconstr: $i > ( $i > $o ) > $i ).
thf(func_def_4,type,
binunion: $i > $i > $i ).
thf(func_def_6,type,
symdiff: $i > $i > $i ).
thf(func_def_21,type,
ph4:
!>[X0: $tType] : X0 ).
thf(f64,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[f63]) ).
thf(f63,plain,
$false = $true,
inference(superposition,[status(thm)],[f25,f61]) ).
thf(f61,plain,
( ( in @ sK0 @ sK1 )
= $false ),
inference(trivial_inequality_removal,[status(thm)],[f59]) ).
thf(f59,plain,
( ( ( in @ sK0 @ sK1 )
= $false )
| ( $false = $true ) ),
inference(superposition,[status(thm)],[f47,f57]) ).
thf(f57,plain,
( ( in @ sK0 @ ( binunion @ sK1 @ sK2 ) )
= $false ),
inference(subsumption_resolution,[status(thm)],[f55,f23]) ).
thf(f23,plain,
( $true
!= ( in @ sK0 @ sK2 ) ),
inference(cnf_transformation,[status(thm)],[f19]) ).
thf(f19,plain,
( ( binunionIL = $true )
& ( ( in @ sK0 @ sK1 )
= $true )
& ( ( in @ sK0 @ ( symdiff @ sK1 @ sK2 ) )
!= $true )
& ( $true
!= ( in @ sK0 @ sK2 ) )
& ( dsetconstrI = $true ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f17,f18]) ).
thf(f18,plain,
( ? [X0: $i,X1: $i,X2: $i] :
( ( ( in @ X0 @ X1 )
= $true )
& ( ( in @ X0 @ ( symdiff @ X1 @ X2 ) )
!= $true )
& ( ( in @ X0 @ X2 )
!= $true ) )
=> ( ( ( in @ sK0 @ sK1 )
= $true )
& ( ( in @ sK0 @ ( symdiff @ sK1 @ sK2 ) )
!= $true )
& ( $true
!= ( in @ sK0 @ sK2 ) ) ) ),
introduced(definition,[],[choice_axiom]) ).
thf(f17,plain,
( ( binunionIL = $true )
& ? [X0: $i,X1: $i,X2: $i] :
( ( ( in @ X0 @ X1 )
= $true )
& ( ( in @ X0 @ ( symdiff @ X1 @ X2 ) )
!= $true )
& ( ( in @ X0 @ X2 )
!= $true ) )
& ( dsetconstrI = $true ) ),
inference(flattening,[status(thm)],[f16]) ).
thf(f16,plain,
( ? [X0: $i,X1: $i,X2: $i] :
( ( ( in @ X0 @ ( symdiff @ X1 @ X2 ) )
!= $true )
& ( ( in @ X0 @ X2 )
!= $true )
& ( ( in @ X0 @ X1 )
= $true ) )
& ( binunionIL = $true )
& ( dsetconstrI = $true ) ),
inference(ennf_transformation,[status(thm)],[f15]) ).
thf(f15,plain,
~ ( ( dsetconstrI = $true )
=> ( ( binunionIL = $true )
=> ! [X0: $i,X1: $i,X2: $i] :
( ( ( in @ X0 @ X1 )
= $true )
=> ( ( ( in @ X0 @ X2 )
!= $true )
=> ( ( in @ X0 @ ( symdiff @ X1 @ X2 ) )
= $true ) ) ) ) ),
inference(flattening,[status(thm)],[f14]) ).
thf(f14,plain,
~ ( ( dsetconstrI = $true )
=> ( ( binunionIL = $true )
=> ! [X0: $i,X1: $i,X2: $i] :
( ( ( in @ X0 @ X1 )
= $true )
=> ( ( ( in @ X0 @ X2 )
!= $true )
=> ( ( in @ X0 @ ( symdiff @ X1 @ X2 ) )
= $true ) ) ) ) ),
inference(fool_elimination,[status(thm)],[f13]) ).
thf(f13,plain,
~ ( dsetconstrI
=> ( binunionIL
=> ! [X0: $i,X1: $i,X2: $i] :
( ( in @ X0 @ X1 )
=> ( ~ ( in @ X0 @ X2 )
=> ( in @ X0 @ ( symdiff @ X1 @ X2 ) ) ) ) ) ),
inference(rectify,[status(thm)],[f5]) ).
thf(f5,negated_conjecture,
~ ( dsetconstrI
=> ( binunionIL
=> ! [X2: $i,X0: $i,X4: $i] :
( ( in @ X2 @ X0 )
=> ( ~ ( in @ X2 @ X4 )
=> ( in @ X2 @ ( symdiff @ X0 @ X4 ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f4]) ).
thf(f4,conjecture,
( dsetconstrI
=> ( binunionIL
=> ! [X2: $i,X0: $i,X4: $i] :
( ( in @ X2 @ X0 )
=> ( ~ ( in @ X2 @ X4 )
=> ( in @ X2 @ ( symdiff @ X0 @ X4 ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.ElS4XldPWe/DTF2THF_17115.p',symdiffI1) ).
thf(f55,plain,
( ( ( in @ sK0 @ ( binunion @ sK1 @ sK2 ) )
= $false )
| ( $true
= ( in @ sK0 @ sK2 ) ) ),
inference(not_proxy_clausification,[status(thm)],[f54]) ).
thf(f54,plain,
( ( ( in @ sK0 @ ( binunion @ sK1 @ sK2 ) )
= $false )
| ( ( ~ ( in @ sK0 @ sK2 ) )
= $false ) ),
inference(binary_proxy_clausification,[status(thm)],[f52]) ).
thf(f52,plain,
( ( $false
= ( ~ ( in @ sK0 @ sK2 )
| ~ ( in @ sK0 @ sK1 ) ) )
| ( ( in @ sK0 @ ( binunion @ sK1 @ sK2 ) )
= $false ) ),
inference(beta_eta_normalization,[status(thm)],[f51]) ).
thf(f51,plain,
( ( ( ^ [Y0: $i] :
( ~ ( in @ Y0 @ sK2 )
| ~ ( in @ Y0 @ sK1 ) )
@ sK0 )
= $false )
| ( ( in @ sK0 @ ( binunion @ sK1 @ sK2 ) )
= $false ) ),
inference(trivial_inequality_removal,[status(thm)],[f50]) ).
thf(f50,plain,
( ( ( ^ [Y0: $i] :
( ~ ( in @ Y0 @ sK2 )
| ~ ( in @ Y0 @ sK1 ) )
@ sK0 )
= $false )
| ( $true != $true )
| ( ( in @ sK0 @ ( binunion @ sK1 @ sK2 ) )
= $false ) ),
inference(superposition,[status(thm)],[f31,f40]) ).
thf(f40,plain,
! [X2: $i,X3: $i > $o,X1: $i] :
( ( ( in @ X1 @ ( dsetconstr @ X2 @ X3 ) )
= $true )
| ( $false
= ( in @ X1 @ X2 ) )
| ( $false
= ( X3 @ X1 ) ) ),
inference(binary_proxy_clausification,[status(thm)],[f39]) ).
thf(f39,plain,
! [X2: $i,X3: $i > $o,X1: $i] :
( ( ( ( X3 @ X1 )
=> ( in @ X1 @ ( dsetconstr @ X2 @ X3 ) ) )
= $true )
| ( $false
= ( in @ X1 @ X2 ) ) ),
inference(binary_proxy_clausification,[status(thm)],[f38]) ).
thf(f38,plain,
! [X2: $i,X3: $i > $o,X1: $i] :
( ( ( in @ X1 @ X2 )
=> ( ( X3 @ X1 )
=> ( in @ X1 @ ( dsetconstr @ X2 @ X3 ) ) ) )
= $true ),
inference(beta_eta_normalization,[status(thm)],[f37]) ).
thf(f37,plain,
! [X2: $i,X3: $i > $o,X1: $i] :
( $true
= ( ^ [Y0: $i > $o] :
( ( in @ X1 @ X2 )
=> ( ( Y0 @ X1 )
=> ( in @ X1 @ ( dsetconstr @ X2 @ Y0 ) ) ) )
@ X3 ) ),
inference(pi_clausification,[status(thm)],[f36]) ).
thf(f36,plain,
! [X2: $i,X1: $i] :
( ( !! @ ( $i > $o )
@ ^ [Y0: $i > $o] :
( ( in @ X1 @ X2 )
=> ( ( Y0 @ X1 )
=> ( in @ X1 @ ( dsetconstr @ X2 @ Y0 ) ) ) ) )
= $true ),
inference(beta_eta_normalization,[status(thm)],[f35]) ).
thf(f35,plain,
! [X2: $i,X1: $i] :
( $true
= ( ^ [Y0: $i] :
( !! @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( ( in @ X1 @ Y0 )
=> ( ( Y1 @ X1 )
=> ( in @ X1 @ ( dsetconstr @ Y0 @ Y1 ) ) ) ) )
@ X2 ) ),
inference(pi_clausification,[status(thm)],[f34]) ).
thf(f34,plain,
! [X1: $i] :
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( ( in @ X1 @ Y0 )
=> ( ( Y1 @ X1 )
=> ( in @ X1 @ ( dsetconstr @ Y0 @ Y1 ) ) ) ) ) )
= $true ),
inference(beta_eta_normalization,[status(thm)],[f33]) ).
thf(f33,plain,
! [X1: $i] :
( ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ ( $i > $o )
@ ^ [Y2: $i > $o] :
( ( in @ Y0 @ Y1 )
=> ( ( Y2 @ Y0 )
=> ( in @ Y0 @ ( dsetconstr @ Y1 @ Y2 ) ) ) ) ) )
@ X1 )
= $true ),
inference(pi_clausification,[status(thm)],[f32]) ).
thf(f32,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ ( $i > $o )
@ ^ [Y2: $i > $o] :
( ( in @ Y0 @ Y1 )
=> ( ( Y2 @ Y0 )
=> ( in @ Y0 @ ( dsetconstr @ Y1 @ Y2 ) ) ) ) ) ) )
= $true ),
inference(beta_eta_normalization,[status(thm)],[f30]) ).
thf(f30,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ ( $i > $o )
@ ^ [Y2: $i > $o] :
( ( in @ Y0 @ Y1 )
=> ( ( Y2 @ Y0 )
=> ( in @ Y0
@ ( dsetconstr @ Y1
@ ^ [Y3: $i] : ( Y2 @ Y3 ) ) ) ) ) ) ) )
= $true ),
inference(definition_unfolding,[status(thm)],[f27,f22]) ).
thf(f22,plain,
dsetconstrI = $true,
inference(cnf_transformation,[status(thm)],[f19]) ).
thf(f27,plain,
( dsetconstrI
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ ( $i > $o )
@ ^ [Y2: $i > $o] :
( ( in @ Y0 @ Y1 )
=> ( ( Y2 @ Y0 )
=> ( in @ Y0
@ ( dsetconstr @ Y1
@ ^ [Y3: $i] : ( Y2 @ Y3 ) ) ) ) ) ) ) ) ),
inference(cnf_transformation,[status(thm)],[f8]) ).
thf(f8,plain,
( dsetconstrI
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ ( $i > $o )
@ ^ [Y2: $i > $o] :
( ( in @ Y0 @ Y1 )
=> ( ( Y2 @ Y0 )
=> ( in @ Y0
@ ( dsetconstr @ Y1
@ ^ [Y3: $i] : ( Y2 @ Y3 ) ) ) ) ) ) ) ) ),
inference(fool_elimination,[status(thm)],[f7]) ).
thf(f7,plain,
( dsetconstrI
= ( ! [X0: $i > $o,X1: $i,X2: $i] :
( ( in @ X2 @ X1 )
=> ( ( X0 @ X2 )
=> ( in @ X2
@ ( dsetconstr @ X1
@ ^ [X3: $i] : ( X0 @ X3 ) ) ) ) ) ) ),
inference(rectify,[status(thm)],[f1]) ).
thf(f1,axiom,
( dsetconstrI
= ( ! [X1: $i > $o,X0: $i,X2: $i] :
( ( in @ X2 @ X0 )
=> ( ( X1 @ X2 )
=> ( in @ X2
@ ( dsetconstr @ X0
@ ^ [X3: $i] : ( X1 @ X3 ) ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.ElS4XldPWe/DTF2THF_17115.p',dsetconstrI) ).
thf(f31,plain,
( ( in @ sK0
@ ( dsetconstr @ ( binunion @ sK1 @ sK2 )
@ ^ [Y0: $i] :
( ~ ( in @ Y0 @ sK2 )
| ~ ( in @ Y0 @ sK1 ) ) ) )
!= $true ),
inference(beta_eta_normalization,[status(thm)],[f29]) ).
thf(f29,plain,
( ( in @ sK0
@ ( ^ [Y0: $i,Y1: $i] :
( dsetconstr @ ( binunion @ Y0 @ Y1 )
@ ^ [Y2: $i] :
( ~ ( in @ Y2 @ Y1 )
| ~ ( in @ Y2 @ Y0 ) ) )
@ sK1
@ sK2 ) )
!= $true ),
inference(definition_unfolding,[status(thm)],[f24,f20]) ).
thf(f20,plain,
( symdiff
= ( ^ [Y0: $i,Y1: $i] :
( dsetconstr @ ( binunion @ Y0 @ Y1 )
@ ^ [Y2: $i] :
( ~ ( in @ Y2 @ Y1 )
| ~ ( in @ Y2 @ Y0 ) ) ) ) ),
inference(cnf_transformation,[status(thm)],[f12]) ).
thf(f12,plain,
( symdiff
= ( ^ [Y0: $i,Y1: $i] :
( dsetconstr @ ( binunion @ Y0 @ Y1 )
@ ^ [Y2: $i] :
( ~ ( in @ Y2 @ Y1 )
| ~ ( in @ Y2 @ Y0 ) ) ) ) ),
inference(fool_elimination,[status(thm)],[f11]) ).
thf(f11,plain,
( ( ^ [X0: $i,X1: $i] :
( dsetconstr @ ( binunion @ X0 @ X1 )
@ ^ [X2: $i] :
( ~ ( in @ X2 @ X0 )
| ~ ( in @ X2 @ X1 ) ) ) )
= symdiff ),
inference(rectify,[status(thm)],[f3]) ).
thf(f3,axiom,
( ( ^ [X0: $i,X4: $i] :
( dsetconstr @ ( binunion @ X0 @ X4 )
@ ^ [X2: $i] :
( ~ ( in @ X2 @ X0 )
| ~ ( in @ X2 @ X4 ) ) ) )
= symdiff ),
file('/export/starexec/sandbox/tmp/tmp.ElS4XldPWe/DTF2THF_17115.p',symdiff) ).
thf(f24,plain,
( ( in @ sK0 @ ( symdiff @ sK1 @ sK2 ) )
!= $true ),
inference(cnf_transformation,[status(thm)],[f19]) ).
thf(f47,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( ( in @ X2 @ ( binunion @ X3 @ X1 ) )
= $true )
| ( $false
= ( in @ X2 @ X3 ) ) ),
inference(binary_proxy_clausification,[status(thm)],[f46]) ).
thf(f46,plain,
! [X2: $i,X3: $i,X1: $i] :
( $true
= ( ( in @ X2 @ X3 )
=> ( in @ X2 @ ( binunion @ X3 @ X1 ) ) ) ),
inference(beta_eta_normalization,[status(thm)],[f45]) ).
thf(f45,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( ^ [Y0: $i] :
( ( in @ X2 @ Y0 )
=> ( in @ X2 @ ( binunion @ Y0 @ X1 ) ) )
@ X3 )
= $true ),
inference(pi_clausification,[status(thm)],[f44]) ).
thf(f44,plain,
! [X2: $i,X1: $i] :
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ X2 @ Y0 )
=> ( in @ X2 @ ( binunion @ Y0 @ X1 ) ) ) ) ),
inference(beta_eta_normalization,[status(thm)],[f43]) ).
thf(f43,plain,
! [X2: $i,X1: $i] :
( ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y0 @ Y1 )
=> ( in @ Y0 @ ( binunion @ Y1 @ X1 ) ) ) )
@ X2 )
= $true ),
inference(pi_clausification,[status(thm)],[f42]) ).
thf(f42,plain,
! [X1: $i] :
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y0 @ Y1 )
=> ( in @ Y0 @ ( binunion @ Y1 @ X1 ) ) ) ) ) ),
inference(beta_eta_normalization,[status(thm)],[f41]) ).
thf(f41,plain,
! [X1: $i] :
( ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y1 @ Y2 )
=> ( in @ Y1 @ ( binunion @ Y2 @ Y0 ) ) ) ) )
@ X1 )
= $true ),
inference(pi_clausification,[status(thm)],[f28]) ).
thf(f28,plain,
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y1 @ Y2 )
=> ( in @ Y1 @ ( binunion @ Y2 @ Y0 ) ) ) ) ) ) ),
inference(definition_unfolding,[status(thm)],[f26,f21]) ).
thf(f21,plain,
( binunionIL
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y1 @ Y2 )
=> ( in @ Y1 @ ( binunion @ Y2 @ Y0 ) ) ) ) ) ) ),
inference(cnf_transformation,[status(thm)],[f10]) ).
thf(f10,plain,
( binunionIL
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y1 @ Y2 )
=> ( in @ Y1 @ ( binunion @ Y2 @ Y0 ) ) ) ) ) ) ),
inference(fool_elimination,[status(thm)],[f9]) ).
thf(f9,plain,
( binunionIL
= ( ! [X0: $i,X1: $i,X2: $i] :
( ( in @ X1 @ X0 )
=> ( in @ X1 @ ( binunion @ X0 @ X2 ) ) ) ) ),
inference(rectify,[status(thm)],[f2]) ).
thf(f2,axiom,
( binunionIL
= ( ! [X0: $i,X2: $i,X4: $i] :
( ( in @ X2 @ X0 )
=> ( in @ X2 @ ( binunion @ X0 @ X4 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.ElS4XldPWe/DTF2THF_17115.p',binunionIL) ).
thf(f26,plain,
binunionIL = $true,
inference(cnf_transformation,[status(thm)],[f19]) ).
thf(f25,plain,
( ( in @ sK0 @ sK1 )
= $true ),
inference(cnf_transformation,[status(thm)],[f19]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : SEU612^2 : TPTP v9.2.1. Released v3.7.0.
% 0.00/0.10 % Command : /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.11/0.29 % Computer : n003.cluster.edu
% 0.11/0.29 % Model : x86_64 x86_64
% 0.11/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.29 % Memory : 8042.1875MB
% 0.11/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.29 % CPULimit : 300
% 0.11/0.29 % WCLimit : 300
% 0.11/0.29 % DateTime : Tue Feb 24 12:28:40 EST 2026
% 0.11/0.30 % CPUTime :
% 0.11/0.30 Running /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.16/0.39 ---- Original DTF file ---
% 0.16/0.39 thf(spec,logic,$$dhol).
% 0.16/0.39 %------------------------------------------------------------------------------
% 0.16/0.39 % File : SEU612^2 : TPTP v9.2.1. Released v3.7.0.
% 0.16/0.39 % Domain : Set Theory
% 0.16/0.39 % Problem : Preliminary Notions - Operations on Sets - Symmetric Difference
% 0.16/0.39 % Version : Especial > Reduced > Especial.
% 0.16/0.39 % English : (! A:i.! B:i.! x:i.in x A -> ~(in x B) -> in x (symdiff A B))
% 0.16/0.39
% 0.16/0.39 % Refs : [Bro08] Brown (2008), Email to G. Sutcliffe
% 0.16/0.39 % Source : [Bro08]
% 0.16/0.39 % Names : ZFC114l [Bro08]
% 0.16/0.39
% 0.16/0.39 % Status : Theorem
% 0.16/0.39 % Rating : 0.22 v9.1.0, 0.25 v9.0.0, 0.20 v8.2.0, 0.38 v8.1.0, 0.36 v7.5.0, 0.29 v7.4.0, 0.22 v7.2.0, 0.12 v7.1.0, 0.38 v7.0.0, 0.29 v6.4.0, 0.33 v6.3.0, 0.40 v6.2.0, 0.29 v5.5.0, 0.33 v5.4.0, 0.40 v5.3.0, 0.60 v5.2.0, 0.40 v4.1.0, 0.33 v4.0.0, 0.67 v3.7.0
% 0.16/0.39 % Syntax : Number of formulae : 10 ( 3 unt; 6 typ; 3 def)
% 0.16/0.39 % Number of atoms : 16 ( 3 equ; 0 cnn)
% 0.16/0.39 % Maximal formula atoms : 5 ( 4 avg)
% 0.16/0.39 % Number of connectives : 41 ( 3 ~; 1 |; 0 &; 30 @)
% 0.16/0.39 % ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% 0.16/0.39 % Maximal formula depth : 11 ( 4 avg)
% 0.16/0.39 % Number of types : 2 ( 0 usr)
% 0.16/0.39 % Number of type conns : 10 ( 10 >; 0 *; 0 +; 0 <<)
% 0.16/0.39 % Number of symbols : 7 ( 6 usr; 2 con; 0-2 aty)
% 0.16/0.39 % Number of variables : 13 ( 4 ^; 9 !; 0 ?; 13 :)
% 0.16/0.39 % SPC : TH0_THM_EQU_NAR
% 0.16/0.39
% 0.16/0.39 % Comments : http://mathgate.info/detsetitem.php?id=490
% 0.16/0.39 %------------------------------------------------------------------------------
% 0.16/0.39 thf(in_type,type,
% 0.16/0.39 in: $i > $i > $o ).
% 0.16/0.39
% 0.16/0.39 thf(dsetconstr_type,type,
% 0.16/0.39 dsetconstr: $i > ( $i > $o ) > $i ).
% 0.16/0.39
% 0.16/0.39 thf(dsetconstrI_type,type,
% 0.16/0.39 dsetconstrI: $o ).
% 0.16/0.39
% 0.16/0.39 thf(dsetconstrI,definition,
% 0.16/0.39 ( dsetconstrI
% 0.16/0.39 = ( ! [A: $i,Xphi: $i > $o,Xx: $i] :
% 0.16/0.39 ( ( in @ Xx @ A )
% 0.16/0.39 => ( ( Xphi @ Xx )
% 0.16/0.39 => ( in @ Xx
% 0.16/0.39 @ ( dsetconstr @ A
% 0.16/0.39 @ ^ [Xy: $i] : ( Xphi @ Xy ) ) ) ) ) ) ) ).
% 0.16/0.39
% 0.16/0.39 thf(binunion_type,type,
% 0.16/0.39 binunion: $i > $i > $i ).
% 0.16/0.39
% 0.16/0.39 thf(binunionIL_type,type,
% 0.16/0.39 binunionIL: $o ).
% 0.16/0.39
% 0.16/0.39 thf(binunionIL,definition,
% 0.16/0.39 ( binunionIL
% 0.16/0.39 = ( ! [A: $i,B: $i,Xx: $i] :
% 0.16/0.39 ( ( in @ Xx @ A )
% 0.16/0.39 => ( in @ Xx @ ( binunion @ A @ B ) ) ) ) ) ).
% 0.16/0.39
% 0.16/0.39 thf(symdiff_type,type,
% 0.16/0.39 symdiff: $i > $i > $i ).
% 0.16/0.39
% 0.16/0.39 thf(symdiff,definition,
% 0.16/0.39 ( symdiff
% 0.16/0.39 = ( ^ [A: $i,B: $i] :
% 0.16/0.39 ( dsetconstr @ ( binunion @ A @ B )
% 0.16/0.39 @ ^ [Xx: $i] :
% 0.16/0.39 ( ~ ( in @ Xx @ A )
% 0.16/0.39 | ~ ( in @ Xx @ B ) ) ) ) ) ).
% 0.16/0.39
% 0.16/0.39 thf(symdiffI1,conjecture,
% 0.16/0.39 ( dsetconstrI
% 0.16/0.39 => ( binunionIL
% 0.16/0.39 => ! [A: $i,B: $i,Xx: $i] :
% 0.16/0.39 ( ( in @ Xx @ A )
% 0.16/0.39 => ( ~ ( in @ Xx @ B )
% 0.16/0.39 => ( in @ Xx @ ( symdiff @ A @ B ) ) ) ) ) ) ).
% 0.16/0.39
% 0.16/0.39 %------------------------------------------------------------------------------
% 0.16/0.39 ------------------------
% 1.57/1.30 ---- Embedded in THF ---
% 1.57/1.30 %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.57/1.30 %%% Generated on Tue Feb 24 12:28:41 EST 2026
% 1.57/1.30 %%% using '$$dhol' embedding, version 1.3.0.
% 1.57/1.30 %%% Logic specification used:
% 1.57/1.30 %%% thf(spec, logic, $$dhol).
% 1.57/1.30
% 1.57/1.30 % SZS output start ListOfTHF for /export/starexec/sandbox/tmp/tmp.ElS4XldPWe/DTF2DTF17115.p
% See solution above
% 1.57/1.31 ------------------------
% 1.57/1.31 ---- Cleaned THF ---
% 1.57/1.31 thf(in_type,type,
% 1.57/1.31 in: $i > $i > $o ).
% 1.57/1.31
% 1.57/1.31 thf(dsetconstr_type,type,
% 1.57/1.31 dsetconstr: $i > ( $i > $o ) > $i ).
% 1.57/1.31
% 1.57/1.31 thf(dsetconstrI_type,type,
% 1.57/1.31 dsetconstrI: $o ).
% 1.57/1.31
% 1.57/1.31 thf(dsetconstrI,definition,
% 1.57/1.31 ( dsetconstrI
% 1.57/1.31 = ( ! [A: $i,Xphi: $i > $o,Xx: $i] :
% 1.57/1.31 ( ( in @ Xx @ A )
% 1.57/1.31 => ( ( Xphi @ Xx )
% 1.57/1.31 => ( in @ Xx
% 1.57/1.31 @ ( dsetconstr @ A
% 1.57/1.31 @ ^ [Xy: $i] : ( Xphi @ Xy ) ) ) ) ) ) ) ).
% 1.57/1.31
% 1.57/1.31 thf(binunion_type,type,
% 1.57/1.31 binunion: $i > $i > $i ).
% 1.57/1.31
% 1.57/1.31 thf(binunionIL_type,type,
% 1.57/1.31 binunionIL: $o ).
% 1.57/1.31
% 1.57/1.31 thf(binunionIL,definition,
% 1.57/1.31 ( binunionIL
% 1.57/1.31 = ( ! [A: $i,B: $i,Xx: $i] :
% 1.57/1.31 ( ( in @ Xx @ A )
% 1.57/1.31 => ( in @ Xx @ ( binunion @ A @ B ) ) ) ) ) ).
% 1.57/1.31
% 1.57/1.31 thf(symdiff_type,type,
% 1.57/1.31 symdiff: $i > $i > $i ).
% 1.57/1.31
% 1.57/1.31 thf(symdiff,definition,
% 1.57/1.31 ( symdiff
% 1.57/1.31 = ( ^ [A: $i,B: $i] :
% 1.57/1.31 ( dsetconstr @ ( binunion @ A @ B )
% 1.57/1.31 @ ^ [Xx: $i] :
% 1.57/1.31 ( ~ ( in @ Xx @ A )
% 1.57/1.31 | ~ ( in @ Xx @ B ) ) ) ) ) ).
% 1.57/1.31
% 1.57/1.31 thf(symdiffI1,conjecture,
% 1.57/1.31 ( dsetconstrI
% 1.57/1.31 => ( binunionIL
% 1.57/1.31 => ! [A: $i,B: $i,Xx: $i] :
% 1.57/1.31 ( ( in @ Xx @ A )
% 1.57/1.31 => ( ~ ( in @ Xx @ B )
% 1.57/1.31 => ( in @ Xx @ ( symdiff @ A @ B ) ) ) ) ) ) ).
% 1.57/1.31 ------------------------
% 1.57/1.33 % (17214)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_17115 for (2999ds/27Mi)
% 1.57/1.33 % (17212)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on DTF2THF_17115 for (2999ds/183Mi)
% 1.57/1.33 % (17213)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_17115 for (2999ds/4Mi)
% 1.57/1.33 % (17215)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on DTF2THF_17115 for (2999ds/2Mi)
% 1.57/1.33 % (17217)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_17115 for (2999ds/275Mi)
% 1.57/1.33 % (17216)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_17115 for (2999ds/2Mi)
% 1.57/1.33 % (17218)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on DTF2THF_17115 for (2999ds/18Mi)
% 1.57/1.34 % (17215)Instruction limit reached!
% 1.57/1.34 % (17215)------------------------------
% 1.57/1.34 % (17215)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.57/1.34 % (17215)Termination reason: Unknown
% 1.57/1.34 % (17215)Termination phase: Saturation
% 1.57/1.34 % (17216)Instruction limit reached!
% 1.57/1.34 % (17216)------------------------------
% 1.57/1.34 % (17216)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.57/1.34 % (17216)Termination reason: Unknown
% 1.57/1.34 % (17216)Termination phase: Saturation
% 1.57/1.34
% 1.57/1.34 % (17216)Memory used [KB]: 5500
% 1.57/1.34 % (17216)Time elapsed: 0.003 s
% 1.57/1.34 % (17216)Instructions burned: 3 (million)
% 1.57/1.34 % (17216)------------------------------
% 1.57/1.34 % (17216)------------------------------
% 1.57/1.34
% 1.57/1.34 % (17215)Memory used [KB]: 5500
% 1.57/1.34 % (17215)Time elapsed: 0.003 s
% 1.57/1.34 % (17215)Instructions burned: 3 (million)
% 1.57/1.34 % (17215)------------------------------
% 1.57/1.34 % (17215)------------------------------
% 1.57/1.34 % (17213)Instruction limit reached!
% 1.57/1.34 % (17213)------------------------------
% 1.57/1.34 % (17213)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.57/1.34 % (17213)Termination reason: Unknown
% 1.57/1.34 % (17213)Termination phase: Saturation
% 1.57/1.34
% 1.57/1.34 % (17213)Memory used [KB]: 5500
% 1.57/1.34 % (17213)Time elapsed: 0.004 s
% 1.57/1.34 % (17213)Instructions burned: 4 (million)
% 1.57/1.34 % (17213)------------------------------
% 1.57/1.34 % (17213)------------------------------
% 1.57/1.34 % (17217)Refutation not found, incomplete strategy
% 1.57/1.34 % (17217)------------------------------
% 1.57/1.34 % (17217)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.57/1.34 % (17217)Termination reason: Refutation not found, incomplete strategy
% 1.57/1.34
% 1.57/1.34
% 1.57/1.34 % (17217)Memory used [KB]: 5500
% 1.57/1.34 % (17217)Time elapsed: 0.004 s
% 1.57/1.34 % (17217)Instructions burned: 3 (million)
% 1.57/1.34 % (17217)------------------------------
% 1.57/1.34 % (17217)------------------------------
% 1.57/1.34 % (17212)First to succeed.
% 1.57/1.34 % (17214)Also succeeded, but the first one will report.
% 1.57/1.34 % (17212)Refutation found. Thanks to Tanya!
% 1.57/1.34 % SZS status Theorem for DTF2THF_17115
% 1.57/1.34 % SZS output start Proof for DTF2THF_17115
% 1.57/1.34 thf(func_def_0, type, in: $i > $i > $o).
% 1.57/1.34 thf(func_def_1, type, dsetconstr: $i > ($i > $o) > $i).
% 1.57/1.34 thf(func_def_4, type, binunion: $i > $i > $i).
% 1.57/1.34 thf(func_def_6, type, symdiff: $i > $i > $i).
% 1.57/1.34 thf(func_def_21, type, ph4: !>[X0: $tType]:(X0)).
% 1.57/1.34 thf(f64,plain,(
% 1.57/1.34 $false),
% 1.57/1.34 inference(trivial_inequality_removal,[status(thm)],[f63])).
% 1.57/1.34 thf(f63,plain,(
% 1.57/1.34 ($false = $true)),
% 1.57/1.34 inference(superposition,[status(thm)],[f25,f61])).
% 1.57/1.34 thf(f61,plain,(
% 1.57/1.34 ((in @ sK0 @ sK1) = $false)),
% 1.57/1.34 inference(trivial_inequality_removal,[status(thm)],[f59])).
% 1.57/1.34 thf(f59,plain,(
% 1.57/1.34 ((in @ sK0 @ sK1) = $false) | ($false = $true)),
% 1.57/1.34 inference(superposition,[status(thm)],[f47,f57])).
% 1.57/1.34 thf(f57,plain,(
% 1.57/1.34 ((in @ sK0 @ (binunion @ sK1 @ sK2)) = $false)),
% 1.57/1.34 inference(subsumption_resolution,[status(thm)],[f55,f23])).
% 1.57/1.34 thf(f23,plain,(
% 1.57/1.34 ($true != (in @ sK0 @ sK2))),
% 1.57/1.34 inference(cnf_transformation,[status(thm)],[f19])).
% 1.57/1.34 thf(f19,plain,(
% 1.57/1.34 (binunionIL = $true) & (((in @ sK0 @ sK1) = $true) & ((in @ sK0 @ (symdiff @ sK1 @ sK2)) != $true) & ($true != (in @ sK0 @ sK2))) & (dsetconstrI = $true)),
% 1.57/1.34 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f17,f18])).
% 1.57/1.34 thf(f18,plain,(
% 1.57/1.34 ? [X0 : $i,X1 : $i,X2 : $i] : (((in @ X0 @ X1) = $true) & ((in @ X0 @ (symdiff @ X1 @ X2)) != $true) & ((in @ X0 @ X2) != $true)) => (((in @ sK0 @ sK1) = $true) & ((in @ sK0 @ (symdiff @ sK1 @ sK2)) != $true) & ($true != (in @ sK0 @ sK2)))),
% 1.57/1.34 introduced(definition,[],[choice_axiom])).
% 1.57/1.34 thf(f17,plain,(
% 1.57/1.34 (binunionIL = $true) & ? [X0 : $i,X1 : $i,X2 : $i] : (((in @ X0 @ X1) = $true) & ((in @ X0 @ (symdiff @ X1 @ X2)) != $true) & ((in @ X0 @ X2) != $true)) & (dsetconstrI = $true)),
% 1.57/1.34 inference(flattening,[status(thm)],[f16])).
% 1.57/1.34 thf(f16,plain,(
% 1.57/1.34 (? [X0 : $i,X1 : $i,X2 : $i] : ((((in @ X0 @ (symdiff @ X1 @ X2)) != $true) & ((in @ X0 @ X2) != $true)) & ((in @ X0 @ X1) = $true)) & (binunionIL = $true)) & (dsetconstrI = $true)),
% 1.57/1.34 inference(ennf_transformation,[status(thm)],[f15])).
% 1.57/1.34 thf(f15,plain,(
% 1.57/1.34 ~((dsetconstrI = $true) => ((binunionIL = $true) => ! [X0 : $i,X1 : $i,X2 : $i] : (((in @ X0 @ X1) = $true) => (((in @ X0 @ X2) != $true) => ((in @ X0 @ (symdiff @ X1 @ X2)) = $true)))))),
% 1.57/1.34 inference(flattening,[status(thm)],[f14])).
% 1.57/1.34 thf(f14,plain,(
% 1.57/1.34 ~((dsetconstrI = $true) => ((binunionIL = $true) => ! [X0 : $i,X1 : $i,X2 : $i] : (((in @ X0 @ X1) = $true) => (~((in @ X0 @ X2) = $true) => ((in @ X0 @ (symdiff @ X1 @ X2)) = $true)))))),
% 1.57/1.34 inference(fool_elimination,[status(thm)],[f13])).
% 1.57/1.34 thf(f13,plain,(
% 1.57/1.34 ~(dsetconstrI => (binunionIL => ! [X0 : $i,X1 : $i,X2 : $i] : ((in @ X0 @ X1) => (~(in @ X0 @ X2) => (in @ X0 @ (symdiff @ X1 @ X2))))))),
% 1.57/1.34 inference(rectify,[status(thm)],[f5])).
% 1.57/1.34 thf(f5,negated_conjecture,(
% 1.57/1.34 ~(dsetconstrI => (binunionIL => ! [X2 : $i,X0 : $i,X4 : $i] : ((in @ X2 @ X0) => (~(in @ X2 @ X4) => (in @ X2 @ (symdiff @ X0 @ X4))))))),
% 1.57/1.34 inference(negated_conjecture,[status(cth)],[f4])).
% 1.57/1.34 thf(f4,conjecture,(
% 1.57/1.34 dsetconstrI => (binunionIL => ! [X2 : $i,X0 : $i,X4 : $i] : ((in @ X2 @ X0) => (~(in @ X2 @ X4) => (in @ X2 @ (symdiff @ X0 @ X4)))))),
% 1.57/1.34 file('/export/starexec/sandbox/tmp/tmp.ElS4XldPWe/DTF2THF_17115.p',symdiffI1)).
% 1.57/1.34 thf(f55,plain,(
% 1.57/1.34 ((in @ sK0 @ (binunion @ sK1 @ sK2)) = $false) | ($true = (in @ sK0 @ sK2))),
% 1.57/1.34 inference(not_proxy_clausification,[status(thm)],[f54])).
% 1.57/1.34 thf(f54,plain,(
% 1.57/1.34 ((in @ sK0 @ (binunion @ sK1 @ sK2)) = $false) | ((~ (in @ sK0 @ sK2)) = $false)),
% 1.57/1.34 inference(binary_proxy_clausification,[status(thm)],[f52])).
% 1.57/1.34 thf(f52,plain,(
% 1.57/1.34 ($false = ((~ (in @ sK0 @ sK2)) | (~ (in @ sK0 @ sK1)))) | ((in @ sK0 @ (binunion @ sK1 @ sK2)) = $false)),
% 1.57/1.34 inference(beta_eta_normalization,[status(thm)],[f51])).
% 1.57/1.34 thf(f51,plain,(
% 1.57/1.34 (((^[Y0 : $i]: ((~ (in @ Y0 @ sK2)) | (~ (in @ Y0 @ sK1)))) @ sK0) = $false) | ((in @ sK0 @ (binunion @ sK1 @ sK2)) = $false)),
% 1.57/1.34 inference(trivial_inequality_removal,[status(thm)],[f50])).
% 1.57/1.34 thf(f50,plain,(
% 1.57/1.34 (((^[Y0 : $i]: ((~ (in @ Y0 @ sK2)) | (~ (in @ Y0 @ sK1)))) @ sK0) = $false) | ($true != $true) | ((in @ sK0 @ (binunion @ sK1 @ sK2)) = $false)),
% 1.57/1.34 inference(superposition,[status(thm)],[f31,f40])).
% 1.57/1.34 thf(f40,plain,(
% 1.57/1.34 ( ! [X2 : $i,X3 : $i > $o,X1 : $i] : (((in @ X1 @ (dsetconstr @ X2 @ X3)) = $true) | ($false = (in @ X1 @ X2)) | ($false = (X3 @ X1))) )),
% 1.57/1.34 inference(binary_proxy_clausification,[status(thm)],[f39])).
% 1.57/1.34 thf(f39,plain,(
% 1.57/1.34 ( ! [X2 : $i,X3 : $i > $o,X1 : $i] : ((((X3 @ X1) => (in @ X1 @ (dsetconstr @ X2 @ X3))) = $true) | ($false = (in @ X1 @ X2))) )),
% 1.57/1.34 inference(binary_proxy_clausification,[status(thm)],[f38])).
% 1.57/1.34 thf(f38,plain,(
% 1.57/1.34 ( ! [X2 : $i,X3 : $i > $o,X1 : $i] : ((((in @ X1 @ X2) => ((X3 @ X1) => (in @ X1 @ (dsetconstr @ X2 @ X3)))) = $true)) )),
% 1.57/1.34 inference(beta_eta_normalization,[status(thm)],[f37])).
% 1.57/1.34 thf(f37,plain,(
% 1.57/1.34 ( ! [X2 : $i,X3 : $i > $o,X1 : $i] : (($true = ((^[Y0 : $i > $o]: ((in @ X1 @ X2) => ((Y0 @ X1) => (in @ X1 @ (dsetconstr @ X2 @ Y0))))) @ X3))) )),
% 1.57/1.34 inference(pi_clausification,[status(thm)],[f36])).
% 1.57/1.34 thf(f36,plain,(
% 1.57/1.34 ( ! [X2 : $i,X1 : $i] : (((!! @ ($i > $o) @ (^[Y0 : $i > $o]: ((in @ X1 @ X2) => ((Y0 @ X1) => (in @ X1 @ (dsetconstr @ X2 @ Y0)))))) = $true)) )),
% 1.57/1.34 inference(beta_eta_normalization,[status(thm)],[f35])).
% 1.57/1.34 thf(f35,plain,(
% 1.57/1.34 ( ! [X2 : $i,X1 : $i] : (($true = ((^[Y0 : $i]: (!! @ ($i > $o) @ (^[Y1 : $i > $o]: ((in @ X1 @ Y0) => ((Y1 @ X1) => (in @ X1 @ (dsetconstr @ Y0 @ Y1))))))) @ X2))) )),
% 1.57/1.34 inference(pi_clausification,[status(thm)],[f34])).
% 1.57/1.34 thf(f34,plain,(
% 1.57/1.34 ( ! [X1 : $i] : (((!! @ $i @ (^[Y0 : $i]: (!! @ ($i > $o) @ (^[Y1 : $i > $o]: ((in @ X1 @ Y0) => ((Y1 @ X1) => (in @ X1 @ (dsetconstr @ Y0 @ Y1)))))))) = $true)) )),
% 1.57/1.34 inference(beta_eta_normalization,[status(thm)],[f33])).
% 1.57/1.34 thf(f33,plain,(
% 1.57/1.34 ( ! [X1 : $i] : ((((^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ ($i > $o) @ (^[Y2 : $i > $o]: ((in @ Y0 @ Y1) => ((Y2 @ Y0) => (in @ Y0 @ (dsetconstr @ Y1 @ Y2))))))))) @ X1) = $true)) )),
% 1.57/1.34 inference(pi_clausification,[status(thm)],[f32])).
% 1.57/1.34 thf(f32,plain,(
% 1.57/1.34 ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ ($i > $o) @ (^[Y2 : $i > $o]: ((in @ Y0 @ Y1) => ((Y2 @ Y0) => (in @ Y0 @ (dsetconstr @ Y1 @ Y2)))))))))) = $true)),
% 1.57/1.34 inference(beta_eta_normalization,[status(thm)],[f30])).
% 1.57/1.34 thf(f30,plain,(
% 1.57/1.34 ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ ($i > $o) @ (^[Y2 : $i > $o]: ((in @ Y0 @ Y1) => ((Y2 @ Y0) => (in @ Y0 @ (dsetconstr @ Y1 @ (^[Y3 : $i]: (Y2 @ Y3)))))))))))) = $true)),
% 1.57/1.34 inference(definition_unfolding,[status(thm)],[f27,f22])).
% 1.57/1.34 thf(f22,plain,(
% 1.57/1.34 (dsetconstrI = $true)),
% 1.57/1.34 inference(cnf_transformation,[status(thm)],[f19])).
% 1.57/1.34 thf(f27,plain,(
% 1.57/1.34 (dsetconstrI = (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ ($i > $o) @ (^[Y2 : $i > $o]: ((in @ Y0 @ Y1) => ((Y2 @ Y0) => (in @ Y0 @ (dsetconstr @ Y1 @ (^[Y3 : $i]: (Y2 @ Y3)))))))))))))),
% 1.57/1.34 inference(cnf_transformation,[status(thm)],[f8])).
% 1.57/1.34 thf(f8,plain,(
% 1.57/1.34 (dsetconstrI = (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ ($i > $o) @ (^[Y2 : $i > $o]: ((in @ Y0 @ Y1) => ((Y2 @ Y0) => (in @ Y0 @ (dsetconstr @ Y1 @ (^[Y3 : $i]: (Y2 @ Y3)))))))))))))),
% 1.57/1.34 inference(fool_elimination,[status(thm)],[f7])).
% 1.57/1.34 thf(f7,plain,(
% 1.57/1.34 (dsetconstrI = ! [X0 : $i > $o,X1 : $i,X2 : $i] : ((in @ X2 @ X1) => ((X0 @ X2) => (in @ X2 @ (dsetconstr @ X1 @ (^[X3 : $i] : (X0 @ X3)))))))),
% 1.57/1.34 inference(rectify,[status(thm)],[f1])).
% 1.57/1.34 thf(f1,axiom,(
% 1.57/1.34 (dsetconstrI = ! [X1 : $i > $o,X0 : $i,X2 : $i] : ((in @ X2 @ X0) => ((X1 @ X2) => (in @ X2 @ (dsetconstr @ X0 @ (^[X3 : $i] : (X1 @ X3)))))))),
% 1.57/1.34 file('/export/starexec/sandbox/tmp/tmp.ElS4XldPWe/DTF2THF_17115.p',dsetconstrI)).
% 1.57/1.34 thf(f31,plain,(
% 1.57/1.34 ((in @ sK0 @ (dsetconstr @ (binunion @ sK1 @ sK2) @ (^[Y0 : $i]: ((~ (in @ Y0 @ sK2)) | (~ (in @ Y0 @ sK1)))))) != $true)),
% 1.57/1.34 inference(beta_eta_normalization,[status(thm)],[f29])).
% 1.57/1.34 thf(f29,plain,(
% 1.57/1.34 ((in @ sK0 @ ((^[Y0 : $i]: ((^[Y1 : $i]: (dsetconstr @ (binunion @ Y0 @ Y1) @ (^[Y2 : $i]: ((~ (in @ Y2 @ Y1)) | (~ (in @ Y2 @ Y0)))))))) @ sK1 @ sK2)) != $true)),
% 1.57/1.34 inference(definition_unfolding,[status(thm)],[f24,f20])).
% 1.57/1.34 thf(f20,plain,(
% 1.57/1.34 (symdiff = (^[Y0 : $i]: ((^[Y1 : $i]: (dsetconstr @ (binunion @ Y0 @ Y1) @ (^[Y2 : $i]: ((~ (in @ Y2 @ Y1)) | (~ (in @ Y2 @ Y0)))))))))),
% 1.57/1.34 inference(cnf_transformation,[status(thm)],[f12])).
% 1.57/1.34 thf(f12,plain,(
% 1.57/1.34 (symdiff = (^[Y0 : $i]: ((^[Y1 : $i]: (dsetconstr @ (binunion @ Y0 @ Y1) @ (^[Y2 : $i]: ((~ (in @ Y2 @ Y1)) | (~ (in @ Y2 @ Y0)))))))))),
% 1.57/1.34 inference(fool_elimination,[status(thm)],[f11])).
% 1.57/1.34 thf(f11,plain,(
% 1.57/1.34 ((^[X0 : $i, X1 : $i] : (dsetconstr @ (binunion @ X0 @ X1) @ (^[X2 : $i] : (~(in @ X2 @ X0) | ~(in @ X2 @ X1))))) = symdiff)),
% 1.57/1.34 inference(rectify,[status(thm)],[f3])).
% 1.57/1.34 thf(f3,axiom,(
% 1.57/1.34 ((^[X0 : $i, X4 : $i] : (dsetconstr @ (binunion @ X0 @ X4) @ (^[X2 : $i] : (~(in @ X2 @ X0) | ~(in @ X2 @ X4))))) = symdiff)),
% 1.57/1.34 file('/export/starexec/sandbox/tmp/tmp.ElS4XldPWe/DTF2THF_17115.p',symdiff)).
% 1.57/1.34 thf(f24,plain,(
% 1.57/1.34 ((in @ sK0 @ (symdiff @ sK1 @ sK2)) != $true)),
% 1.57/1.34 inference(cnf_transformation,[status(thm)],[f19])).
% 1.57/1.34 thf(f47,plain,(
% 1.57/1.34 ( ! [X2 : $i,X3 : $i,X1 : $i] : (((in @ X2 @ (binunion @ X3 @ X1)) = $true) | ($false = (in @ X2 @ X3))) )),
% 1.57/1.34 inference(binary_proxy_clausification,[status(thm)],[f46])).
% 1.57/1.34 thf(f46,plain,(
% 1.57/1.34 ( ! [X2 : $i,X3 : $i,X1 : $i] : (($true = ((in @ X2 @ X3) => (in @ X2 @ (binunion @ X3 @ X1))))) )),
% 1.57/1.34 inference(beta_eta_normalization,[status(thm)],[f45])).
% 1.57/1.34 thf(f45,plain,(
% 1.57/1.34 ( ! [X2 : $i,X3 : $i,X1 : $i] : ((((^[Y0 : $i]: ((in @ X2 @ Y0) => (in @ X2 @ (binunion @ Y0 @ X1)))) @ X3) = $true)) )),
% 1.57/1.34 inference(pi_clausification,[status(thm)],[f44])).
% 1.57/1.34 thf(f44,plain,(
% 1.57/1.34 ( ! [X2 : $i,X1 : $i] : (($true = (!! @ $i @ (^[Y0 : $i]: ((in @ X2 @ Y0) => (in @ X2 @ (binunion @ Y0 @ X1))))))) )),
% 1.57/1.34 inference(beta_eta_normalization,[status(thm)],[f43])).
% 1.57/1.34 thf(f43,plain,(
% 1.57/1.34 ( ! [X2 : $i,X1 : $i] : ((((^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((in @ Y0 @ Y1) => (in @ Y0 @ (binunion @ Y1 @ X1)))))) @ X2) = $true)) )),
% 1.57/1.34 inference(pi_clausification,[status(thm)],[f42])).
% 1.57/1.34 thf(f42,plain,(
% 1.57/1.34 ( ! [X1 : $i] : (($true = (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((in @ Y0 @ Y1) => (in @ Y0 @ (binunion @ Y1 @ X1))))))))) )),
% 1.57/1.34 inference(beta_eta_normalization,[status(thm)],[f41])).
% 1.57/1.34 thf(f41,plain,(
% 1.57/1.34 ( ! [X1 : $i] : ((((^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y1 @ Y2) => (in @ Y1 @ (binunion @ Y2 @ Y0)))))))) @ X1) = $true)) )),
% 1.57/1.34 inference(pi_clausification,[status(thm)],[f28])).
% 1.57/1.34 thf(f28,plain,(
% 1.57/1.34 ($true = (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y1 @ Y2) => (in @ Y1 @ (binunion @ Y2 @ Y0))))))))))),
% 1.57/1.34 inference(definition_unfolding,[status(thm)],[f26,f21])).
% 1.57/1.34 thf(f21,plain,(
% 1.57/1.34 (binunionIL = (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y1 @ Y2) => (in @ Y1 @ (binunion @ Y2 @ Y0))))))))))),
% 1.57/1.34 inference(cnf_transformation,[status(thm)],[f10])).
% 1.57/1.34 thf(f10,plain,(
% 1.57/1.34 (binunionIL = (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y1 @ Y2) => (in @ Y1 @ (binunion @ Y2 @ Y0))))))))))),
% 1.57/1.34 inference(fool_elimination,[status(thm)],[f9])).
% 1.57/1.34 thf(f9,plain,(
% 1.57/1.34 (binunionIL = ! [X0 : $i,X1 : $i,X2 : $i] : ((in @ X1 @ X0) => (in @ X1 @ (binunion @ X0 @ X2))))),
% 1.57/1.34 inference(rectify,[status(thm)],[f2])).
% 1.57/1.34 thf(f2,axiom,(
% 1.57/1.34 (binunionIL = ! [X0 : $i,X2 : $i,X4 : $i] : ((in @ X2 @ X0) => (in @ X2 @ (binunion @ X0 @ X4))))),
% 1.57/1.34 file('/export/starexec/sandbox/tmp/tmp.ElS4XldPWe/DTF2THF_17115.p',binunionIL)).
% 1.57/1.34 thf(f26,plain,(
% 1.57/1.34 (binunionIL = $true)),
% 1.57/1.34 inference(cnf_transformation,[status(thm)],[f19])).
% 1.57/1.34 thf(f25,plain,(
% 1.57/1.34 ((in @ sK0 @ sK1) = $true)),
% 1.57/1.34 inference(cnf_transformation,[status(thm)],[f19])).
% 1.57/1.34 % SZS output end Proof for DTF2THF_17115
% 1.57/1.34 % (17212)------------------------------
% 1.57/1.34 % (17212)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.57/1.34 % (17212)Termination reason: Refutation
% 1.57/1.34
% 1.57/1.34 % (17212)Memory used [KB]: 5500
% 1.57/1.34 % (17212)Time elapsed: 0.007 s
% 1.57/1.34 % (17212)Instructions burned: 6 (million)
% 1.57/1.34 % (17212)------------------------------
% 1.57/1.34 % (17212)------------------------------
% 1.57/1.34 % (17211)Success in time 0.02 s
%------------------------------------------------------------------------------