%------------------------------------------------------------------------------
% File : DT2H2X---1.9.5
% Problem : SEU648^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 : n023.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:56 AM UTC 2026
% Result : Theorem 1.68s 1.40s
% Output : Refutation 1.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 4
% Syntax : Number of formulae : 34 ( 23 unt; 0 typ; 0 def)
% Number of atoms : 287 ( 78 equ; 0 cnn)
% Maximal formula atoms : 4 ( 8 avg)
% Number of connectives : 568 ( 10 ~; 4 |; 6 &; 502 @)
% ( 0 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 12 ( 8 usr; 9 con; 0-2 aty)
% ( 24 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 104 ( 38 ^; 58 !; 8 ?; 104 :)
% Comments :
%------------------------------------------------------------------------------
thf(func_def_1,type,
setadjoin: $i > $i > $i ).
thf(func_def_2,type,
kpair: $i > $i > $i ).
thf(f50,plain,
$false,
inference(subsumption_resolution,[status(thm)],[f40,f15]) ).
thf(f15,plain,
sK0 != sK3,
inference(cnf_transformation,[status(thm)],[f13]) ).
thf(f13,plain,
( ( ( kpair @ sK0 @ sK1 )
= ( kpair @ sK3 @ sK2 ) )
& ( sK0 != sK3 )
& ( setukpairinjL2 = $true ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f11,f12]) ).
thf(f12,plain,
( ? [X0: $i,X1: $i,X2: $i,X3: $i] :
( ( ( kpair @ X0 @ X1 )
= ( kpair @ X3 @ X2 ) )
& ( X0 != X3 ) )
=> ( ( ( kpair @ sK0 @ sK1 )
= ( kpair @ sK3 @ sK2 ) )
& ( sK0 != sK3 ) ) ),
introduced(definition,[],[choice_axiom]) ).
thf(f11,plain,
( ? [X0: $i,X1: $i,X2: $i,X3: $i] :
( ( ( kpair @ X0 @ X1 )
= ( kpair @ X3 @ X2 ) )
& ( X0 != X3 ) )
& ( setukpairinjL2 = $true ) ),
inference(ennf_transformation,[status(thm)],[f7]) ).
thf(f7,plain,
~ ( ( setukpairinjL2 = $true )
=> ! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ( ( kpair @ X0 @ X1 )
= ( kpair @ X3 @ X2 ) )
=> ( X0 = X3 ) ) ),
inference(fool_elimination,[status(thm)],[f6]) ).
thf(f6,plain,
~ ( setukpairinjL2
=> ! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ( ( kpair @ X0 @ X1 )
= ( kpair @ X3 @ X2 ) )
=> ( X0 = X3 ) ) ),
inference(rectify,[status(thm)],[f4]) ).
thf(f4,negated_conjecture,
~ ( setukpairinjL2
=> ! [X0: $i,X1: $i,X3: $i,X2: $i] :
( ( ( kpair @ X0 @ X1 )
= ( kpair @ X2 @ X3 ) )
=> ( X0 = X2 ) ) ),
inference(negated_conjecture,[status(cth)],[f3]) ).
thf(f3,conjecture,
( setukpairinjL2
=> ! [X0: $i,X1: $i,X3: $i,X2: $i] :
( ( ( kpair @ X0 @ X1 )
= ( kpair @ X2 @ X3 ) )
=> ( X0 = X2 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.wIoR7omPWm/DTF2THF_32438.p',setukpairinjL) ).
thf(f40,plain,
sK0 = sK3,
inference(equality_resolution,[status(thm)],[f34]) ).
thf(f34,plain,
! [X0: $i,X1: $i] :
( ( ( setadjoin @ ( setadjoin @ X0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X0 @ ( setadjoin @ X1 @ emptyset ) ) @ emptyset ) )
!= ( setadjoin @ ( setadjoin @ sK0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ sK0 @ ( setadjoin @ sK1 @ emptyset ) ) @ emptyset ) ) )
| ( sK3 = X0 ) ),
inference(superposition,[status(thm)],[f32,f21]) ).
thf(f21,plain,
( ( setadjoin @ ( setadjoin @ sK3 @ emptyset ) @ ( setadjoin @ ( setadjoin @ sK3 @ ( setadjoin @ sK2 @ emptyset ) ) @ emptyset ) )
= ( setadjoin @ ( setadjoin @ sK0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ sK0 @ ( setadjoin @ sK1 @ emptyset ) ) @ emptyset ) ) ),
inference(beta_eta_normalization,[status(thm)],[f19]) ).
thf(f19,plain,
( ( ^ [Y0: $i,Y1: $i] : ( setadjoin @ ( setadjoin @ Y0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ Y0 @ ( setadjoin @ Y1 @ emptyset ) ) @ emptyset ) )
@ sK3
@ sK2 )
= ( ^ [Y0: $i,Y1: $i] : ( setadjoin @ ( setadjoin @ Y0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ Y0 @ ( setadjoin @ Y1 @ emptyset ) ) @ emptyset ) )
@ sK0
@ sK1 ) ),
inference(definition_unfolding,[status(thm)],[f16,f18,f18]) ).
thf(f18,plain,
( kpair
= ( ^ [Y0: $i,Y1: $i] : ( setadjoin @ ( setadjoin @ Y0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ Y0 @ ( setadjoin @ Y1 @ emptyset ) ) @ emptyset ) ) ) ),
inference(cnf_transformation,[status(thm)],[f10]) ).
thf(f10,plain,
( kpair
= ( ^ [Y0: $i,Y1: $i] : ( setadjoin @ ( setadjoin @ Y0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ Y0 @ ( setadjoin @ Y1 @ emptyset ) ) @ emptyset ) ) ) ),
inference(fool_elimination,[status(thm)],[f1]) ).
thf(f1,axiom,
( ( ^ [X0: $i,X1: $i] : ( setadjoin @ ( setadjoin @ X0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X0 @ ( setadjoin @ X1 @ emptyset ) ) @ emptyset ) ) )
= kpair ),
file('/export/starexec/sandbox/tmp/tmp.wIoR7omPWm/DTF2THF_32438.p',kpair) ).
thf(f16,plain,
( ( kpair @ sK0 @ sK1 )
= ( kpair @ sK3 @ sK2 ) ),
inference(cnf_transformation,[status(thm)],[f13]) ).
thf(f32,plain,
! [X2: $i,X3: $i,X1: $i,X4: $i] :
( ( ( setadjoin @ ( setadjoin @ X2 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X2 @ ( setadjoin @ X3 @ emptyset ) ) @ emptyset ) )
!= ( setadjoin @ ( setadjoin @ X4 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X4 @ ( setadjoin @ X1 @ emptyset ) ) @ emptyset ) ) )
| ( X2 = X4 ) ),
inference(equality_proxy_clausification,[status(thm)],[f31]) ).
thf(f31,plain,
! [X2: $i,X3: $i,X1: $i,X4: $i] :
( ( X2 = X4 )
| ( ( ( setadjoin @ ( setadjoin @ X2 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X2 @ ( setadjoin @ X3 @ emptyset ) ) @ emptyset ) )
= ( setadjoin @ ( setadjoin @ X4 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X4 @ ( setadjoin @ X1 @ emptyset ) ) @ emptyset ) ) )
= $false ) ),
inference(equality_proxy_clausification,[status(thm)],[f30]) ).
thf(f30,plain,
! [X2: $i,X3: $i,X1: $i,X4: $i] :
( ( ( X4 = X2 )
= $true )
| ( ( ( setadjoin @ ( setadjoin @ X2 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X2 @ ( setadjoin @ X3 @ emptyset ) ) @ emptyset ) )
= ( setadjoin @ ( setadjoin @ X4 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X4 @ ( setadjoin @ X1 @ emptyset ) ) @ emptyset ) ) )
= $false ) ),
inference(binary_proxy_clausification,[status(thm)],[f29]) ).
thf(f29,plain,
! [X2: $i,X3: $i,X1: $i,X4: $i] :
( ( ( ( setadjoin @ ( setadjoin @ X2 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X2 @ ( setadjoin @ X3 @ emptyset ) ) @ emptyset ) )
= ( setadjoin @ ( setadjoin @ X4 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X4 @ ( setadjoin @ X1 @ emptyset ) ) @ emptyset ) ) )
=> ( X4 = X2 ) )
= $true ),
inference(beta_eta_normalization,[status(thm)],[f28]) ).
thf(f28,plain,
! [X2: $i,X3: $i,X1: $i,X4: $i] :
( ( ^ [Y0: $i] :
( ( ( setadjoin @ ( setadjoin @ X2 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X2 @ ( setadjoin @ X3 @ emptyset ) ) @ emptyset ) )
= ( setadjoin @ ( setadjoin @ Y0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ Y0 @ ( setadjoin @ X1 @ emptyset ) ) @ emptyset ) ) )
=> ( Y0 = X2 ) )
@ X4 )
= $true ),
inference(pi_clausification,[status(thm)],[f27]) ).
thf(f27,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( !! @ $i
@ ^ [Y0: $i] :
( ( ( setadjoin @ ( setadjoin @ X2 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X2 @ ( setadjoin @ X3 @ emptyset ) ) @ emptyset ) )
= ( setadjoin @ ( setadjoin @ Y0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ Y0 @ ( setadjoin @ X1 @ emptyset ) ) @ emptyset ) ) )
=> ( Y0 = X2 ) ) )
= $true ),
inference(beta_eta_normalization,[status(thm)],[f26]) ).
thf(f26,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( ( setadjoin @ ( setadjoin @ X2 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X2 @ ( setadjoin @ Y0 @ emptyset ) ) @ emptyset ) )
= ( setadjoin @ ( setadjoin @ Y1 @ emptyset ) @ ( setadjoin @ ( setadjoin @ Y1 @ ( setadjoin @ X1 @ emptyset ) ) @ emptyset ) ) )
=> ( Y1 = X2 ) ) )
@ X3 )
= $true ),
inference(pi_clausification,[status(thm)],[f25]) ).
thf(f25,plain,
! [X2: $i,X1: $i] :
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( ( setadjoin @ ( setadjoin @ X2 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X2 @ ( setadjoin @ Y0 @ emptyset ) ) @ emptyset ) )
= ( setadjoin @ ( setadjoin @ Y1 @ emptyset ) @ ( setadjoin @ ( setadjoin @ Y1 @ ( setadjoin @ X1 @ emptyset ) ) @ emptyset ) ) )
=> ( Y1 = X2 ) ) ) )
= $true ),
inference(beta_eta_normalization,[status(thm)],[f24]) ).
thf(f24,plain,
! [X2: $i,X1: $i] :
( ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( ( setadjoin @ ( setadjoin @ Y0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ Y0 @ ( setadjoin @ Y1 @ emptyset ) ) @ emptyset ) )
= ( setadjoin @ ( setadjoin @ Y2 @ emptyset ) @ ( setadjoin @ ( setadjoin @ Y2 @ ( setadjoin @ X1 @ emptyset ) ) @ emptyset ) ) )
=> ( Y2 = Y0 ) ) ) )
@ X2 )
= $true ),
inference(pi_clausification,[status(thm)],[f23]) ).
thf(f23,plain,
! [X1: $i] :
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( ( setadjoin @ ( setadjoin @ Y0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ Y0 @ ( setadjoin @ Y1 @ emptyset ) ) @ emptyset ) )
= ( setadjoin @ ( setadjoin @ Y2 @ emptyset ) @ ( setadjoin @ ( setadjoin @ Y2 @ ( setadjoin @ X1 @ emptyset ) ) @ emptyset ) ) )
=> ( Y2 = Y0 ) ) ) ) )
= $true ),
inference(beta_eta_normalization,[status(thm)],[f22]) ).
thf(f22,plain,
! [X1: $i] :
( ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( !! @ $i
@ ^ [Y3: $i] :
( ( ( setadjoin @ ( setadjoin @ Y1 @ emptyset ) @ ( setadjoin @ ( setadjoin @ Y1 @ ( setadjoin @ Y2 @ emptyset ) ) @ emptyset ) )
= ( setadjoin @ ( setadjoin @ Y3 @ emptyset ) @ ( setadjoin @ ( setadjoin @ Y3 @ ( setadjoin @ Y0 @ emptyset ) ) @ emptyset ) ) )
=> ( Y3 = Y1 ) ) ) ) )
@ X1 )
= $true ),
inference(pi_clausification,[status(thm)],[f20]) ).
thf(f20,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( !! @ $i
@ ^ [Y3: $i] :
( ( ( setadjoin @ ( setadjoin @ Y1 @ emptyset ) @ ( setadjoin @ ( setadjoin @ Y1 @ ( setadjoin @ Y2 @ emptyset ) ) @ emptyset ) )
= ( setadjoin @ ( setadjoin @ Y3 @ emptyset ) @ ( setadjoin @ ( setadjoin @ Y3 @ ( setadjoin @ Y0 @ emptyset ) ) @ emptyset ) ) )
=> ( Y3 = Y1 ) ) ) ) ) )
= $true ),
inference(definition_unfolding,[status(thm)],[f17,f14]) ).
thf(f14,plain,
setukpairinjL2 = $true,
inference(cnf_transformation,[status(thm)],[f13]) ).
thf(f17,plain,
( setukpairinjL2
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( !! @ $i
@ ^ [Y3: $i] :
( ( ( setadjoin @ ( setadjoin @ Y1 @ emptyset ) @ ( setadjoin @ ( setadjoin @ Y1 @ ( setadjoin @ Y2 @ emptyset ) ) @ emptyset ) )
= ( setadjoin @ ( setadjoin @ Y3 @ emptyset ) @ ( setadjoin @ ( setadjoin @ Y3 @ ( setadjoin @ Y0 @ emptyset ) ) @ emptyset ) ) )
=> ( Y3 = Y1 ) ) ) ) ) ) ),
inference(cnf_transformation,[status(thm)],[f9]) ).
thf(f9,plain,
( setukpairinjL2
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( !! @ $i
@ ^ [Y3: $i] :
( ( ( setadjoin @ ( setadjoin @ Y1 @ emptyset ) @ ( setadjoin @ ( setadjoin @ Y1 @ ( setadjoin @ Y2 @ emptyset ) ) @ emptyset ) )
= ( setadjoin @ ( setadjoin @ Y3 @ emptyset ) @ ( setadjoin @ ( setadjoin @ Y3 @ ( setadjoin @ Y0 @ emptyset ) ) @ emptyset ) ) )
=> ( Y3 = Y1 ) ) ) ) ) ) ),
inference(fool_elimination,[status(thm)],[f8]) ).
thf(f8,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ( ( ( setadjoin @ ( setadjoin @ X2 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X2 @ ( setadjoin @ X1 @ emptyset ) ) @ emptyset ) )
= ( setadjoin @ ( setadjoin @ X0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X0 @ ( setadjoin @ X3 @ emptyset ) ) @ emptyset ) ) )
=> ( X0 = X2 ) )
= setukpairinjL2 ),
inference(rectify,[status(thm)],[f2]) ).
thf(f2,axiom,
! [X2: $i,X1: $i,X0: $i,X3: $i] :
( ( ( ( setadjoin @ ( setadjoin @ X0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X0 @ ( setadjoin @ X1 @ emptyset ) ) @ emptyset ) )
= ( setadjoin @ ( setadjoin @ X2 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X2 @ ( setadjoin @ X3 @ emptyset ) ) @ emptyset ) ) )
=> ( X0 = X2 ) )
= setukpairinjL2 ),
file('/export/starexec/sandbox/tmp/tmp.wIoR7omPWm/DTF2THF_32438.p',setukpairinjL2) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU648^2 : TPTP v9.2.1. Released v3.7.0.
% 0.12/0.14 % Command : /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.17/0.35 % Computer : n023.cluster.edu
% 0.17/0.35 % Model : x86_64 x86_64
% 0.17/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.35 % Memory : 8042.1875MB
% 0.17/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.35 % CPULimit : 300
% 0.17/0.35 % WCLimit : 300
% 0.17/0.35 % DateTime : Tue Feb 24 12:30:49 EST 2026
% 0.17/0.35 % CPUTime :
% 0.17/0.35 Running /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.21/0.46 ---- Original DTF file ---
% 0.21/0.46 thf(spec,logic,$$dhol).
% 0.21/0.46 %------------------------------------------------------------------------------
% 0.21/0.46 % File : SEU648^2 : TPTP v9.2.1. Released v3.7.0.
% 0.21/0.46 % Domain : Set Theory
% 0.21/0.46 % Problem : Ordered Pairs - Properties of Pairs
% 0.21/0.46 % Version : Especial > Reduced > Especial.
% 0.21/0.46 % English : (! x:i.! y:i.! z:i.! u:i.kpair x y = kpair z u -> x = z)
% 0.21/0.46
% 0.21/0.46 % Refs : [Bro08] Brown (2008), Email to G. Sutcliffe
% 0.21/0.46 % Source : [Bro08]
% 0.21/0.46 % Names : ZFC150l [Bro08]
% 0.21/0.46
% 0.21/0.46 % Status : Theorem
% 0.21/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 v4.0.1, 0.33 v4.0.0, 0.00 v3.7.0
% 0.21/0.46 % Syntax : Number of formulae : 7 ( 2 unt; 4 typ; 2 def)
% 0.21/0.46 % Number of atoms : 8 ( 6 equ; 0 cnn)
% 0.21/0.46 % Maximal formula atoms : 3 ( 2 avg)
% 0.21/0.46 % Number of connectives : 37 ( 0 ~; 0 |; 0 &; 34 @)
% 0.21/0.46 % ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% 0.21/0.46 % Maximal formula depth : 7 ( 3 avg)
% 0.21/0.46 % Number of types : 2 ( 0 usr)
% 0.21/0.46 % Number of type conns : 4 ( 4 >; 0 *; 0 +; 0 <<)
% 0.21/0.46 % Number of symbols : 5 ( 4 usr; 2 con; 0-2 aty)
% 0.21/0.46 % Number of variables : 10 ( 2 ^; 8 !; 0 ?; 10 :)
% 0.21/0.46 % SPC : TH0_THM_EQU_NAR
% 0.21/0.46
% 0.21/0.46 % Comments : http://mathgate.info/detsetitem.php?id=233
% 0.21/0.46 %------------------------------------------------------------------------------
% 0.21/0.46 thf(emptyset_type,type,
% 0.21/0.46 emptyset: $i ).
% 0.21/0.46
% 0.21/0.46 thf(setadjoin_type,type,
% 0.21/0.46 setadjoin: $i > $i > $i ).
% 0.21/0.46
% 0.21/0.46 thf(kpair_type,type,
% 0.21/0.46 kpair: $i > $i > $i ).
% 0.21/0.46
% 0.21/0.46 thf(kpair,definition,
% 0.21/0.46 ( kpair
% 0.21/0.46 = ( ^ [Xx: $i,Xy: $i] : ( setadjoin @ ( setadjoin @ Xx @ emptyset ) @ ( setadjoin @ ( setadjoin @ Xx @ ( setadjoin @ Xy @ emptyset ) ) @ emptyset ) ) ) ) ).
% 0.21/0.46
% 0.21/0.46 thf(setukpairinjL2_type,type,
% 0.21/0.46 setukpairinjL2: $o ).
% 0.21/0.46
% 0.21/0.46 thf(setukpairinjL2,definition,
% 0.21/0.46 ( setukpairinjL2
% 0.21/0.46 = ( ! [Xx: $i,Xy: $i,Xz: $i,Xu: $i] :
% 0.21/0.46 ( ( ( setadjoin @ ( setadjoin @ Xx @ emptyset ) @ ( setadjoin @ ( setadjoin @ Xx @ ( setadjoin @ Xy @ emptyset ) ) @ emptyset ) )
% 0.21/0.46 = ( setadjoin @ ( setadjoin @ Xz @ emptyset ) @ ( setadjoin @ ( setadjoin @ Xz @ ( setadjoin @ Xu @ emptyset ) ) @ emptyset ) ) )
% 0.21/0.46 => ( Xx = Xz ) ) ) ) ).
% 0.21/0.46
% 0.21/0.46 thf(setukpairinjL,conjecture,
% 0.21/0.46 ( setukpairinjL2
% 0.21/0.46 => ! [Xx: $i,Xy: $i,Xz: $i,Xu: $i] :
% 0.21/0.46 ( ( ( kpair @ Xx @ Xy )
% 0.21/0.46 = ( kpair @ Xz @ Xu ) )
% 0.21/0.46 => ( Xx = Xz ) ) ) ).
% 0.21/0.46
% 0.21/0.46 %------------------------------------------------------------------------------
% 0.21/0.46 ------------------------
% 1.51/1.37 ---- Embedded in THF ---
% 1.51/1.37 %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.51/1.37 %%% Generated on Tue Feb 24 12:30:50 EST 2026
% 1.51/1.37 %%% using '$$dhol' embedding, version 1.3.0.
% 1.51/1.37 %%% Logic specification used:
% 1.51/1.37 %%% thf(spec, logic, $$dhol).
% 1.51/1.37
% 1.51/1.37 % SZS output start ListOfTHF for /export/starexec/sandbox/tmp/tmp.wIoR7omPWm/DTF2DTF32438.p
% See solution above
% 1.51/1.37 ------------------------
% 1.51/1.38 ---- Cleaned THF ---
% 1.51/1.38 thf(emptyset_type,type,
% 1.51/1.38 emptyset: $i ).
% 1.51/1.38
% 1.51/1.38 thf(setadjoin_type,type,
% 1.51/1.38 setadjoin: $i > $i > $i ).
% 1.51/1.38
% 1.51/1.38 thf(kpair_type,type,
% 1.51/1.38 kpair: $i > $i > $i ).
% 1.51/1.38
% 1.51/1.38 thf(kpair,definition,
% 1.51/1.38 ( kpair
% 1.51/1.38 = ( ^ [Xx: $i,Xy: $i] : ( setadjoin @ ( setadjoin @ Xx @ emptyset ) @ ( setadjoin @ ( setadjoin @ Xx @ ( setadjoin @ Xy @ emptyset ) ) @ emptyset ) ) ) ) ).
% 1.51/1.38
% 1.51/1.38 thf(setukpairinjL2_type,type,
% 1.51/1.38 setukpairinjL2: $o ).
% 1.51/1.38
% 1.51/1.38 thf(setukpairinjL2,definition,
% 1.51/1.38 ( setukpairinjL2
% 1.51/1.38 = ( ! [Xx: $i,Xy: $i,Xz: $i,Xu: $i] :
% 1.51/1.38 ( ( ( setadjoin @ ( setadjoin @ Xx @ emptyset ) @ ( setadjoin @ ( setadjoin @ Xx @ ( setadjoin @ Xy @ emptyset ) ) @ emptyset ) )
% 1.51/1.38 = ( setadjoin @ ( setadjoin @ Xz @ emptyset ) @ ( setadjoin @ ( setadjoin @ Xz @ ( setadjoin @ Xu @ emptyset ) ) @ emptyset ) ) )
% 1.51/1.38 => ( Xx = Xz ) ) ) ) ).
% 1.51/1.38
% 1.51/1.38 thf(setukpairinjL,conjecture,
% 1.51/1.38 ( setukpairinjL2
% 1.51/1.38 => ! [Xx: $i,Xy: $i,Xz: $i,Xu: $i] :
% 1.51/1.38 ( ( ( kpair @ Xx @ Xy )
% 1.51/1.38 = ( kpair @ Xz @ Xu ) )
% 1.51/1.38 => ( Xx = Xz ) ) ) ).
% 1.51/1.38 ------------------------
% 1.68/1.40 % (32535)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on DTF2THF_32438 for (2999ds/183Mi)
% 1.68/1.40 % (32537)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_32438 for (2999ds/27Mi)
% 1.68/1.40 % (32536)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_32438 for (2999ds/4Mi)
% 1.68/1.40 % (32539)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_32438 for (2999ds/2Mi)
% 1.68/1.40 % (32540)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_32438 for (2999ds/275Mi)
% 1.68/1.40 % (32541)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on DTF2THF_32438 for (2999ds/18Mi)
% 1.68/1.40 % (32538)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on DTF2THF_32438 for (2999ds/2Mi)
% 1.68/1.40 % (32538)Instruction limit reached!
% 1.68/1.40 % (32538)------------------------------
% 1.68/1.40 % (32538)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.68/1.40 % (32538)Termination reason: Unknown
% 1.68/1.40 % (32538)Termination phase: Saturation
% 1.68/1.40 % (32539)Instruction limit reached!
% 1.68/1.40 % (32539)------------------------------
% 1.68/1.40 % (32539)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.68/1.40 % (32539)Termination reason: Unknown
% 1.68/1.40 % (32539)Termination phase: Saturation
% 1.68/1.40
% 1.68/1.40 % (32539)Memory used [KB]: 5500
% 1.68/1.40 % (32539)Time elapsed: 0.003 s
% 1.68/1.40 % (32539)Instructions burned: 3 (million)
% 1.68/1.40 % (32539)------------------------------
% 1.68/1.40 % (32539)------------------------------
% 1.68/1.40
% 1.68/1.40 % (32538)Memory used [KB]: 895
% 1.68/1.40 % (32538)Time elapsed: 0.003 s
% 1.68/1.40 % (32538)Instructions burned: 3 (million)
% 1.68/1.40 % (32538)------------------------------
% 1.68/1.40 % (32538)------------------------------
% 1.68/1.40 % (32540)Refutation not found, incomplete strategy
% 1.68/1.40 % (32540)------------------------------
% 1.68/1.40 % (32540)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.68/1.40 % (32540)Termination reason: Refutation not found, incomplete strategy
% 1.68/1.40
% 1.68/1.40
% 1.68/1.40 % (32540)Memory used [KB]: 5500
% 1.68/1.40 % (32540)Time elapsed: 0.003 s
% 1.68/1.40 % (32540)Instructions burned: 3 (million)
% 1.68/1.40 % (32540)------------------------------
% 1.68/1.40 % (32540)------------------------------
% 1.68/1.40 % (32536)Instruction limit reached!
% 1.68/1.40 % (32536)------------------------------
% 1.68/1.40 % (32536)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.68/1.40 % (32536)Termination reason: Unknown
% 1.68/1.40 % (32536)Termination phase: Saturation
% 1.68/1.40
% 1.68/1.40 % (32536)Memory used [KB]: 5500
% 1.68/1.40 % (32536)Time elapsed: 0.004 s
% 1.68/1.40 % (32536)Instructions burned: 4 (million)
% 1.68/1.40 % (32536)------------------------------
% 1.68/1.40 % (32536)------------------------------
% 1.68/1.40 % (32535)First to succeed.
% 1.68/1.40 % (32541)Also succeeded, but the first one will report.
% 1.68/1.40 % (32535)Refutation found. Thanks to Tanya!
% 1.68/1.40 % SZS status Theorem for DTF2THF_32438
% 1.68/1.40 % SZS output start Proof for DTF2THF_32438
% 1.68/1.40 thf(func_def_1, type, setadjoin: $i > $i > $i).
% 1.68/1.40 thf(func_def_2, type, kpair: $i > $i > $i).
% 1.68/1.40 thf(f50,plain,(
% 1.68/1.40 $false),
% 1.68/1.40 inference(subsumption_resolution,[status(thm)],[f40,f15])).
% 1.68/1.40 thf(f15,plain,(
% 1.68/1.40 (sK0 != sK3)),
% 1.68/1.40 inference(cnf_transformation,[status(thm)],[f13])).
% 1.68/1.40 thf(f13,plain,(
% 1.68/1.40 (((kpair @ sK0 @ sK1) = (kpair @ sK3 @ sK2)) & (sK0 != sK3)) & (setukpairinjL2 = $true)),
% 1.68/1.40 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f11,f12])).
% 1.68/1.40 thf(f12,plain,(
% 1.68/1.40 ? [X0 : $i,X1 : $i,X2 : $i,X3 : $i] : (((kpair @ X0 @ X1) = (kpair @ X3 @ X2)) & (X0 != X3)) => (((kpair @ sK0 @ sK1) = (kpair @ sK3 @ sK2)) & (sK0 != sK3))),
% 1.68/1.40 introduced(definition,[],[choice_axiom])).
% 1.68/1.40 thf(f11,plain,(
% 1.68/1.40 ? [X0 : $i,X1 : $i,X2 : $i,X3 : $i] : (((kpair @ X0 @ X1) = (kpair @ X3 @ X2)) & (X0 != X3)) & (setukpairinjL2 = $true)),
% 1.68/1.40 inference(ennf_transformation,[status(thm)],[f7])).
% 1.68/1.40 thf(f7,plain,(
% 1.68/1.40 ~((setukpairinjL2 = $true) => ! [X0 : $i,X1 : $i,X2 : $i,X3 : $i] : (((kpair @ X0 @ X1) = (kpair @ X3 @ X2)) => (X0 = X3)))),
% 1.68/1.40 inference(fool_elimination,[status(thm)],[f6])).
% 1.68/1.40 thf(f6,plain,(
% 1.68/1.40 ~(setukpairinjL2 => ! [X0 : $i,X1 : $i,X2 : $i,X3 : $i] : (((kpair @ X0 @ X1) = (kpair @ X3 @ X2)) => (X0 = X3)))),
% 1.68/1.40 inference(rectify,[status(thm)],[f4])).
% 1.68/1.40 thf(f4,negated_conjecture,(
% 1.68/1.40 ~(setukpairinjL2 => ! [X0 : $i,X1 : $i,X3 : $i,X2 : $i] : (((kpair @ X0 @ X1) = (kpair @ X2 @ X3)) => (X0 = X2)))),
% 1.68/1.40 inference(negated_conjecture,[status(cth)],[f3])).
% 1.68/1.40 thf(f3,conjecture,(
% 1.68/1.40 setukpairinjL2 => ! [X0 : $i,X1 : $i,X3 : $i,X2 : $i] : (((kpair @ X0 @ X1) = (kpair @ X2 @ X3)) => (X0 = X2))),
% 1.68/1.40 file('/export/starexec/sandbox/tmp/tmp.wIoR7omPWm/DTF2THF_32438.p',setukpairinjL)).
% 1.68/1.40 thf(f40,plain,(
% 1.68/1.40 (sK0 = sK3)),
% 1.68/1.40 inference(equality_resolution,[status(thm)],[f34])).
% 1.68/1.40 thf(f34,plain,(
% 1.68/1.40 ( ! [X0 : $i,X1 : $i] : (((setadjoin @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset)) @ emptyset)) != (setadjoin @ (setadjoin @ sK0 @ emptyset) @ (setadjoin @ (setadjoin @ sK0 @ (setadjoin @ sK1 @ emptyset)) @ emptyset))) | (sK3 = X0)) )),
% 1.68/1.40 inference(superposition,[status(thm)],[f32,f21])).
% 1.68/1.40 thf(f21,plain,(
% 1.68/1.40 ((setadjoin @ (setadjoin @ sK3 @ emptyset) @ (setadjoin @ (setadjoin @ sK3 @ (setadjoin @ sK2 @ emptyset)) @ emptyset)) = (setadjoin @ (setadjoin @ sK0 @ emptyset) @ (setadjoin @ (setadjoin @ sK0 @ (setadjoin @ sK1 @ emptyset)) @ emptyset)))),
% 1.68/1.40 inference(beta_eta_normalization,[status(thm)],[f19])).
% 1.68/1.40 thf(f19,plain,(
% 1.68/1.40 (((^[Y0 : $i]: ((^[Y1 : $i]: (setadjoin @ (setadjoin @ Y0 @ emptyset) @ (setadjoin @ (setadjoin @ Y0 @ (setadjoin @ Y1 @ emptyset)) @ emptyset))))) @ sK3 @ sK2) = ((^[Y0 : $i]: ((^[Y1 : $i]: (setadjoin @ (setadjoin @ Y0 @ emptyset) @ (setadjoin @ (setadjoin @ Y0 @ (setadjoin @ Y1 @ emptyset)) @ emptyset))))) @ sK0 @ sK1))),
% 1.68/1.40 inference(definition_unfolding,[status(thm)],[f16,f18,f18])).
% 1.68/1.40 thf(f18,plain,(
% 1.68/1.40 (kpair = (^[Y0 : $i]: ((^[Y1 : $i]: (setadjoin @ (setadjoin @ Y0 @ emptyset) @ (setadjoin @ (setadjoin @ Y0 @ (setadjoin @ Y1 @ emptyset)) @ emptyset))))))),
% 1.68/1.40 inference(cnf_transformation,[status(thm)],[f10])).
% 1.68/1.40 thf(f10,plain,(
% 1.68/1.40 (kpair = (^[Y0 : $i]: ((^[Y1 : $i]: (setadjoin @ (setadjoin @ Y0 @ emptyset) @ (setadjoin @ (setadjoin @ Y0 @ (setadjoin @ Y1 @ emptyset)) @ emptyset))))))),
% 1.68/1.40 inference(fool_elimination,[status(thm)],[f1])).
% 1.68/1.40 thf(f1,axiom,(
% 1.68/1.40 ((^[X0 : $i, X1 : $i] : (setadjoin @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset)) @ emptyset))) = kpair)),
% 1.68/1.40 file('/export/starexec/sandbox/tmp/tmp.wIoR7omPWm/DTF2THF_32438.p',kpair)).
% 1.68/1.40 thf(f16,plain,(
% 1.68/1.40 ((kpair @ sK0 @ sK1) = (kpair @ sK3 @ sK2))),
% 1.68/1.40 inference(cnf_transformation,[status(thm)],[f13])).
% 1.68/1.40 thf(f32,plain,(
% 1.68/1.40 ( ! [X2 : $i,X3 : $i,X1 : $i,X4 : $i] : (((setadjoin @ (setadjoin @ X2 @ emptyset) @ (setadjoin @ (setadjoin @ X2 @ (setadjoin @ X3 @ emptyset)) @ emptyset)) != (setadjoin @ (setadjoin @ X4 @ emptyset) @ (setadjoin @ (setadjoin @ X4 @ (setadjoin @ X1 @ emptyset)) @ emptyset))) | (X2 = X4)) )),
% 1.68/1.40 inference(equality_proxy_clausification,[status(thm)],[f31])).
% 1.68/1.40 thf(f31,plain,(
% 1.68/1.40 ( ! [X2 : $i,X3 : $i,X1 : $i,X4 : $i] : ((X2 = X4) | (((setadjoin @ (setadjoin @ X2 @ emptyset) @ (setadjoin @ (setadjoin @ X2 @ (setadjoin @ X3 @ emptyset)) @ emptyset)) = (setadjoin @ (setadjoin @ X4 @ emptyset) @ (setadjoin @ (setadjoin @ X4 @ (setadjoin @ X1 @ emptyset)) @ emptyset))) = $false)) )),
% 1.68/1.40 inference(equality_proxy_clausification,[status(thm)],[f30])).
% 1.68/1.40 thf(f30,plain,(
% 1.68/1.40 ( ! [X2 : $i,X3 : $i,X1 : $i,X4 : $i] : (((X4 = X2) = $true) | (((setadjoin @ (setadjoin @ X2 @ emptyset) @ (setadjoin @ (setadjoin @ X2 @ (setadjoin @ X3 @ emptyset)) @ emptyset)) = (setadjoin @ (setadjoin @ X4 @ emptyset) @ (setadjoin @ (setadjoin @ X4 @ (setadjoin @ X1 @ emptyset)) @ emptyset))) = $false)) )),
% 1.68/1.40 inference(binary_proxy_clausification,[status(thm)],[f29])).
% 1.68/1.40 thf(f29,plain,(
% 1.68/1.40 ( ! [X2 : $i,X3 : $i,X1 : $i,X4 : $i] : (((((setadjoin @ (setadjoin @ X2 @ emptyset) @ (setadjoin @ (setadjoin @ X2 @ (setadjoin @ X3 @ emptyset)) @ emptyset)) = (setadjoin @ (setadjoin @ X4 @ emptyset) @ (setadjoin @ (setadjoin @ X4 @ (setadjoin @ X1 @ emptyset)) @ emptyset))) => (X4 = X2)) = $true)) )),
% 1.68/1.40 inference(beta_eta_normalization,[status(thm)],[f28])).
% 1.68/1.40 thf(f28,plain,(
% 1.68/1.40 ( ! [X2 : $i,X3 : $i,X1 : $i,X4 : $i] : ((((^[Y0 : $i]: (((setadjoin @ (setadjoin @ X2 @ emptyset) @ (setadjoin @ (setadjoin @ X2 @ (setadjoin @ X3 @ emptyset)) @ emptyset)) = (setadjoin @ (setadjoin @ Y0 @ emptyset) @ (setadjoin @ (setadjoin @ Y0 @ (setadjoin @ X1 @ emptyset)) @ emptyset))) => (Y0 = X2))) @ X4) = $true)) )),
% 1.68/1.40 inference(pi_clausification,[status(thm)],[f27])).
% 1.68/1.40 thf(f27,plain,(
% 1.68/1.40 ( ! [X2 : $i,X3 : $i,X1 : $i] : (((!! @ $i @ (^[Y0 : $i]: (((setadjoin @ (setadjoin @ X2 @ emptyset) @ (setadjoin @ (setadjoin @ X2 @ (setadjoin @ X3 @ emptyset)) @ emptyset)) = (setadjoin @ (setadjoin @ Y0 @ emptyset) @ (setadjoin @ (setadjoin @ Y0 @ (setadjoin @ X1 @ emptyset)) @ emptyset))) => (Y0 = X2)))) = $true)) )),
% 1.68/1.40 inference(beta_eta_normalization,[status(thm)],[f26])).
% 1.68/1.40 thf(f26,plain,(
% 1.68/1.40 ( ! [X2 : $i,X3 : $i,X1 : $i] : ((((^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (((setadjoin @ (setadjoin @ X2 @ emptyset) @ (setadjoin @ (setadjoin @ X2 @ (setadjoin @ Y0 @ emptyset)) @ emptyset)) = (setadjoin @ (setadjoin @ Y1 @ emptyset) @ (setadjoin @ (setadjoin @ Y1 @ (setadjoin @ X1 @ emptyset)) @ emptyset))) => (Y1 = X2))))) @ X3) = $true)) )),
% 1.68/1.40 inference(pi_clausification,[status(thm)],[f25])).
% 1.68/1.40 thf(f25,plain,(
% 1.68/1.40 ( ! [X2 : $i,X1 : $i] : (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (((setadjoin @ (setadjoin @ X2 @ emptyset) @ (setadjoin @ (setadjoin @ X2 @ (setadjoin @ Y0 @ emptyset)) @ emptyset)) = (setadjoin @ (setadjoin @ Y1 @ emptyset) @ (setadjoin @ (setadjoin @ Y1 @ (setadjoin @ X1 @ emptyset)) @ emptyset))) => (Y1 = X2)))))) = $true)) )),
% 1.68/1.40 inference(beta_eta_normalization,[status(thm)],[f24])).
% 1.68/1.40 thf(f24,plain,(
% 1.68/1.40 ( ! [X2 : $i,X1 : $i] : ((((^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: (((setadjoin @ (setadjoin @ Y0 @ emptyset) @ (setadjoin @ (setadjoin @ Y0 @ (setadjoin @ Y1 @ emptyset)) @ emptyset)) = (setadjoin @ (setadjoin @ Y2 @ emptyset) @ (setadjoin @ (setadjoin @ Y2 @ (setadjoin @ X1 @ emptyset)) @ emptyset))) => (Y2 = Y0))))))) @ X2) = $true)) )),
% 1.68/1.40 inference(pi_clausification,[status(thm)],[f23])).
% 1.68/1.40 thf(f23,plain,(
% 1.68/1.40 ( ! [X1 : $i] : (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: (((setadjoin @ (setadjoin @ Y0 @ emptyset) @ (setadjoin @ (setadjoin @ Y0 @ (setadjoin @ Y1 @ emptyset)) @ emptyset)) = (setadjoin @ (setadjoin @ Y2 @ emptyset) @ (setadjoin @ (setadjoin @ Y2 @ (setadjoin @ X1 @ emptyset)) @ emptyset))) => (Y2 = Y0)))))))) = $true)) )),
% 1.68/1.40 inference(beta_eta_normalization,[status(thm)],[f22])).
% 1.68/1.40 thf(f22,plain,(
% 1.68/1.40 ( ! [X1 : $i] : ((((^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: (((setadjoin @ (setadjoin @ Y1 @ emptyset) @ (setadjoin @ (setadjoin @ Y1 @ (setadjoin @ Y2 @ emptyset)) @ emptyset)) = (setadjoin @ (setadjoin @ Y3 @ emptyset) @ (setadjoin @ (setadjoin @ Y3 @ (setadjoin @ Y0 @ emptyset)) @ emptyset))) => (Y3 = Y1))))))))) @ X1) = $true)) )),
% 1.68/1.40 inference(pi_clausification,[status(thm)],[f20])).
% 1.68/1.40 thf(f20,plain,(
% 1.68/1.40 ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: (((setadjoin @ (setadjoin @ Y1 @ emptyset) @ (setadjoin @ (setadjoin @ Y1 @ (setadjoin @ Y2 @ emptyset)) @ emptyset)) = (setadjoin @ (setadjoin @ Y3 @ emptyset) @ (setadjoin @ (setadjoin @ Y3 @ (setadjoin @ Y0 @ emptyset)) @ emptyset))) => (Y3 = Y1)))))))))) = $true)),
% 1.68/1.40 inference(definition_unfolding,[status(thm)],[f17,f14])).
% 1.68/1.40 thf(f14,plain,(
% 1.68/1.40 (setukpairinjL2 = $true)),
% 1.68/1.40 inference(cnf_transformation,[status(thm)],[f13])).
% 1.68/1.40 thf(f17,plain,(
% 1.68/1.40 (setukpairinjL2 = (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: (((setadjoin @ (setadjoin @ Y1 @ emptyset) @ (setadjoin @ (setadjoin @ Y1 @ (setadjoin @ Y2 @ emptyset)) @ emptyset)) = (setadjoin @ (setadjoin @ Y3 @ emptyset) @ (setadjoin @ (setadjoin @ Y3 @ (setadjoin @ Y0 @ emptyset)) @ emptyset))) => (Y3 = Y1)))))))))))),
% 1.68/1.40 inference(cnf_transformation,[status(thm)],[f9])).
% 1.68/1.40 thf(f9,plain,(
% 1.68/1.40 (setukpairinjL2 = (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: (((setadjoin @ (setadjoin @ Y1 @ emptyset) @ (setadjoin @ (setadjoin @ Y1 @ (setadjoin @ Y2 @ emptyset)) @ emptyset)) = (setadjoin @ (setadjoin @ Y3 @ emptyset) @ (setadjoin @ (setadjoin @ Y3 @ (setadjoin @ Y0 @ emptyset)) @ emptyset))) => (Y3 = Y1)))))))))))),
% 1.68/1.40 inference(fool_elimination,[status(thm)],[f8])).
% 1.68/1.40 thf(f8,plain,(
% 1.68/1.40 (! [X0 : $i,X1 : $i,X2 : $i,X3 : $i] : (((setadjoin @ (setadjoin @ X2 @ emptyset) @ (setadjoin @ (setadjoin @ X2 @ (setadjoin @ X1 @ emptyset)) @ emptyset)) = (setadjoin @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ (setadjoin @ X3 @ emptyset)) @ emptyset))) => (X0 = X2)) = setukpairinjL2)),
% 1.68/1.40 inference(rectify,[status(thm)],[f2])).
% 1.68/1.40 thf(f2,axiom,(
% 1.68/1.40 (! [X2 : $i,X1 : $i,X0 : $i,X3 : $i] : (((setadjoin @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset)) @ emptyset)) = (setadjoin @ (setadjoin @ X2 @ emptyset) @ (setadjoin @ (setadjoin @ X2 @ (setadjoin @ X3 @ emptyset)) @ emptyset))) => (X0 = X2)) = setukpairinjL2)),
% 1.68/1.40 file('/export/starexec/sandbox/tmp/tmp.wIoR7omPWm/DTF2THF_32438.p',setukpairinjL2)).
% 1.68/1.40 % SZS output end Proof for DTF2THF_32438
% 1.68/1.40 % (32535)------------------------------
% 1.68/1.40 % (32535)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.68/1.40 % (32535)Termination reason: Refutation
% 1.68/1.40
% 1.68/1.40 % (32535)Memory used [KB]: 5500
% 1.68/1.40 % (32535)Time elapsed: 0.007 s
% 1.68/1.40 % (32535)Instructions burned: 6 (million)
% 1.68/1.40 % (32535)------------------------------
% 1.68/1.40 % (32535)------------------------------
% 1.68/1.40 % (32534)Success in time 0.021 s
%------------------------------------------------------------------------------