%------------------------------------------------------------------------------
% File : DT2H2X---1.9.5
% Problem : SEU517^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 : n005.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:02 AM UTC 2026
% Result : Theorem 1.58s 1.39s
% Output : Refutation 1.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 29
% Number of leaves : 10
% Syntax : Number of formulae : 83 ( 13 unt; 0 typ; 0 def)
% Number of atoms : 891 ( 321 equ; 0 cnn)
% Maximal formula atoms : 12 ( 10 avg)
% Number of connectives : 1196 ( 150 ~; 156 |; 57 &; 786 @)
% ( 8 <=>; 39 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 47 ( 47 >; 0 *; 0 +; 0 <<)
% Number of symbols : 20 ( 17 usr; 12 con; 0-2 aty)
% Number of variables : 263 ( 46 ^; 180 !; 37 ?; 263 :)
% Comments :
%------------------------------------------------------------------------------
thf(func_def_0,type,
in: $i > $i > $o ).
thf(func_def_1,type,
dsetconstr: $i > ( $i > $o ) > $i ).
thf(func_def_10,type,
sK0: $i > $i > $i ).
thf(func_def_11,type,
sK1: $i > $i > $i ).
thf(func_def_14,type,
sK4: $i > $o ).
thf(func_def_18,type,
sK8: $i > $o ).
thf(func_def_22,type,
ph12:
!>[X0: $tType] : X0 ).
thf(f207,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[f179]) ).
thf(f179,plain,
sK10 != sK10,
inference(superposition,[status(thm)],[f53,f163]) ).
thf(f163,plain,
! [X0: $i] :
( ( dsetconstr @ X0
@ ^ [Y0: $i] : $true )
= X0 ),
inference(trivial_inequality_removal,[status(thm)],[f162]) ).
thf(f162,plain,
! [X0: $i] :
( ( $true != $true )
| ( ( dsetconstr @ X0
@ ^ [Y0: $i] : $true )
= X0 ) ),
inference(beta_eta_normalization,[status(thm)],[f158]) ).
thf(f158,plain,
! [X0: $i] :
( ( ( dsetconstr @ X0
@ ^ [Y0: $i] : $true )
= X0 )
| ( ( ^ [Y0: $i] : $true
@ ( sK0 @ X0
@ ( dsetconstr @ X0
@ ^ [Y0: $i] : $true ) ) )
!= $true ) ),
inference(primitive_instantiation,[status(thm)],[f149]) ).
thf(f149,plain,
! [X0: $i,X1: $i > $o] :
( ( ( X1 @ ( sK0 @ X0 @ ( dsetconstr @ X0 @ X1 ) ) )
!= $true )
| ( ( dsetconstr @ X0 @ X1 )
= X0 ) ),
inference(subsumption_resolution,[status(thm)],[f146,f125]) ).
thf(f125,plain,
! [X0: $i,X1: $i > $o] :
( ( $true
!= ( in @ ( sK0 @ X0 @ ( dsetconstr @ X0 @ X1 ) ) @ X0 ) )
| ( ( X1 @ ( sK0 @ X0 @ ( dsetconstr @ X0 @ X1 ) ) )
!= $true )
| ( ( dsetconstr @ X0 @ X1 )
= X0 ) ),
inference(trivial_inequality_removal,[status(thm)],[f124]) ).
thf(f124,plain,
! [X0: $i,X1: $i > $o] :
( ( $true != $true )
| ( ( dsetconstr @ X0 @ X1 )
= X0 )
| ( ( X1 @ ( sK0 @ X0 @ ( dsetconstr @ X0 @ X1 ) ) )
!= $true )
| ( $true
!= ( in @ ( sK0 @ X0 @ ( dsetconstr @ X0 @ X1 ) ) @ X0 ) ) ),
inference(duplicate_literal_removal,[status(thm)],[f118]) ).
thf(f118,plain,
! [X0: $i,X1: $i > $o] :
( ( $true
!= ( in @ ( sK0 @ X0 @ ( dsetconstr @ X0 @ X1 ) ) @ X0 ) )
| ( ( X1 @ ( sK0 @ X0 @ ( dsetconstr @ X0 @ X1 ) ) )
!= $true )
| ( ( dsetconstr @ X0 @ X1 )
= X0 )
| ( $true
!= ( in @ ( sK0 @ X0 @ ( dsetconstr @ X0 @ X1 ) ) @ X0 ) )
| ( ( dsetconstr @ X0 @ X1 )
= X0 )
| ( $true != $true )
| ( ( X1 @ ( sK0 @ X0 @ ( dsetconstr @ X0 @ X1 ) ) )
!= $true ) ),
inference(superposition,[status(thm)],[f83,f100]) ).
thf(f100,plain,
! [X2: $i > $o,X0: $i,X1: $i] :
( ( ( in @ ( sK1 @ X0 @ ( dsetconstr @ X1 @ X2 ) ) @ X1 )
= $true )
| ( ( in @ ( sK0 @ X0 @ ( dsetconstr @ X1 @ X2 ) ) @ X1 )
!= $true )
| ( ( dsetconstr @ X1 @ X2 )
= X0 )
| ( ( X2 @ ( sK0 @ X0 @ ( dsetconstr @ X1 @ X2 ) ) )
!= $true ) ),
inference(trivial_inequality_removal,[status(thm)],[f99]) ).
thf(f99,plain,
! [X2: $i > $o,X0: $i,X1: $i] :
( ( $true != $true )
| ( ( in @ ( sK0 @ X0 @ ( dsetconstr @ X1 @ X2 ) ) @ X1 )
!= $true )
| ( ( dsetconstr @ X1 @ X2 )
= X0 )
| ( ( X2 @ ( sK0 @ X0 @ ( dsetconstr @ X1 @ X2 ) ) )
!= $true )
| ( ( in @ ( sK1 @ X0 @ ( dsetconstr @ X1 @ X2 ) ) @ X1 )
= $true ) ),
inference(superposition,[status(thm)],[f85,f72]) ).
thf(f72,plain,
! [X2: $i,X0: $i > $o,X1: $i] :
( ( ( in @ X1 @ ( dsetconstr @ X2 @ X0 ) )
= $true )
| ( $true
!= ( X0 @ X1 ) )
| ( ( in @ X1 @ X2 )
!= $true ) ),
inference(beta_eta_normalization,[status(thm)],[f71]) ).
thf(f71,plain,
! [X2: $i,X0: $i > $o,X1: $i] :
( ( ( in @ X1
@ ( dsetconstr @ X2
@ ^ [Y0: $i] : ( X0 @ Y0 ) ) )
= $true )
| ( $true
!= ( X0 @ X1 ) )
| ( ( in @ X1 @ X2 )
!= $true ) ),
inference(trivial_inequality_removal,[status(thm)],[f63]) ).
thf(f63,plain,
! [X2: $i,X0: $i > $o,X1: $i] :
( ( ( in @ X1
@ ( dsetconstr @ X2
@ ^ [Y0: $i] : ( X0 @ Y0 ) ) )
= $true )
| ( $true
!= ( X0 @ X1 ) )
| ( ( in @ X1 @ X2 )
!= $true )
| ( $true != $true ) ),
inference(definition_unfolding,[status(thm)],[f48,f55]) ).
thf(f55,plain,
dsetconstrI = $true,
inference(cnf_transformation,[status(thm)],[f37]) ).
thf(f37,plain,
( ( dsetconstrI = $true )
& ( dsetconstrEL = $true )
& ( ( dsetconstr @ sK10
@ ^ [Y0: $i] : $true )
!= sK10 )
& ( setext = $true ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK10])],[f16,f36]) ).
thf(f36,plain,
( ? [X0: $i] :
( ( dsetconstr @ X0
@ ^ [Y0: $i] : $true )
!= X0 )
=> ( ( dsetconstr @ sK10
@ ^ [Y0: $i] : $true )
!= sK10 ) ),
introduced(definition,[],[choice_axiom]) ).
thf(f16,plain,
( ( dsetconstrI = $true )
& ( dsetconstrEL = $true )
& ? [X0: $i] :
( ( dsetconstr @ X0
@ ^ [Y0: $i] : $true )
!= X0 )
& ( setext = $true ) ),
inference(flattening,[status(thm)],[f15]) ).
thf(f15,plain,
( ? [X0: $i] :
( ( dsetconstr @ X0
@ ^ [Y0: $i] : $true )
!= X0 )
& ( setext = $true )
& ( dsetconstrEL = $true )
& ( dsetconstrI = $true ) ),
inference(ennf_transformation,[status(thm)],[f8]) ).
thf(f8,plain,
~ ( ( dsetconstrI = $true )
=> ( ( dsetconstrEL = $true )
=> ( ( setext = $true )
=> ! [X0: $i] :
( ( dsetconstr @ X0
@ ^ [Y0: $i] : $true )
= X0 ) ) ) ),
inference(fool_elimination,[status(thm)],[f7]) ).
thf(f7,plain,
~ ( dsetconstrI
=> ( dsetconstrEL
=> ( setext
=> ! [X0: $i] :
( ( dsetconstr @ X0
@ ^ [X1: $i] : $true )
= X0 ) ) ) ),
inference(rectify,[status(thm)],[f5]) ).
thf(f5,negated_conjecture,
~ ( dsetconstrI
=> ( dsetconstrEL
=> ( setext
=> ! [X0: $i] :
( ( dsetconstr @ X0
@ ^ [X2: $i] : $true )
= X0 ) ) ) ),
inference(negated_conjecture,[status(cth)],[f4]) ).
thf(f4,conjecture,
( dsetconstrI
=> ( dsetconstrEL
=> ( setext
=> ! [X0: $i] :
( ( dsetconstr @ X0
@ ^ [X2: $i] : $true )
= X0 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.xxKekWKJ8Z/DTF2THF_22880.p',setoftrueEq) ).
thf(f48,plain,
! [X2: $i,X0: $i > $o,X1: $i] :
( ( ( in @ X1 @ X2 )
!= $true )
| ( $true
!= ( X0 @ X1 ) )
| ( ( in @ X1
@ ( dsetconstr @ X2
@ ^ [Y0: $i] : ( X0 @ Y0 ) ) )
= $true )
| ( dsetconstrI != $true ) ),
inference(cnf_transformation,[status(thm)],[f31]) ).
thf(f31,plain,
( ( ! [X0: $i > $o,X1: $i,X2: $i] :
( ( ( in @ X1 @ X2 )
!= $true )
| ( $true
!= ( X0 @ X1 ) )
| ( ( in @ X1
@ ( dsetconstr @ X2
@ ^ [Y0: $i] : ( X0 @ Y0 ) ) )
= $true ) )
| ( dsetconstrI != $true ) )
& ( ( dsetconstrI = $true )
| ( ( ( in @ sK5 @ sK6 )
= $true )
& ( $true
= ( sK4 @ sK5 ) )
& ( ( in @ sK5
@ ( dsetconstr @ sK6
@ ^ [Y0: $i] : ( sK4 @ Y0 ) ) )
!= $true ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4,sK5,sK6])],[f29,f30]) ).
thf(f30,plain,
( ? [X3: $i > $o,X4: $i,X5: $i] :
( ( ( in @ X4 @ X5 )
= $true )
& ( ( X3 @ X4 )
= $true )
& ( ( in @ X4
@ ( dsetconstr @ X5
@ ^ [Y0: $i] : ( X3 @ Y0 ) ) )
!= $true ) )
=> ( ( ( in @ sK5 @ sK6 )
= $true )
& ( $true
= ( sK4 @ sK5 ) )
& ( ( in @ sK5
@ ( dsetconstr @ sK6
@ ^ [Y0: $i] : ( sK4 @ Y0 ) ) )
!= $true ) ) ),
introduced(definition,[],[choice_axiom]) ).
thf(f29,plain,
( ( ! [X0: $i > $o,X1: $i,X2: $i] :
( ( ( in @ X1 @ X2 )
!= $true )
| ( $true
!= ( X0 @ X1 ) )
| ( ( in @ X1
@ ( dsetconstr @ X2
@ ^ [Y0: $i] : ( X0 @ Y0 ) ) )
= $true ) )
| ( dsetconstrI != $true ) )
& ( ( dsetconstrI = $true )
| ? [X3: $i > $o,X4: $i,X5: $i] :
( ( ( in @ X4 @ X5 )
= $true )
& ( ( X3 @ X4 )
= $true )
& ( ( in @ X4
@ ( dsetconstr @ X5
@ ^ [Y0: $i] : ( X3 @ Y0 ) ) )
!= $true ) ) ) ),
inference(rectify,[status(thm)],[f28]) ).
thf(f28,plain,
( ( ! [X0: $i > $o,X1: $i,X2: $i] :
( ( ( in @ X1 @ X2 )
!= $true )
| ( $true
!= ( X0 @ X1 ) )
| ( ( in @ X1
@ ( dsetconstr @ X2
@ ^ [Y0: $i] : ( X0 @ Y0 ) ) )
= $true ) )
| ( dsetconstrI != $true ) )
& ( ( dsetconstrI = $true )
| ? [X0: $i > $o,X1: $i,X2: $i] :
( ( ( in @ X1 @ X2 )
= $true )
& ( $true
= ( X0 @ X1 ) )
& ( ( in @ X1
@ ( dsetconstr @ X2
@ ^ [Y0: $i] : ( X0 @ Y0 ) ) )
!= $true ) ) ) ),
inference(nnf_transformation,[status(thm)],[f18]) ).
thf(f18,plain,
( ! [X0: $i > $o,X1: $i,X2: $i] :
( ( ( in @ X1 @ X2 )
!= $true )
| ( $true
!= ( X0 @ X1 ) )
| ( ( in @ X1
@ ( dsetconstr @ X2
@ ^ [Y0: $i] : ( X0 @ Y0 ) ) )
= $true ) )
<=> ( dsetconstrI = $true ) ),
inference(flattening,[status(thm)],[f17]) ).
thf(f17,plain,
( ! [X0: $i > $o,X1: $i,X2: $i] :
( ( ( in @ X1
@ ( dsetconstr @ X2
@ ^ [Y0: $i] : ( X0 @ Y0 ) ) )
= $true )
| ( $true
!= ( X0 @ X1 ) )
| ( ( in @ X1 @ X2 )
!= $true ) )
<=> ( dsetconstrI = $true ) ),
inference(ennf_transformation,[status(thm)],[f14]) ).
thf(f14,plain,
( ! [X0: $i > $o,X1: $i,X2: $i] :
( ( ( in @ X1 @ X2 )
= $true )
=> ( ( $true
= ( X0 @ X1 ) )
=> ( ( in @ X1
@ ( dsetconstr @ X2
@ ^ [Y0: $i] : ( X0 @ Y0 ) ) )
= $true ) ) )
<=> ( dsetconstrI = $true ) ),
inference(fool_elimination,[status(thm)],[f13]) ).
thf(f13,plain,
! [X0: $i > $o,X1: $i,X2: $i] :
( ( ( in @ X1 @ X2 )
=> ( ( X0 @ X1 )
=> ( in @ X1
@ ( dsetconstr @ X2
@ ^ [X3: $i] : ( X0 @ X3 ) ) ) ) )
= dsetconstrI ),
inference(rectify,[status(thm)],[f1]) ).
thf(f1,axiom,
! [X1: $i > $o,X2: $i,X0: $i] :
( ( ( in @ X2 @ X0 )
=> ( ( X1 @ X2 )
=> ( in @ X2
@ ( dsetconstr @ X0
@ ^ [X3: $i] : ( X1 @ X3 ) ) ) ) )
= dsetconstrI ),
file('/export/starexec/sandbox/tmp/tmp.xxKekWKJ8Z/DTF2THF_22880.p',dsetconstrI) ).
thf(f85,plain,
! [X2: $i > $o,X0: $i,X1: $i] :
( ( ( in @ ( sK0 @ X0 @ ( dsetconstr @ X1 @ X2 ) ) @ ( dsetconstr @ X1 @ X2 ) )
!= $true )
| ( ( dsetconstr @ X1 @ X2 )
= X0 )
| ( ( in @ ( sK1 @ X0 @ ( dsetconstr @ X1 @ X2 ) ) @ X1 )
= $true ) ),
inference(trivial_inequality_removal,[status(thm)],[f84]) ).
thf(f84,plain,
! [X2: $i > $o,X0: $i,X1: $i] :
( ( ( in @ ( sK1 @ X0 @ ( dsetconstr @ X1 @ X2 ) ) @ X1 )
= $true )
| ( ( dsetconstr @ X1 @ X2 )
= X0 )
| ( ( in @ ( sK0 @ X0 @ ( dsetconstr @ X1 @ X2 ) ) @ ( dsetconstr @ X1 @ X2 ) )
!= $true )
| ( $true != $true ) ),
inference(superposition,[status(thm)],[f74,f76]) ).
thf(f76,plain,
! [X0: $i,X1: $i] :
( ( ( in @ ( sK1 @ X1 @ X0 ) @ X0 )
= $true )
| ( X0 = X1 )
| ( $true
!= ( in @ ( sK0 @ X1 @ X0 ) @ X0 ) ) ),
inference(trivial_inequality_removal,[status(thm)],[f59]) ).
thf(f59,plain,
! [X0: $i,X1: $i] :
( ( ( in @ ( sK1 @ X1 @ X0 ) @ X0 )
= $true )
| ( $true != $true )
| ( $true
!= ( in @ ( sK0 @ X1 @ X0 ) @ X0 ) )
| ( X0 = X1 ) ),
inference(definition_unfolding,[status(thm)],[f41,f52]) ).
thf(f52,plain,
setext = $true,
inference(cnf_transformation,[status(thm)],[f37]) ).
thf(f41,plain,
! [X0: $i,X1: $i] :
( ( $true
!= ( in @ ( sK0 @ X1 @ X0 ) @ X0 ) )
| ( ( in @ ( sK1 @ X1 @ X0 ) @ X0 )
= $true )
| ( X0 = X1 )
| ( setext != $true ) ),
inference(cnf_transformation,[status(thm)],[f27]) ).
thf(f27,plain,
( ( ! [X0: $i,X1: $i] :
( ( ( ( in @ ( sK0 @ X1 @ X0 ) @ X1 )
= $true )
& ( $true
!= ( in @ ( sK0 @ X1 @ X0 ) @ X0 ) ) )
| ( ( ( in @ ( sK1 @ X1 @ X0 ) @ X1 )
!= $true )
& ( ( in @ ( sK1 @ X1 @ X0 ) @ X0 )
= $true ) )
| ( X0 = X1 ) )
| ( setext != $true ) )
& ( ( setext = $true )
| ( ! [X6: $i] :
( ( ( in @ X6 @ sK3 )
!= $true )
| ( ( in @ X6 @ sK2 )
= $true ) )
& ! [X7: $i] :
( ( ( in @ X7 @ sK3 )
= $true )
| ( ( in @ X7 @ sK2 )
!= $true ) )
& ( sK2 != sK3 ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f23,f26,f25,f24]) ).
thf(f24,plain,
! [X0: $i,X1: $i] :
( ? [X2: $i] :
( ( ( in @ X2 @ X1 )
= $true )
& ( ( in @ X2 @ X0 )
!= $true ) )
=> ( ( ( in @ ( sK0 @ X1 @ X0 ) @ X1 )
= $true )
& ( $true
!= ( in @ ( sK0 @ X1 @ X0 ) @ X0 ) ) ) ),
introduced(definition,[],[choice_axiom]) ).
thf(f25,plain,
! [X0: $i,X1: $i] :
( ? [X3: $i] :
( ( ( in @ X3 @ X1 )
!= $true )
& ( ( in @ X3 @ X0 )
= $true ) )
=> ( ( ( in @ ( sK1 @ X1 @ X0 ) @ X1 )
!= $true )
& ( ( in @ ( sK1 @ X1 @ X0 ) @ X0 )
= $true ) ) ),
introduced(definition,[],[choice_axiom]) ).
thf(f26,plain,
( ? [X4: $i,X5: $i] :
( ! [X6: $i] :
( ( ( in @ X6 @ X5 )
!= $true )
| ( ( in @ X6 @ X4 )
= $true ) )
& ! [X7: $i] :
( ( ( in @ X7 @ X5 )
= $true )
| ( ( in @ X7 @ X4 )
!= $true ) )
& ( X4 != X5 ) )
=> ( ! [X6: $i] :
( ( ( in @ X6 @ sK3 )
!= $true )
| ( ( in @ X6 @ sK2 )
= $true ) )
& ! [X7: $i] :
( ( ( in @ X7 @ sK3 )
= $true )
| ( ( in @ X7 @ sK2 )
!= $true ) )
& ( sK2 != sK3 ) ) ),
introduced(definition,[],[choice_axiom]) ).
thf(f23,plain,
( ( ! [X0: $i,X1: $i] :
( ? [X2: $i] :
( ( ( in @ X2 @ X1 )
= $true )
& ( ( in @ X2 @ X0 )
!= $true ) )
| ? [X3: $i] :
( ( ( in @ X3 @ X1 )
!= $true )
& ( ( in @ X3 @ X0 )
= $true ) )
| ( X0 = X1 ) )
| ( setext != $true ) )
& ( ( setext = $true )
| ? [X4: $i,X5: $i] :
( ! [X6: $i] :
( ( ( in @ X6 @ X5 )
!= $true )
| ( ( in @ X6 @ X4 )
= $true ) )
& ! [X7: $i] :
( ( ( in @ X7 @ X5 )
= $true )
| ( ( in @ X7 @ X4 )
!= $true ) )
& ( X4 != X5 ) ) ) ),
inference(rectify,[status(thm)],[f22]) ).
thf(f22,plain,
( ( ! [X0: $i,X1: $i] :
( ? [X2: $i] :
( ( ( in @ X2 @ X1 )
= $true )
& ( ( in @ X2 @ X0 )
!= $true ) )
| ? [X3: $i] :
( ( ( in @ X3 @ X1 )
!= $true )
& ( ( in @ X3 @ X0 )
= $true ) )
| ( X0 = X1 ) )
| ( setext != $true ) )
& ( ( setext = $true )
| ? [X0: $i,X1: $i] :
( ! [X2: $i] :
( ( ( in @ X2 @ X1 )
!= $true )
| ( ( in @ X2 @ X0 )
= $true ) )
& ! [X3: $i] :
( ( ( in @ X3 @ X1 )
= $true )
| ( ( in @ X3 @ X0 )
!= $true ) )
& ( X0 != X1 ) ) ) ),
inference(nnf_transformation,[status(thm)],[f21]) ).
thf(f21,plain,
( ! [X0: $i,X1: $i] :
( ? [X2: $i] :
( ( ( in @ X2 @ X1 )
= $true )
& ( ( in @ X2 @ X0 )
!= $true ) )
| ? [X3: $i] :
( ( ( in @ X3 @ X1 )
!= $true )
& ( ( in @ X3 @ X0 )
= $true ) )
| ( X0 = X1 ) )
<=> ( setext = $true ) ),
inference(flattening,[status(thm)],[f20]) ).
thf(f20,plain,
( ( setext = $true )
<=> ! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ? [X3: $i] :
( ( ( in @ X3 @ X1 )
!= $true )
& ( ( in @ X3 @ X0 )
= $true ) )
| ? [X2: $i] :
( ( ( in @ X2 @ X1 )
= $true )
& ( ( in @ X2 @ X0 )
!= $true ) ) ) ),
inference(ennf_transformation,[status(thm)],[f12]) ).
thf(f12,plain,
( ( setext = $true )
<=> ! [X0: $i,X1: $i] :
( ! [X2: $i] :
( ( ( in @ X2 @ X1 )
= $true )
=> ( ( in @ X2 @ X0 )
= $true ) )
=> ( ! [X3: $i] :
( ( ( in @ X3 @ X0 )
= $true )
=> ( ( in @ X3 @ X1 )
= $true ) )
=> ( X0 = X1 ) ) ) ),
inference(fool_elimination,[status(thm)],[f11]) ).
thf(f11,plain,
( setext
= ( ! [X0: $i,X1: $i] :
( ! [X2: $i] :
( ( in @ X2 @ X1 )
=> ( in @ X2 @ X0 ) )
=> ( ! [X3: $i] :
( ( in @ X3 @ X0 )
=> ( in @ X3 @ X1 ) )
=> ( X0 = X1 ) ) ) ) ),
inference(rectify,[status(thm)],[f3]) ).
thf(f3,axiom,
( setext
= ( ! [X4: $i,X0: $i] :
( ! [X2: $i] :
( ( in @ X2 @ X0 )
=> ( in @ X2 @ X4 ) )
=> ( ! [X2: $i] :
( ( in @ X2 @ X4 )
=> ( in @ X2 @ X0 ) )
=> ( X0 = X4 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.xxKekWKJ8Z/DTF2THF_22880.p',setext) ).
thf(f74,plain,
! [X2: $i,X0: $i,X1: $i > $o] :
( ( $true
!= ( in @ X0 @ ( dsetconstr @ X2 @ X1 ) ) )
| ( ( in @ X0 @ X2 )
= $true ) ),
inference(beta_eta_normalization,[status(thm)],[f73]) ).
thf(f73,plain,
! [X2: $i,X0: $i,X1: $i > $o] :
( ( ( in @ X0 @ X2 )
= $true )
| ( $true
!= ( in @ X0
@ ( dsetconstr @ X2
@ ^ [Y0: $i] : ( X1 @ Y0 ) ) ) ) ),
inference(trivial_inequality_removal,[status(thm)],[f67]) ).
thf(f67,plain,
! [X2: $i,X0: $i,X1: $i > $o] :
( ( $true
!= ( in @ X0
@ ( dsetconstr @ X2
@ ^ [Y0: $i] : ( X1 @ Y0 ) ) ) )
| ( $true != $true )
| ( ( in @ X0 @ X2 )
= $true ) ),
inference(definition_unfolding,[status(thm)],[f51,f54]) ).
thf(f54,plain,
dsetconstrEL = $true,
inference(cnf_transformation,[status(thm)],[f37]) ).
thf(f51,plain,
! [X2: $i,X0: $i,X1: $i > $o] :
( ( ( in @ X0 @ X2 )
= $true )
| ( $true
!= ( in @ X0
@ ( dsetconstr @ X2
@ ^ [Y0: $i] : ( X1 @ Y0 ) ) ) )
| ( dsetconstrEL != $true ) ),
inference(cnf_transformation,[status(thm)],[f35]) ).
thf(f35,plain,
( ( ! [X0: $i,X1: $i > $o,X2: $i] :
( ( ( in @ X0 @ X2 )
= $true )
| ( $true
!= ( in @ X0
@ ( dsetconstr @ X2
@ ^ [Y0: $i] : ( X1 @ Y0 ) ) ) ) )
| ( dsetconstrEL != $true ) )
& ( ( dsetconstrEL = $true )
| ( ( ( in @ sK7 @ sK9 )
!= $true )
& ( ( in @ sK7
@ ( dsetconstr @ sK9
@ ^ [Y0: $i] : ( sK8 @ Y0 ) ) )
= $true ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK7,sK8,sK9])],[f33,f34]) ).
thf(f34,plain,
( ? [X3: $i,X4: $i > $o,X5: $i] :
( ( ( in @ X3 @ X5 )
!= $true )
& ( ( in @ X3
@ ( dsetconstr @ X5
@ ^ [Y0: $i] : ( X4 @ Y0 ) ) )
= $true ) )
=> ( ( ( in @ sK7 @ sK9 )
!= $true )
& ( ( in @ sK7
@ ( dsetconstr @ sK9
@ ^ [Y0: $i] : ( sK8 @ Y0 ) ) )
= $true ) ) ),
introduced(definition,[],[choice_axiom]) ).
thf(f33,plain,
( ( ! [X0: $i,X1: $i > $o,X2: $i] :
( ( ( in @ X0 @ X2 )
= $true )
| ( $true
!= ( in @ X0
@ ( dsetconstr @ X2
@ ^ [Y0: $i] : ( X1 @ Y0 ) ) ) ) )
| ( dsetconstrEL != $true ) )
& ( ( dsetconstrEL = $true )
| ? [X3: $i,X4: $i > $o,X5: $i] :
( ( ( in @ X3 @ X5 )
!= $true )
& ( ( in @ X3
@ ( dsetconstr @ X5
@ ^ [Y0: $i] : ( X4 @ Y0 ) ) )
= $true ) ) ) ),
inference(rectify,[status(thm)],[f32]) ).
thf(f32,plain,
( ( ! [X0: $i,X1: $i > $o,X2: $i] :
( ( ( in @ X0 @ X2 )
= $true )
| ( $true
!= ( in @ X0
@ ( dsetconstr @ X2
@ ^ [Y0: $i] : ( X1 @ Y0 ) ) ) ) )
| ( dsetconstrEL != $true ) )
& ( ( dsetconstrEL = $true )
| ? [X0: $i,X1: $i > $o,X2: $i] :
( ( ( in @ X0 @ X2 )
!= $true )
& ( $true
= ( in @ X0
@ ( dsetconstr @ X2
@ ^ [Y0: $i] : ( X1 @ Y0 ) ) ) ) ) ) ),
inference(nnf_transformation,[status(thm)],[f19]) ).
thf(f19,plain,
( ! [X0: $i,X1: $i > $o,X2: $i] :
( ( ( in @ X0 @ X2 )
= $true )
| ( $true
!= ( in @ X0
@ ( dsetconstr @ X2
@ ^ [Y0: $i] : ( X1 @ Y0 ) ) ) ) )
<=> ( dsetconstrEL = $true ) ),
inference(ennf_transformation,[status(thm)],[f10]) ).
thf(f10,plain,
( ( dsetconstrEL = $true )
<=> ! [X0: $i,X1: $i > $o,X2: $i] :
( ( $true
= ( in @ X0
@ ( dsetconstr @ X2
@ ^ [Y0: $i] : ( X1 @ Y0 ) ) ) )
=> ( ( in @ X0 @ X2 )
= $true ) ) ),
inference(fool_elimination,[status(thm)],[f9]) ).
thf(f9,plain,
! [X0: $i,X1: $i > $o,X2: $i] :
( ( ( in @ X0
@ ( dsetconstr @ X2
@ ^ [X3: $i] : ( X1 @ X3 ) ) )
=> ( in @ X0 @ X2 ) )
= dsetconstrEL ),
inference(rectify,[status(thm)],[f2]) ).
thf(f2,axiom,
! [X2: $i,X1: $i > $o,X0: $i] :
( ( ( in @ X2
@ ( dsetconstr @ X0
@ ^ [X3: $i] : ( X1 @ X3 ) ) )
=> ( in @ X2 @ X0 ) )
= dsetconstrEL ),
file('/export/starexec/sandbox/tmp/tmp.xxKekWKJ8Z/DTF2THF_22880.p',dsetconstrEL) ).
thf(f83,plain,
! [X2: $i > $o,X0: $i,X1: $i] :
( ( ( in @ ( sK1 @ X0 @ ( dsetconstr @ X1 @ X2 ) ) @ X0 )
!= $true )
| ( ( X2 @ ( sK0 @ X0 @ ( dsetconstr @ X1 @ X2 ) ) )
!= $true )
| ( ( dsetconstr @ X1 @ X2 )
= X0 )
| ( ( in @ ( sK0 @ X0 @ ( dsetconstr @ X1 @ X2 ) ) @ X1 )
!= $true ) ),
inference(trivial_inequality_removal,[status(thm)],[f82]) ).
thf(f82,plain,
! [X2: $i > $o,X0: $i,X1: $i] :
( ( ( in @ ( sK0 @ X0 @ ( dsetconstr @ X1 @ X2 ) ) @ X1 )
!= $true )
| ( ( dsetconstr @ X1 @ X2 )
= X0 )
| ( $true != $true )
| ( ( in @ ( sK1 @ X0 @ ( dsetconstr @ X1 @ X2 ) ) @ X0 )
!= $true )
| ( ( X2 @ ( sK0 @ X0 @ ( dsetconstr @ X1 @ X2 ) ) )
!= $true ) ),
inference(superposition,[status(thm)],[f75,f72]) ).
thf(f75,plain,
! [X0: $i,X1: $i] :
( ( $true
!= ( in @ ( sK0 @ X1 @ X0 ) @ X0 ) )
| ( ( in @ ( sK1 @ X1 @ X0 ) @ X1 )
!= $true )
| ( X0 = X1 ) ),
inference(trivial_inequality_removal,[status(thm)],[f58]) ).
thf(f58,plain,
! [X0: $i,X1: $i] :
( ( ( in @ ( sK1 @ X1 @ X0 ) @ X1 )
!= $true )
| ( $true
!= ( in @ ( sK0 @ X1 @ X0 ) @ X0 ) )
| ( $true != $true )
| ( X0 = X1 ) ),
inference(definition_unfolding,[status(thm)],[f42,f52]) ).
thf(f42,plain,
! [X0: $i,X1: $i] :
( ( $true
!= ( in @ ( sK0 @ X1 @ X0 ) @ X0 ) )
| ( ( in @ ( sK1 @ X1 @ X0 ) @ X1 )
!= $true )
| ( X0 = X1 )
| ( setext != $true ) ),
inference(cnf_transformation,[status(thm)],[f27]) ).
thf(f146,plain,
! [X0: $i,X1: $i > $o] :
( ( ( dsetconstr @ X0 @ X1 )
= X0 )
| ( ( X1 @ ( sK0 @ X0 @ ( dsetconstr @ X0 @ X1 ) ) )
!= $true )
| ( $true
= ( in @ ( sK0 @ X0 @ ( dsetconstr @ X0 @ X1 ) ) @ X0 ) ) ),
inference(trivial_inequality_removal,[status(thm)],[f145]) ).
thf(f145,plain,
! [X0: $i,X1: $i > $o] :
( ( $true
= ( in @ ( sK0 @ X0 @ ( dsetconstr @ X0 @ X1 ) ) @ X0 ) )
| ( ( dsetconstr @ X0 @ X1 )
= X0 )
| ( ( X1 @ ( sK0 @ X0 @ ( dsetconstr @ X0 @ X1 ) ) )
!= $true )
| ( $true != $true ) ),
inference(duplicate_literal_removal,[status(thm)],[f142]) ).
thf(f142,plain,
! [X0: $i,X1: $i > $o] :
( ( $true != $true )
| ( ( X1 @ ( sK0 @ X0 @ ( dsetconstr @ X0 @ X1 ) ) )
!= $true )
| ( ( dsetconstr @ X0 @ X1 )
= X0 )
| ( $true
= ( in @ ( sK0 @ X0 @ ( dsetconstr @ X0 @ X1 ) ) @ X0 ) )
| ( ( dsetconstr @ X0 @ X1 )
= X0 ) ),
inference(superposition,[status(thm)],[f130,f87]) ).
thf(f87,plain,
! [X2: $i > $o,X0: $i,X1: $i] :
( ( ( in @ ( sK1 @ X0 @ ( dsetconstr @ X1 @ X2 ) ) @ X1 )
= $true )
| ( ( dsetconstr @ X1 @ X2 )
= X0 )
| ( ( in @ ( sK0 @ X0 @ ( dsetconstr @ X1 @ X2 ) ) @ X0 )
= $true ) ),
inference(trivial_inequality_removal,[status(thm)],[f86]) ).
thf(f86,plain,
! [X2: $i > $o,X0: $i,X1: $i] :
( ( ( in @ ( sK0 @ X0 @ ( dsetconstr @ X1 @ X2 ) ) @ X0 )
= $true )
| ( ( in @ ( sK1 @ X0 @ ( dsetconstr @ X1 @ X2 ) ) @ X1 )
= $true )
| ( $true != $true )
| ( ( dsetconstr @ X1 @ X2 )
= X0 ) ),
inference(superposition,[status(thm)],[f74,f77]) ).
thf(f77,plain,
! [X0: $i,X1: $i] :
( ( ( in @ ( sK1 @ X1 @ X0 ) @ X0 )
= $true )
| ( X0 = X1 )
| ( ( in @ ( sK0 @ X1 @ X0 ) @ X1 )
= $true ) ),
inference(trivial_inequality_removal,[status(thm)],[f57]) ).
thf(f57,plain,
! [X0: $i,X1: $i] :
( ( ( in @ ( sK1 @ X1 @ X0 ) @ X0 )
= $true )
| ( $true != $true )
| ( X0 = X1 )
| ( ( in @ ( sK0 @ X1 @ X0 ) @ X1 )
= $true ) ),
inference(definition_unfolding,[status(thm)],[f43,f52]) ).
thf(f43,plain,
! [X0: $i,X1: $i] :
( ( ( in @ ( sK0 @ X1 @ X0 ) @ X1 )
= $true )
| ( ( in @ ( sK1 @ X1 @ X0 ) @ X0 )
= $true )
| ( X0 = X1 )
| ( setext != $true ) ),
inference(cnf_transformation,[status(thm)],[f27]) ).
thf(f130,plain,
! [X0: $i,X1: $i > $o] :
( ( ( in @ ( sK1 @ X0 @ ( dsetconstr @ X0 @ X1 ) ) @ X0 )
!= $true )
| ( ( X1 @ ( sK0 @ X0 @ ( dsetconstr @ X0 @ X1 ) ) )
!= $true )
| ( ( dsetconstr @ X0 @ X1 )
= X0 ) ),
inference(trivial_inequality_removal,[status(thm)],[f129]) ).
thf(f129,plain,
! [X0: $i,X1: $i > $o] :
( ( ( dsetconstr @ X0 @ X1 )
= X0 )
| ( ( X1 @ ( sK0 @ X0 @ ( dsetconstr @ X0 @ X1 ) ) )
!= $true )
| ( ( in @ ( sK1 @ X0 @ ( dsetconstr @ X0 @ X1 ) ) @ X0 )
!= $true )
| ( $true != $true ) ),
inference(duplicate_literal_removal,[status(thm)],[f126]) ).
thf(f126,plain,
! [X0: $i,X1: $i > $o] :
( ( ( in @ ( sK1 @ X0 @ ( dsetconstr @ X0 @ X1 ) ) @ X0 )
!= $true )
| ( ( X1 @ ( sK0 @ X0 @ ( dsetconstr @ X0 @ X1 ) ) )
!= $true )
| ( $true != $true )
| ( ( dsetconstr @ X0 @ X1 )
= X0 )
| ( ( dsetconstr @ X0 @ X1 )
= X0 ) ),
inference(superposition,[status(thm)],[f125,f70]) ).
thf(f70,plain,
! [X0: $i,X1: $i] :
( ( ( in @ ( sK0 @ X1 @ X0 ) @ X1 )
= $true )
| ( X0 = X1 )
| ( ( in @ ( sK1 @ X1 @ X0 ) @ X1 )
!= $true ) ),
inference(trivial_inequality_removal,[status(thm)],[f56]) ).
thf(f56,plain,
! [X0: $i,X1: $i] :
( ( ( in @ ( sK1 @ X1 @ X0 ) @ X1 )
!= $true )
| ( ( in @ ( sK0 @ X1 @ X0 ) @ X1 )
= $true )
| ( X0 = X1 )
| ( $true != $true ) ),
inference(definition_unfolding,[status(thm)],[f44,f52]) ).
thf(f44,plain,
! [X0: $i,X1: $i] :
( ( ( in @ ( sK0 @ X1 @ X0 ) @ X1 )
= $true )
| ( ( in @ ( sK1 @ X1 @ X0 ) @ X1 )
!= $true )
| ( X0 = X1 )
| ( setext != $true ) ),
inference(cnf_transformation,[status(thm)],[f27]) ).
thf(f53,plain,
( ( dsetconstr @ sK10
@ ^ [Y0: $i] : $true )
!= sK10 ),
inference(cnf_transformation,[status(thm)],[f37]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : SEU517^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.30 % Computer : n005.cluster.edu
% 0.11/0.30 % Model : x86_64 x86_64
% 0.11/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.30 % Memory : 8042.1875MB
% 0.11/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.30 % CPULimit : 300
% 0.11/0.30 % WCLimit : 300
% 0.11/0.30 % DateTime : Tue Feb 24 12:25:14 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 : SEU517^2 : TPTP v9.2.1. Released v3.7.0.
% 0.16/0.39 % Domain : Set Theory
% 0.16/0.39 % Problem : Preliminary Notions - Power Sets and Unions
% 0.16/0.39 % Version : Especial > Reduced > Especial.
% 0.16/0.39 % English : (! A:i.dsetconstr A (^ x:i.true) = A)
% 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 : ZFC019l [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.31 v8.1.0, 0.36 v7.5.0, 0.29 v7.4.0, 0.11 v7.2.0, 0.12 v7.1.0, 0.25 v7.0.0, 0.14 v6.4.0, 0.17 v6.3.0, 0.20 v6.2.0, 0.29 v6.1.0, 0.14 v6.0.0, 0.29 v5.5.0, 0.33 v5.4.0, 0.40 v5.3.0, 0.60 v5.2.0, 0.80 v5.0.0, 0.60 v4.1.0, 1.00 v3.7.0
% 0.16/0.39 % Syntax : Number of formulae : 9 ( 3 unt; 5 typ; 3 def)
% 0.16/0.39 % Number of atoms : 20 ( 5 equ; 0 cnn)
% 0.16/0.39 % Maximal formula atoms : 4 ( 5 avg)
% 0.16/0.39 % Number of connectives : 35 ( 0 ~; 0 |; 0 &; 25 @)
% 0.16/0.39 % ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% 0.16/0.39 % Maximal formula depth : 5 ( 2 avg)
% 0.16/0.39 % Number of types : 2 ( 0 usr)
% 0.16/0.39 % Number of type conns : 7 ( 7 >; 0 *; 0 +; 0 <<)
% 0.16/0.39 % Number of symbols : 7 ( 5 usr; 4 con; 0-2 aty)
% 0.16/0.39 % Number of variables : 14 ( 3 ^; 11 !; 0 ?; 14 :)
% 0.16/0.39 % SPC : TH0_THM_EQU_NAR
% 0.16/0.39
% 0.16/0.39 % Comments : http://mathgate.info/detsetitem.php?id=466
% 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(dsetconstrEL_type,type,
% 0.16/0.39 dsetconstrEL: $o ).
% 0.16/0.39
% 0.16/0.39 thf(dsetconstrEL,definition,
% 0.16/0.39 ( dsetconstrEL
% 0.16/0.39 = ( ! [A: $i,Xphi: $i > $o,Xx: $i] :
% 0.16/0.39 ( ( in @ Xx
% 0.16/0.39 @ ( dsetconstr @ A
% 0.16/0.39 @ ^ [Xy: $i] : ( Xphi @ Xy ) ) )
% 0.16/0.39 => ( in @ Xx @ A ) ) ) ) ).
% 0.16/0.39
% 0.16/0.39 thf(setext_type,type,
% 0.16/0.39 setext: $o ).
% 0.16/0.39
% 0.16/0.39 thf(setext,definition,
% 0.16/0.39 ( setext
% 0.16/0.39 = ( ! [A: $i,B: $i] :
% 0.16/0.39 ( ! [Xx: $i] :
% 0.16/0.39 ( ( in @ Xx @ A )
% 0.16/0.39 => ( in @ Xx @ B ) )
% 0.16/0.39 => ( ! [Xx: $i] :
% 0.16/0.39 ( ( in @ Xx @ B )
% 0.16/0.39 => ( in @ Xx @ A ) )
% 0.16/0.39 => ( A = B ) ) ) ) ) ).
% 0.16/0.39
% 0.16/0.39 thf(setoftrueEq,conjecture,
% 0.16/0.39 ( dsetconstrI
% 0.16/0.39 => ( dsetconstrEL
% 0.16/0.39 => ( setext
% 0.16/0.39 => ! [A: $i] :
% 0.16/0.39 ( ( dsetconstr @ A
% 0.16/0.39 @ ^ [Xx: $i] : $true )
% 0.16/0.39 = A ) ) ) ) ).
% 0.16/0.39
% 0.16/0.39 %------------------------------------------------------------------------------
% 0.16/0.39 ------------------------
% 1.58/1.33 ---- Embedded in THF ---
% 1.58/1.33 %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.58/1.33 %%% Generated on Tue Feb 24 12:25:15 EST 2026
% 1.58/1.33 %%% using '$$dhol' embedding, version 1.3.0.
% 1.58/1.33 %%% Logic specification used:
% 1.58/1.33 %%% thf(spec, logic, $$dhol).
% 1.58/1.33
% 1.58/1.33 % SZS output start ListOfTHF for /export/starexec/sandbox/tmp/tmp.xxKekWKJ8Z/DTF2DTF22880.p
% See solution above
% 1.58/1.33 ------------------------
% 1.58/1.34 ---- Cleaned THF ---
% 1.58/1.34 thf(in_type,type,
% 1.58/1.34 in: $i > $i > $o ).
% 1.58/1.34
% 1.58/1.34 thf(dsetconstr_type,type,
% 1.58/1.34 dsetconstr: $i > ( $i > $o ) > $i ).
% 1.58/1.34
% 1.58/1.34 thf(dsetconstrI_type,type,
% 1.58/1.34 dsetconstrI: $o ).
% 1.58/1.34
% 1.58/1.34 thf(dsetconstrI,definition,
% 1.58/1.34 ( dsetconstrI
% 1.58/1.34 = ( ! [A: $i,Xphi: $i > $o,Xx: $i] :
% 1.58/1.34 ( ( in @ Xx @ A )
% 1.58/1.34 => ( ( Xphi @ Xx )
% 1.58/1.34 => ( in @ Xx
% 1.58/1.34 @ ( dsetconstr @ A
% 1.58/1.34 @ ^ [Xy: $i] : ( Xphi @ Xy ) ) ) ) ) ) ) ).
% 1.58/1.34
% 1.58/1.34 thf(dsetconstrEL_type,type,
% 1.58/1.34 dsetconstrEL: $o ).
% 1.58/1.34
% 1.58/1.34 thf(dsetconstrEL,definition,
% 1.58/1.34 ( dsetconstrEL
% 1.58/1.34 = ( ! [A: $i,Xphi: $i > $o,Xx: $i] :
% 1.58/1.34 ( ( in @ Xx
% 1.58/1.34 @ ( dsetconstr @ A
% 1.58/1.34 @ ^ [Xy: $i] : ( Xphi @ Xy ) ) )
% 1.58/1.34 => ( in @ Xx @ A ) ) ) ) ).
% 1.58/1.34
% 1.58/1.34 thf(setext_type,type,
% 1.58/1.34 setext: $o ).
% 1.58/1.34
% 1.58/1.34 thf(setext,definition,
% 1.58/1.34 ( setext
% 1.58/1.34 = ( ! [A: $i,B: $i] :
% 1.58/1.34 ( ! [Xx: $i] :
% 1.58/1.34 ( ( in @ Xx @ A )
% 1.58/1.34 => ( in @ Xx @ B ) )
% 1.58/1.34 => ( ! [Xx: $i] :
% 1.58/1.34 ( ( in @ Xx @ B )
% 1.58/1.34 => ( in @ Xx @ A ) )
% 1.58/1.34 => ( A = B ) ) ) ) ) ).
% 1.58/1.34
% 1.58/1.34 thf(setoftrueEq,conjecture,
% 1.58/1.34 ( dsetconstrI
% 1.58/1.34 => ( dsetconstrEL
% 1.58/1.34 => ( setext
% 1.58/1.34 => ! [A: $i] :
% 1.58/1.34 ( ( dsetconstr @ A
% 1.58/1.34 @ ^ [Xx: $i] : $true )
% 1.58/1.34 = A ) ) ) ) ).
% 1.58/1.34 ------------------------
% 1.58/1.36 % (22982)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_22880 for (2999ds/2Mi)
% 1.58/1.36 % (22979)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_22880 for (2999ds/4Mi)
% 1.58/1.36 % (22980)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_22880 for (2999ds/27Mi)
% 1.58/1.36 % (22981)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on DTF2THF_22880 for (2999ds/2Mi)
% 1.58/1.36 % (22978)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on DTF2THF_22880 for (2999ds/183Mi)
% 1.58/1.36 % (22983)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_22880 for (2999ds/275Mi)
% 1.58/1.36 % (22984)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on DTF2THF_22880 for (2999ds/18Mi)
% 1.58/1.36 % (22981)Instruction limit reached!
% 1.58/1.36 % (22981)------------------------------
% 1.58/1.36 % (22981)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.58/1.36 % (22981)Termination reason: Unknown
% 1.58/1.36 % (22982)Instruction limit reached!
% 1.58/1.36 % (22982)------------------------------
% 1.58/1.36 % (22982)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.58/1.36 % (22981)Termination phase: Property scanning
% 1.58/1.36
% 1.58/1.36 % (22981)Memory used [KB]: 895
% 1.58/1.36 % (22981)Time elapsed: 0.002 s
% 1.58/1.36 % (22981)Instructions burned: 2 (million)
% 1.58/1.36 % (22981)------------------------------
% 1.58/1.36 % (22981)------------------------------
% 1.58/1.36 % (22982)Termination reason: Unknown
% 1.58/1.36 % (22982)Termination phase: Property scanning
% 1.58/1.36
% 1.58/1.36 % (22982)Memory used [KB]: 895
% 1.58/1.36 % (22982)Time elapsed: 0.002 s
% 1.58/1.36 % (22982)Instructions burned: 2 (million)
% 1.58/1.36 % (22982)------------------------------
% 1.58/1.36 % (22982)------------------------------
% 1.58/1.37 % (22979)Instruction limit reached!
% 1.58/1.37 % (22979)------------------------------
% 1.58/1.37 % (22979)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.58/1.37 % (22979)Termination reason: Unknown
% 1.58/1.37 % (22979)Termination phase: Saturation
% 1.58/1.37
% 1.58/1.37 % (22979)Memory used [KB]: 5500
% 1.58/1.37 % (22979)Time elapsed: 0.004 s
% 1.58/1.37 % (22979)Instructions burned: 5 (million)
% 1.58/1.37 % (22979)------------------------------
% 1.58/1.37 % (22979)------------------------------
% 1.58/1.37 % (22984)Instruction limit reached!
% 1.58/1.37 % (22984)------------------------------
% 1.58/1.37 % (22984)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.58/1.37 % (22984)Termination reason: Unknown
% 1.58/1.37 % (22984)Termination phase: Saturation
% 1.58/1.37
% 1.58/1.37 % (22984)Memory used [KB]: 5628
% 1.58/1.37 % (22984)Time elapsed: 0.011 s
% 1.58/1.37 % (22984)Instructions burned: 18 (million)
% 1.58/1.37 % (22984)------------------------------
% 1.58/1.37 % (22984)------------------------------
% 1.58/1.38 % (22980)Instruction limit reached!
% 1.58/1.38 % (22980)------------------------------
% 1.58/1.38 % (22980)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.58/1.38 % (22980)Termination reason: Unknown
% 1.58/1.38 % (22980)Termination phase: Saturation
% 1.58/1.38
% 1.58/1.38 % (22980)Memory used [KB]: 5628
% 1.58/1.38 % (22980)Time elapsed: 0.016 s
% 1.58/1.38 % (22980)Instructions burned: 27 (million)
% 1.58/1.38 % (22980)------------------------------
% 1.58/1.38 % (22980)------------------------------
% 1.58/1.38 % (22985)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on DTF2THF_22880 for (2999ds/3Mi)
% 1.58/1.38 % (22986)lrs+1002_1:1_cnfonf=lazy_not_be_gen:hud=14:prag=on:sp=weighted_frequency:tnu=1:i=37:si=on:rtra=on_0 on DTF2THF_22880 for (2999ds/37Mi)
% 1.58/1.38 % (22987)lrs+2_16:1_acc=model:au=on:bd=off:c=on:e2e=on:nm=2:sos=all:i=15:si=on:rtra=on_0 on DTF2THF_22880 for (2999ds/15Mi)
% 1.58/1.38 % (22985)Instruction limit reached!
% 1.58/1.38 % (22985)------------------------------
% 1.58/1.38 % (22985)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.58/1.38 % (22985)Termination reason: Unknown
% 1.58/1.38 % (22985)Termination phase: Saturation
% 1.58/1.38
% 1.58/1.38 % (22985)Memory used [KB]: 5500
% 1.58/1.38 % (22985)Time elapsed: 0.003 s
% 1.58/1.38 % (22985)Instructions burned: 3 (million)
% 1.58/1.38 % (22985)------------------------------
% 1.58/1.38 % (22985)------------------------------
% 1.58/1.38 % (22983)First to succeed.
% 1.58/1.39 % (22983)Refutation found. Thanks to Tanya!
% 1.58/1.39 % SZS status Theorem for DTF2THF_22880
% 1.58/1.39 % SZS output start Proof for DTF2THF_22880
% 1.58/1.39 thf(func_def_0, type, in: $i > $i > $o).
% 1.58/1.39 thf(func_def_1, type, dsetconstr: $i > ($i > $o) > $i).
% 1.58/1.39 thf(func_def_10, type, sK0: $i > $i > $i).
% 1.58/1.39 thf(func_def_11, type, sK1: $i > $i > $i).
% 1.58/1.39 thf(func_def_14, type, sK4: $i > $o).
% 1.58/1.39 thf(func_def_18, type, sK8: $i > $o).
% 1.58/1.39 thf(func_def_22, type, ph12: !>[X0: $tType]:(X0)).
% 1.58/1.39 thf(f207,plain,(
% 1.58/1.39 $false),
% 1.58/1.39 inference(trivial_inequality_removal,[status(thm)],[f179])).
% 1.58/1.39 thf(f179,plain,(
% 1.58/1.39 (sK10 != sK10)),
% 1.58/1.39 inference(superposition,[status(thm)],[f53,f163])).
% 1.58/1.39 thf(f163,plain,(
% 1.58/1.39 ( ! [X0 : $i] : (((dsetconstr @ X0 @ (^[Y0 : $i]: ($true))) = X0)) )),
% 1.58/1.39 inference(trivial_inequality_removal,[status(thm)],[f162])).
% 1.58/1.39 thf(f162,plain,(
% 1.58/1.39 ( ! [X0 : $i] : (($true != $true) | ((dsetconstr @ X0 @ (^[Y0 : $i]: ($true))) = X0)) )),
% 1.58/1.39 inference(beta_eta_normalization,[status(thm)],[f158])).
% 1.58/1.39 thf(f158,plain,(
% 1.58/1.39 ( ! [X0 : $i] : (((dsetconstr @ X0 @ (^[Y0 : $i]: ($true))) = X0) | (((^[Y0 : $i]: ($true)) @ (sK0 @ X0 @ (dsetconstr @ X0 @ (^[Y0 : $i]: ($true))))) != $true)) )),
% 1.58/1.39 inference(primitive_instantiation,[status(thm)],[f149])).
% 1.58/1.39 thf(f149,plain,(
% 1.58/1.39 ( ! [X0 : $i,X1 : $i > $o] : (((X1 @ (sK0 @ X0 @ (dsetconstr @ X0 @ X1))) != $true) | ((dsetconstr @ X0 @ X1) = X0)) )),
% 1.58/1.39 inference(subsumption_resolution,[status(thm)],[f146,f125])).
% 1.58/1.39 thf(f125,plain,(
% 1.58/1.39 ( ! [X0 : $i,X1 : $i > $o] : (($true != (in @ (sK0 @ X0 @ (dsetconstr @ X0 @ X1)) @ X0)) | ((X1 @ (sK0 @ X0 @ (dsetconstr @ X0 @ X1))) != $true) | ((dsetconstr @ X0 @ X1) = X0)) )),
% 1.58/1.39 inference(trivial_inequality_removal,[status(thm)],[f124])).
% 1.58/1.39 thf(f124,plain,(
% 1.58/1.39 ( ! [X0 : $i,X1 : $i > $o] : (($true != $true) | ((dsetconstr @ X0 @ X1) = X0) | ((X1 @ (sK0 @ X0 @ (dsetconstr @ X0 @ X1))) != $true) | ($true != (in @ (sK0 @ X0 @ (dsetconstr @ X0 @ X1)) @ X0))) )),
% 1.58/1.39 inference(duplicate_literal_removal,[status(thm)],[f118])).
% 1.58/1.39 thf(f118,plain,(
% 1.58/1.39 ( ! [X0 : $i,X1 : $i > $o] : (($true != (in @ (sK0 @ X0 @ (dsetconstr @ X0 @ X1)) @ X0)) | ((X1 @ (sK0 @ X0 @ (dsetconstr @ X0 @ X1))) != $true) | ((dsetconstr @ X0 @ X1) = X0) | ($true != (in @ (sK0 @ X0 @ (dsetconstr @ X0 @ X1)) @ X0)) | ((dsetconstr @ X0 @ X1) = X0) | ($true != $true) | ((X1 @ (sK0 @ X0 @ (dsetconstr @ X0 @ X1))) != $true)) )),
% 1.58/1.39 inference(superposition,[status(thm)],[f83,f100])).
% 1.58/1.39 thf(f100,plain,(
% 1.58/1.39 ( ! [X2 : $i > $o,X0 : $i,X1 : $i] : (((in @ (sK1 @ X0 @ (dsetconstr @ X1 @ X2)) @ X1) = $true) | ((in @ (sK0 @ X0 @ (dsetconstr @ X1 @ X2)) @ X1) != $true) | ((dsetconstr @ X1 @ X2) = X0) | ((X2 @ (sK0 @ X0 @ (dsetconstr @ X1 @ X2))) != $true)) )),
% 1.58/1.39 inference(trivial_inequality_removal,[status(thm)],[f99])).
% 1.58/1.39 thf(f99,plain,(
% 1.58/1.39 ( ! [X2 : $i > $o,X0 : $i,X1 : $i] : (($true != $true) | ((in @ (sK0 @ X0 @ (dsetconstr @ X1 @ X2)) @ X1) != $true) | ((dsetconstr @ X1 @ X2) = X0) | ((X2 @ (sK0 @ X0 @ (dsetconstr @ X1 @ X2))) != $true) | ((in @ (sK1 @ X0 @ (dsetconstr @ X1 @ X2)) @ X1) = $true)) )),
% 1.58/1.39 inference(superposition,[status(thm)],[f85,f72])).
% 1.58/1.39 thf(f72,plain,(
% 1.58/1.39 ( ! [X2 : $i,X0 : $i > $o,X1 : $i] : (((in @ X1 @ (dsetconstr @ X2 @ X0)) = $true) | ($true != (X0 @ X1)) | ((in @ X1 @ X2) != $true)) )),
% 1.58/1.39 inference(beta_eta_normalization,[status(thm)],[f71])).
% 1.58/1.39 thf(f71,plain,(
% 1.58/1.39 ( ! [X2 : $i,X0 : $i > $o,X1 : $i] : (((in @ X1 @ (dsetconstr @ X2 @ (^[Y0 : $i]: (X0 @ Y0)))) = $true) | ($true != (X0 @ X1)) | ((in @ X1 @ X2) != $true)) )),
% 1.58/1.39 inference(trivial_inequality_removal,[status(thm)],[f63])).
% 1.58/1.39 thf(f63,plain,(
% 1.58/1.39 ( ! [X2 : $i,X0 : $i > $o,X1 : $i] : (((in @ X1 @ (dsetconstr @ X2 @ (^[Y0 : $i]: (X0 @ Y0)))) = $true) | ($true != (X0 @ X1)) | ((in @ X1 @ X2) != $true) | ($true != $true)) )),
% 1.58/1.39 inference(definition_unfolding,[status(thm)],[f48,f55])).
% 1.58/1.39 thf(f55,plain,(
% 1.58/1.39 (dsetconstrI = $true)),
% 1.58/1.39 inference(cnf_transformation,[status(thm)],[f37])).
% 1.58/1.39 thf(f37,plain,(
% 1.58/1.39 (dsetconstrI = $true) & (dsetconstrEL = $true) & ((dsetconstr @ sK10 @ (^[Y0 : $i]: ($true))) != sK10) & (setext = $true)),
% 1.58/1.39 inference(skolemisation,[status(esa),new_symbols(skolem,[sK10])],[f16,f36])).
% 1.58/1.39 thf(f36,plain,(
% 1.58/1.39 ? [X0 : $i] : ((dsetconstr @ X0 @ (^[Y0 : $i]: ($true))) != X0) => ((dsetconstr @ sK10 @ (^[Y0 : $i]: ($true))) != sK10)),
% 1.58/1.39 introduced(definition,[],[choice_axiom])).
% 1.58/1.39 thf(f16,plain,(
% 1.58/1.39 (dsetconstrI = $true) & (dsetconstrEL = $true) & ? [X0 : $i] : ((dsetconstr @ X0 @ (^[Y0 : $i]: ($true))) != X0) & (setext = $true)),
% 1.58/1.39 inference(flattening,[status(thm)],[f15])).
% 1.58/1.39 thf(f15,plain,(
% 1.58/1.39 ((? [X0 : $i] : ((dsetconstr @ X0 @ (^[Y0 : $i]: ($true))) != X0) & (setext = $true)) & (dsetconstrEL = $true)) & (dsetconstrI = $true)),
% 1.58/1.39 inference(ennf_transformation,[status(thm)],[f8])).
% 1.58/1.39 thf(f8,plain,(
% 1.58/1.39 ~((dsetconstrI = $true) => ((dsetconstrEL = $true) => ((setext = $true) => ! [X0 : $i] : ((dsetconstr @ X0 @ (^[Y0 : $i]: ($true))) = X0))))),
% 1.58/1.39 inference(fool_elimination,[status(thm)],[f7])).
% 1.58/1.39 thf(f7,plain,(
% 1.58/1.39 ~(dsetconstrI => (dsetconstrEL => (setext => ! [X0 : $i] : ((dsetconstr @ X0 @ (^[X1 : $i] : ($true))) = X0))))),
% 1.58/1.39 inference(rectify,[status(thm)],[f5])).
% 1.58/1.39 thf(f5,negated_conjecture,(
% 1.58/1.39 ~(dsetconstrI => (dsetconstrEL => (setext => ! [X0 : $i] : ((dsetconstr @ X0 @ (^[X2 : $i] : ($true))) = X0))))),
% 1.58/1.39 inference(negated_conjecture,[status(cth)],[f4])).
% 1.58/1.39 thf(f4,conjecture,(
% 1.58/1.39 dsetconstrI => (dsetconstrEL => (setext => ! [X0 : $i] : ((dsetconstr @ X0 @ (^[X2 : $i] : ($true))) = X0)))),
% 1.58/1.39 file('/export/starexec/sandbox/tmp/tmp.xxKekWKJ8Z/DTF2THF_22880.p',setoftrueEq)).
% 1.58/1.39 thf(f48,plain,(
% 1.58/1.39 ( ! [X2 : $i,X0 : $i > $o,X1 : $i] : (((in @ X1 @ X2) != $true) | ($true != (X0 @ X1)) | ((in @ X1 @ (dsetconstr @ X2 @ (^[Y0 : $i]: (X0 @ Y0)))) = $true) | (dsetconstrI != $true)) )),
% 1.58/1.39 inference(cnf_transformation,[status(thm)],[f31])).
% 1.58/1.39 thf(f31,plain,(
% 1.58/1.39 (! [X0 : $i > $o,X1 : $i,X2 : $i] : (((in @ X1 @ X2) != $true) | ($true != (X0 @ X1)) | ((in @ X1 @ (dsetconstr @ X2 @ (^[Y0 : $i]: (X0 @ Y0)))) = $true)) | (dsetconstrI != $true)) & ((dsetconstrI = $true) | (((in @ sK5 @ sK6) = $true) & ($true = (sK4 @ sK5)) & ((in @ sK5 @ (dsetconstr @ sK6 @ (^[Y0 : $i]: (sK4 @ Y0)))) != $true)))),
% 1.58/1.39 inference(skolemisation,[status(esa),new_symbols(skolem,[sK4,sK5,sK6])],[f29,f30])).
% 1.58/1.39 thf(f30,plain,(
% 1.58/1.39 ? [X3 : $i > $o,X4 : $i,X5 : $i] : (((in @ X4 @ X5) = $true) & ((X3 @ X4) = $true) & ((in @ X4 @ (dsetconstr @ X5 @ (^[Y0 : $i]: (X3 @ Y0)))) != $true)) => (((in @ sK5 @ sK6) = $true) & ($true = (sK4 @ sK5)) & ((in @ sK5 @ (dsetconstr @ sK6 @ (^[Y0 : $i]: (sK4 @ Y0)))) != $true))),
% 1.58/1.39 introduced(definition,[],[choice_axiom])).
% 1.58/1.39 thf(f29,plain,(
% 1.58/1.39 (! [X0 : $i > $o,X1 : $i,X2 : $i] : (((in @ X1 @ X2) != $true) | ($true != (X0 @ X1)) | ((in @ X1 @ (dsetconstr @ X2 @ (^[Y0 : $i]: (X0 @ Y0)))) = $true)) | (dsetconstrI != $true)) & ((dsetconstrI = $true) | ? [X3 : $i > $o,X4 : $i,X5 : $i] : (((in @ X4 @ X5) = $true) & ((X3 @ X4) = $true) & ((in @ X4 @ (dsetconstr @ X5 @ (^[Y0 : $i]: (X3 @ Y0)))) != $true)))),
% 1.58/1.39 inference(rectify,[status(thm)],[f28])).
% 1.58/1.39 thf(f28,plain,(
% 1.58/1.39 (! [X0 : $i > $o,X1 : $i,X2 : $i] : (((in @ X1 @ X2) != $true) | ($true != (X0 @ X1)) | ((in @ X1 @ (dsetconstr @ X2 @ (^[Y0 : $i]: (X0 @ Y0)))) = $true)) | (dsetconstrI != $true)) & ((dsetconstrI = $true) | ? [X0 : $i > $o,X1 : $i,X2 : $i] : (((in @ X1 @ X2) = $true) & ($true = (X0 @ X1)) & ((in @ X1 @ (dsetconstr @ X2 @ (^[Y0 : $i]: (X0 @ Y0)))) != $true)))),
% 1.58/1.39 inference(nnf_transformation,[status(thm)],[f18])).
% 1.58/1.39 thf(f18,plain,(
% 1.58/1.39 ! [X0 : $i > $o,X1 : $i,X2 : $i] : (((in @ X1 @ X2) != $true) | ($true != (X0 @ X1)) | ((in @ X1 @ (dsetconstr @ X2 @ (^[Y0 : $i]: (X0 @ Y0)))) = $true)) <=> (dsetconstrI = $true)),
% 1.58/1.39 inference(flattening,[status(thm)],[f17])).
% 1.58/1.39 thf(f17,plain,(
% 1.58/1.39 ! [X0 : $i > $o,X1 : $i,X2 : $i] : ((((in @ X1 @ (dsetconstr @ X2 @ (^[Y0 : $i]: (X0 @ Y0)))) = $true) | ($true != (X0 @ X1))) | ((in @ X1 @ X2) != $true)) <=> (dsetconstrI = $true)),
% 1.58/1.39 inference(ennf_transformation,[status(thm)],[f14])).
% 1.58/1.39 thf(f14,plain,(
% 1.58/1.39 ! [X0 : $i > $o,X1 : $i,X2 : $i] : (((in @ X1 @ X2) = $true) => (($true = (X0 @ X1)) => ((in @ X1 @ (dsetconstr @ X2 @ (^[Y0 : $i]: (X0 @ Y0)))) = $true))) <=> (dsetconstrI = $true)),
% 1.58/1.39 inference(fool_elimination,[status(thm)],[f13])).
% 1.58/1.39 thf(f13,plain,(
% 1.58/1.39 (! [X0 : $i > $o,X1 : $i,X2 : $i] : ((in @ X1 @ X2) => ((X0 @ X1) => (in @ X1 @ (dsetconstr @ X2 @ (^[X3 : $i] : (X0 @ X3)))))) = dsetconstrI)),
% 1.58/1.39 inference(rectify,[status(thm)],[f1])).
% 1.58/1.39 thf(f1,axiom,(
% 1.58/1.39 (! [X1 : $i > $o,X2 : $i,X0 : $i] : ((in @ X2 @ X0) => ((X1 @ X2) => (in @ X2 @ (dsetconstr @ X0 @ (^[X3 : $i] : (X1 @ X3)))))) = dsetconstrI)),
% 1.58/1.39 file('/export/starexec/sandbox/tmp/tmp.xxKekWKJ8Z/DTF2THF_22880.p',dsetconstrI)).
% 1.58/1.39 thf(f85,plain,(
% 1.58/1.39 ( ! [X2 : $i > $o,X0 : $i,X1 : $i] : (((in @ (sK0 @ X0 @ (dsetconstr @ X1 @ X2)) @ (dsetconstr @ X1 @ X2)) != $true) | ((dsetconstr @ X1 @ X2) = X0) | ((in @ (sK1 @ X0 @ (dsetconstr @ X1 @ X2)) @ X1) = $true)) )),
% 1.58/1.39 inference(trivial_inequality_removal,[status(thm)],[f84])).
% 1.58/1.39 thf(f84,plain,(
% 1.58/1.39 ( ! [X2 : $i > $o,X0 : $i,X1 : $i] : (((in @ (sK1 @ X0 @ (dsetconstr @ X1 @ X2)) @ X1) = $true) | ((dsetconstr @ X1 @ X2) = X0) | ((in @ (sK0 @ X0 @ (dsetconstr @ X1 @ X2)) @ (dsetconstr @ X1 @ X2)) != $true) | ($true != $true)) )),
% 1.58/1.39 inference(superposition,[status(thm)],[f74,f76])).
% 1.58/1.39 thf(f76,plain,(
% 1.58/1.39 ( ! [X0 : $i,X1 : $i] : (((in @ (sK1 @ X1 @ X0) @ X0) = $true) | (X0 = X1) | ($true != (in @ (sK0 @ X1 @ X0) @ X0))) )),
% 1.58/1.39 inference(trivial_inequality_removal,[status(thm)],[f59])).
% 1.58/1.39 thf(f59,plain,(
% 1.58/1.39 ( ! [X0 : $i,X1 : $i] : (((in @ (sK1 @ X1 @ X0) @ X0) = $true) | ($true != $true) | ($true != (in @ (sK0 @ X1 @ X0) @ X0)) | (X0 = X1)) )),
% 1.58/1.39 inference(definition_unfolding,[status(thm)],[f41,f52])).
% 1.58/1.39 thf(f52,plain,(
% 1.58/1.39 (setext = $true)),
% 1.58/1.39 inference(cnf_transformation,[status(thm)],[f37])).
% 1.58/1.39 thf(f41,plain,(
% 1.58/1.39 ( ! [X0 : $i,X1 : $i] : (($true != (in @ (sK0 @ X1 @ X0) @ X0)) | ((in @ (sK1 @ X1 @ X0) @ X0) = $true) | (X0 = X1) | (setext != $true)) )),
% 1.58/1.39 inference(cnf_transformation,[status(thm)],[f27])).
% 1.58/1.39 thf(f27,plain,(
% 1.58/1.39 (! [X0 : $i,X1 : $i] : ((((in @ (sK0 @ X1 @ X0) @ X1) = $true) & ($true != (in @ (sK0 @ X1 @ X0) @ X0))) | (((in @ (sK1 @ X1 @ X0) @ X1) != $true) & ((in @ (sK1 @ X1 @ X0) @ X0) = $true)) | (X0 = X1)) | (setext != $true)) & ((setext = $true) | (! [X6 : $i] : (((in @ X6 @ sK3) != $true) | ((in @ X6 @ sK2) = $true)) & ! [X7 : $i] : (((in @ X7 @ sK3) = $true) | ((in @ X7 @ sK2) != $true)) & (sK2 != sK3)))),
% 1.58/1.39 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f23,f26,f25,f24])).
% 1.58/1.39 thf(f24,plain,(
% 1.58/1.39 ! [X0 : $i,X1 : $i] : (? [X2 : $i] : (((in @ X2 @ X1) = $true) & ((in @ X2 @ X0) != $true)) => (((in @ (sK0 @ X1 @ X0) @ X1) = $true) & ($true != (in @ (sK0 @ X1 @ X0) @ X0))))),
% 1.58/1.39 introduced(definition,[],[choice_axiom])).
% 1.58/1.39 thf(f25,plain,(
% 1.58/1.39 ! [X0 : $i,X1 : $i] : (? [X3 : $i] : (((in @ X3 @ X1) != $true) & ((in @ X3 @ X0) = $true)) => (((in @ (sK1 @ X1 @ X0) @ X1) != $true) & ((in @ (sK1 @ X1 @ X0) @ X0) = $true)))),
% 1.58/1.39 introduced(definition,[],[choice_axiom])).
% 1.58/1.39 thf(f26,plain,(
% 1.58/1.39 ? [X4 : $i,X5 : $i] : (! [X6 : $i] : (((in @ X6 @ X5) != $true) | ((in @ X6 @ X4) = $true)) & ! [X7 : $i] : (((in @ X7 @ X5) = $true) | ((in @ X7 @ X4) != $true)) & (X4 != X5)) => (! [X6 : $i] : (((in @ X6 @ sK3) != $true) | ((in @ X6 @ sK2) = $true)) & ! [X7 : $i] : (((in @ X7 @ sK3) = $true) | ((in @ X7 @ sK2) != $true)) & (sK2 != sK3))),
% 1.58/1.39 introduced(definition,[],[choice_axiom])).
% 1.58/1.39 thf(f23,plain,(
% 1.58/1.39 (! [X0 : $i,X1 : $i] : (? [X2 : $i] : (((in @ X2 @ X1) = $true) & ((in @ X2 @ X0) != $true)) | ? [X3 : $i] : (((in @ X3 @ X1) != $true) & ((in @ X3 @ X0) = $true)) | (X0 = X1)) | (setext != $true)) & ((setext = $true) | ? [X4 : $i,X5 : $i] : (! [X6 : $i] : (((in @ X6 @ X5) != $true) | ((in @ X6 @ X4) = $true)) & ! [X7 : $i] : (((in @ X7 @ X5) = $true) | ((in @ X7 @ X4) != $true)) & (X4 != X5)))),
% 1.58/1.39 inference(rectify,[status(thm)],[f22])).
% 1.58/1.39 thf(f22,plain,(
% 1.58/1.39 (! [X0 : $i,X1 : $i] : (? [X2 : $i] : (((in @ X2 @ X1) = $true) & ((in @ X2 @ X0) != $true)) | ? [X3 : $i] : (((in @ X3 @ X1) != $true) & ((in @ X3 @ X0) = $true)) | (X0 = X1)) | (setext != $true)) & ((setext = $true) | ? [X0 : $i,X1 : $i] : (! [X2 : $i] : (((in @ X2 @ X1) != $true) | ((in @ X2 @ X0) = $true)) & ! [X3 : $i] : (((in @ X3 @ X1) = $true) | ((in @ X3 @ X0) != $true)) & (X0 != X1)))),
% 1.58/1.39 inference(nnf_transformation,[status(thm)],[f21])).
% 1.58/1.39 thf(f21,plain,(
% 1.58/1.39 ! [X0 : $i,X1 : $i] : (? [X2 : $i] : (((in @ X2 @ X1) = $true) & ((in @ X2 @ X0) != $true)) | ? [X3 : $i] : (((in @ X3 @ X1) != $true) & ((in @ X3 @ X0) = $true)) | (X0 = X1)) <=> (setext = $true)),
% 1.58/1.39 inference(flattening,[status(thm)],[f20])).
% 1.58/1.39 thf(f20,plain,(
% 1.58/1.39 (setext = $true) <=> ! [X0 : $i,X1 : $i] : (((X0 = X1) | ? [X3 : $i] : (((in @ X3 @ X1) != $true) & ((in @ X3 @ X0) = $true))) | ? [X2 : $i] : (((in @ X2 @ X1) = $true) & ((in @ X2 @ X0) != $true)))),
% 1.58/1.39 inference(ennf_transformation,[status(thm)],[f12])).
% 1.58/1.39 thf(f12,plain,(
% 1.58/1.39 (setext = $true) <=> ! [X0 : $i,X1 : $i] : (! [X2 : $i] : (((in @ X2 @ X1) = $true) => ((in @ X2 @ X0) = $true)) => (! [X3 : $i] : (((in @ X3 @ X0) = $true) => ((in @ X3 @ X1) = $true)) => (X0 = X1)))),
% 1.58/1.39 inference(fool_elimination,[status(thm)],[f11])).
% 1.58/1.39 thf(f11,plain,(
% 1.58/1.39 (setext = ! [X0 : $i,X1 : $i] : (! [X2 : $i] : ((in @ X2 @ X1) => (in @ X2 @ X0)) => (! [X3 : $i] : ((in @ X3 @ X0) => (in @ X3 @ X1)) => (X0 = X1))))),
% 1.58/1.39 inference(rectify,[status(thm)],[f3])).
% 1.58/1.39 thf(f3,axiom,(
% 1.58/1.39 (setext = ! [X4 : $i,X0 : $i] : (! [X2 : $i] : ((in @ X2 @ X0) => (in @ X2 @ X4)) => (! [X2 : $i] : ((in @ X2 @ X4) => (in @ X2 @ X0)) => (X0 = X4))))),
% 1.58/1.39 file('/export/starexec/sandbox/tmp/tmp.xxKekWKJ8Z/DTF2THF_22880.p',setext)).
% 1.58/1.39 thf(f74,plain,(
% 1.58/1.39 ( ! [X2 : $i,X0 : $i,X1 : $i > $o] : (($true != (in @ X0 @ (dsetconstr @ X2 @ X1))) | ((in @ X0 @ X2) = $true)) )),
% 1.58/1.39 inference(beta_eta_normalization,[status(thm)],[f73])).
% 1.58/1.39 thf(f73,plain,(
% 1.58/1.39 ( ! [X2 : $i,X0 : $i,X1 : $i > $o] : (((in @ X0 @ X2) = $true) | ($true != (in @ X0 @ (dsetconstr @ X2 @ (^[Y0 : $i]: (X1 @ Y0)))))) )),
% 1.58/1.39 inference(trivial_inequality_removal,[status(thm)],[f67])).
% 1.58/1.39 thf(f67,plain,(
% 1.58/1.39 ( ! [X2 : $i,X0 : $i,X1 : $i > $o] : (($true != (in @ X0 @ (dsetconstr @ X2 @ (^[Y0 : $i]: (X1 @ Y0))))) | ($true != $true) | ((in @ X0 @ X2) = $true)) )),
% 1.58/1.39 inference(definition_unfolding,[status(thm)],[f51,f54])).
% 1.58/1.39 thf(f54,plain,(
% 1.58/1.39 (dsetconstrEL = $true)),
% 1.58/1.39 inference(cnf_transformation,[status(thm)],[f37])).
% 1.58/1.39 thf(f51,plain,(
% 1.58/1.39 ( ! [X2 : $i,X0 : $i,X1 : $i > $o] : (((in @ X0 @ X2) = $true) | ($true != (in @ X0 @ (dsetconstr @ X2 @ (^[Y0 : $i]: (X1 @ Y0))))) | (dsetconstrEL != $true)) )),
% 1.58/1.39 inference(cnf_transformation,[status(thm)],[f35])).
% 1.58/1.39 thf(f35,plain,(
% 1.58/1.39 (! [X0 : $i,X1 : $i > $o,X2 : $i] : (((in @ X0 @ X2) = $true) | ($true != (in @ X0 @ (dsetconstr @ X2 @ (^[Y0 : $i]: (X1 @ Y0)))))) | (dsetconstrEL != $true)) & ((dsetconstrEL = $true) | (((in @ sK7 @ sK9) != $true) & ((in @ sK7 @ (dsetconstr @ sK9 @ (^[Y0 : $i]: (sK8 @ Y0)))) = $true)))),
% 1.58/1.39 inference(skolemisation,[status(esa),new_symbols(skolem,[sK7,sK8,sK9])],[f33,f34])).
% 1.58/1.39 thf(f34,plain,(
% 1.58/1.39 ? [X3 : $i,X4 : $i > $o,X5 : $i] : (((in @ X3 @ X5) != $true) & ((in @ X3 @ (dsetconstr @ X5 @ (^[Y0 : $i]: (X4 @ Y0)))) = $true)) => (((in @ sK7 @ sK9) != $true) & ((in @ sK7 @ (dsetconstr @ sK9 @ (^[Y0 : $i]: (sK8 @ Y0)))) = $true))),
% 1.58/1.39 introduced(definition,[],[choice_axiom])).
% 1.58/1.39 thf(f33,plain,(
% 1.58/1.39 (! [X0 : $i,X1 : $i > $o,X2 : $i] : (((in @ X0 @ X2) = $true) | ($true != (in @ X0 @ (dsetconstr @ X2 @ (^[Y0 : $i]: (X1 @ Y0)))))) | (dsetconstrEL != $true)) & ((dsetconstrEL = $true) | ? [X3 : $i,X4 : $i > $o,X5 : $i] : (((in @ X3 @ X5) != $true) & ((in @ X3 @ (dsetconstr @ X5 @ (^[Y0 : $i]: (X4 @ Y0)))) = $true)))),
% 1.58/1.39 inference(rectify,[status(thm)],[f32])).
% 1.58/1.39 thf(f32,plain,(
% 1.58/1.39 (! [X0 : $i,X1 : $i > $o,X2 : $i] : (((in @ X0 @ X2) = $true) | ($true != (in @ X0 @ (dsetconstr @ X2 @ (^[Y0 : $i]: (X1 @ Y0)))))) | (dsetconstrEL != $true)) & ((dsetconstrEL = $true) | ? [X0 : $i,X1 : $i > $o,X2 : $i] : (((in @ X0 @ X2) != $true) & ($true = (in @ X0 @ (dsetconstr @ X2 @ (^[Y0 : $i]: (X1 @ Y0)))))))),
% 1.58/1.39 inference(nnf_transformation,[status(thm)],[f19])).
% 1.58/1.39 thf(f19,plain,(
% 1.58/1.39 ! [X0 : $i,X1 : $i > $o,X2 : $i] : (((in @ X0 @ X2) = $true) | ($true != (in @ X0 @ (dsetconstr @ X2 @ (^[Y0 : $i]: (X1 @ Y0)))))) <=> (dsetconstrEL = $true)),
% 1.58/1.39 inference(ennf_transformation,[status(thm)],[f10])).
% 1.58/1.39 thf(f10,plain,(
% 1.58/1.39 (dsetconstrEL = $true) <=> ! [X0 : $i,X1 : $i > $o,X2 : $i] : (($true = (in @ X0 @ (dsetconstr @ X2 @ (^[Y0 : $i]: (X1 @ Y0))))) => ((in @ X0 @ X2) = $true))),
% 1.58/1.39 inference(fool_elimination,[status(thm)],[f9])).
% 1.58/1.39 thf(f9,plain,(
% 1.58/1.39 (! [X0 : $i,X1 : $i > $o,X2 : $i] : ((in @ X0 @ (dsetconstr @ X2 @ (^[X3 : $i] : (X1 @ X3)))) => (in @ X0 @ X2)) = dsetconstrEL)),
% 1.58/1.39 inference(rectify,[status(thm)],[f2])).
% 1.58/1.39 thf(f2,axiom,(
% 1.58/1.39 (! [X2 : $i,X1 : $i > $o,X0 : $i] : ((in @ X2 @ (dsetconstr @ X0 @ (^[X3 : $i] : (X1 @ X3)))) => (in @ X2 @ X0)) = dsetconstrEL)),
% 1.58/1.39 file('/export/starexec/sandbox/tmp/tmp.xxKekWKJ8Z/DTF2THF_22880.p',dsetconstrEL)).
% 1.58/1.39 thf(f83,plain,(
% 1.58/1.39 ( ! [X2 : $i > $o,X0 : $i,X1 : $i] : (((in @ (sK1 @ X0 @ (dsetconstr @ X1 @ X2)) @ X0) != $true) | ((X2 @ (sK0 @ X0 @ (dsetconstr @ X1 @ X2))) != $true) | ((dsetconstr @ X1 @ X2) = X0) | ((in @ (sK0 @ X0 @ (dsetconstr @ X1 @ X2)) @ X1) != $true)) )),
% 1.58/1.39 inference(trivial_inequality_removal,[status(thm)],[f82])).
% 1.58/1.39 thf(f82,plain,(
% 1.58/1.39 ( ! [X2 : $i > $o,X0 : $i,X1 : $i] : (((in @ (sK0 @ X0 @ (dsetconstr @ X1 @ X2)) @ X1) != $true) | ((dsetconstr @ X1 @ X2) = X0) | ($true != $true) | ((in @ (sK1 @ X0 @ (dsetconstr @ X1 @ X2)) @ X0) != $true) | ((X2 @ (sK0 @ X0 @ (dsetconstr @ X1 @ X2))) != $true)) )),
% 1.58/1.39 inference(superposition,[status(thm)],[f75,f72])).
% 1.58/1.39 thf(f75,plain,(
% 1.58/1.39 ( ! [X0 : $i,X1 : $i] : (($true != (in @ (sK0 @ X1 @ X0) @ X0)) | ((in @ (sK1 @ X1 @ X0) @ X1) != $true) | (X0 = X1)) )),
% 1.58/1.39 inference(trivial_inequality_removal,[status(thm)],[f58])).
% 1.58/1.39 thf(f58,plain,(
% 1.58/1.39 ( ! [X0 : $i,X1 : $i] : (((in @ (sK1 @ X1 @ X0) @ X1) != $true) | ($true != (in @ (sK0 @ X1 @ X0) @ X0)) | ($true != $true) | (X0 = X1)) )),
% 1.58/1.39 inference(definition_unfolding,[status(thm)],[f42,f52])).
% 1.58/1.39 thf(f42,plain,(
% 1.58/1.39 ( ! [X0 : $i,X1 : $i] : (($true != (in @ (sK0 @ X1 @ X0) @ X0)) | ((in @ (sK1 @ X1 @ X0) @ X1) != $true) | (X0 = X1) | (setext != $true)) )),
% 1.58/1.39 inference(cnf_transformation,[status(thm)],[f27])).
% 1.58/1.39 thf(f146,plain,(
% 1.58/1.39 ( ! [X0 : $i,X1 : $i > $o] : (((dsetconstr @ X0 @ X1) = X0) | ((X1 @ (sK0 @ X0 @ (dsetconstr @ X0 @ X1))) != $true) | ($true = (in @ (sK0 @ X0 @ (dsetconstr @ X0 @ X1)) @ X0))) )),
% 1.58/1.39 inference(trivial_inequality_removal,[status(thm)],[f145])).
% 1.58/1.39 thf(f145,plain,(
% 1.58/1.39 ( ! [X0 : $i,X1 : $i > $o] : (($true = (in @ (sK0 @ X0 @ (dsetconstr @ X0 @ X1)) @ X0)) | ((dsetconstr @ X0 @ X1) = X0) | ((X1 @ (sK0 @ X0 @ (dsetconstr @ X0 @ X1))) != $true) | ($true != $true)) )),
% 1.58/1.39 inference(duplicate_literal_removal,[status(thm)],[f142])).
% 1.58/1.39 thf(f142,plain,(
% 1.58/1.39 ( ! [X0 : $i,X1 : $i > $o] : (($true != $true) | ((X1 @ (sK0 @ X0 @ (dsetconstr @ X0 @ X1))) != $true) | ((dsetconstr @ X0 @ X1) = X0) | ($true = (in @ (sK0 @ X0 @ (dsetconstr @ X0 @ X1)) @ X0)) | ((dsetconstr @ X0 @ X1) = X0)) )),
% 1.58/1.39 inference(superposition,[status(thm)],[f130,f87])).
% 1.58/1.39 thf(f87,plain,(
% 1.58/1.39 ( ! [X2 : $i > $o,X0 : $i,X1 : $i] : (((in @ (sK1 @ X0 @ (dsetconstr @ X1 @ X2)) @ X1) = $true) | ((dsetconstr @ X1 @ X2) = X0) | ((in @ (sK0 @ X0 @ (dsetconstr @ X1 @ X2)) @ X0) = $true)) )),
% 1.58/1.39 inference(trivial_inequality_removal,[status(thm)],[f86])).
% 1.58/1.39 thf(f86,plain,(
% 1.58/1.39 ( ! [X2 : $i > $o,X0 : $i,X1 : $i] : (((in @ (sK0 @ X0 @ (dsetconstr @ X1 @ X2)) @ X0) = $true) | ((in @ (sK1 @ X0 @ (dsetconstr @ X1 @ X2)) @ X1) = $true) | ($true != $true) | ((dsetconstr @ X1 @ X2) = X0)) )),
% 1.58/1.39 inference(superposition,[status(thm)],[f74,f77])).
% 1.58/1.39 thf(f77,plain,(
% 1.58/1.39 ( ! [X0 : $i,X1 : $i] : (((in @ (sK1 @ X1 @ X0) @ X0) = $true) | (X0 = X1) | ((in @ (sK0 @ X1 @ X0) @ X1) = $true)) )),
% 1.58/1.39 inference(trivial_inequality_removal,[status(thm)],[f57])).
% 1.58/1.39 thf(f57,plain,(
% 1.58/1.39 ( ! [X0 : $i,X1 : $i] : (((in @ (sK1 @ X1 @ X0) @ X0) = $true) | ($true != $true) | (X0 = X1) | ((in @ (sK0 @ X1 @ X0) @ X1) = $true)) )),
% 1.58/1.39 inference(definition_unfolding,[status(thm)],[f43,f52])).
% 1.58/1.39 thf(f43,plain,(
% 1.58/1.39 ( ! [X0 : $i,X1 : $i] : (((in @ (sK0 @ X1 @ X0) @ X1) = $true) | ((in @ (sK1 @ X1 @ X0) @ X0) = $true) | (X0 = X1) | (setext != $true)) )),
% 1.58/1.39 inference(cnf_transformation,[status(thm)],[f27])).
% 1.58/1.39 thf(f130,plain,(
% 1.58/1.39 ( ! [X0 : $i,X1 : $i > $o] : (((in @ (sK1 @ X0 @ (dsetconstr @ X0 @ X1)) @ X0) != $true) | ((X1 @ (sK0 @ X0 @ (dsetconstr @ X0 @ X1))) != $true) | ((dsetconstr @ X0 @ X1) = X0)) )),
% 1.58/1.39 inference(trivial_inequality_removal,[status(thm)],[f129])).
% 1.58/1.39 thf(f129,plain,(
% 1.58/1.39 ( ! [X0 : $i,X1 : $i > $o] : (((dsetconstr @ X0 @ X1) = X0) | ((X1 @ (sK0 @ X0 @ (dsetconstr @ X0 @ X1))) != $true) | ((in @ (sK1 @ X0 @ (dsetconstr @ X0 @ X1)) @ X0) != $true) | ($true != $true)) )),
% 1.58/1.39 inference(duplicate_literal_removal,[status(thm)],[f126])).
% 1.58/1.39 thf(f126,plain,(
% 1.58/1.39 ( ! [X0 : $i,X1 : $i > $o] : (((in @ (sK1 @ X0 @ (dsetconstr @ X0 @ X1)) @ X0) != $true) | ((X1 @ (sK0 @ X0 @ (dsetconstr @ X0 @ X1))) != $true) | ($true != $true) | ((dsetconstr @ X0 @ X1) = X0) | ((dsetconstr @ X0 @ X1) = X0)) )),
% 1.58/1.39 inference(superposition,[status(thm)],[f125,f70])).
% 1.58/1.39 thf(f70,plain,(
% 1.58/1.39 ( ! [X0 : $i,X1 : $i] : (((in @ (sK0 @ X1 @ X0) @ X1) = $true) | (X0 = X1) | ((in @ (sK1 @ X1 @ X0) @ X1) != $true)) )),
% 1.58/1.39 inference(trivial_inequality_removal,[status(thm)],[f56])).
% 1.58/1.39 thf(f56,plain,(
% 1.58/1.39 ( ! [X0 : $i,X1 : $i] : (((in @ (sK1 @ X1 @ X0) @ X1) != $true) | ((in @ (sK0 @ X1 @ X0) @ X1) = $true) | (X0 = X1) | ($true != $true)) )),
% 1.58/1.39 inference(definition_unfolding,[status(thm)],[f44,f52])).
% 1.58/1.39 thf(f44,plain,(
% 1.58/1.39 ( ! [X0 : $i,X1 : $i] : (((in @ (sK0 @ X1 @ X0) @ X1) = $true) | ((in @ (sK1 @ X1 @ X0) @ X1) != $true) | (X0 = X1) | (setext != $true)) )),
% 1.58/1.39 inference(cnf_transformation,[status(thm)],[f27])).
% 1.58/1.39 thf(f53,plain,(
% 1.58/1.39 ((dsetconstr @ sK10 @ (^[Y0 : $i]: ($true))) != sK10)),
% 1.58/1.39 inference(cnf_transformation,[status(thm)],[f37])).
% 1.58/1.39 % SZS output end Proof for DTF2THF_22880
% 1.58/1.39 % (22983)------------------------------
% 1.58/1.39 % (22983)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.58/1.39 % (22983)Termination reason: Refutation
% 1.58/1.39
% 1.58/1.39 % (22983)Memory used [KB]: 5628
% 1.58/1.39 % (22983)Time elapsed: 0.023 s
% 1.58/1.39 % (22983)Instructions burned: 37 (million)
% 1.58/1.39 % (22983)------------------------------
% 1.58/1.39 % (22983)------------------------------
% 1.58/1.39 % (22977)Success in time 0.036 s
%------------------------------------------------------------------------------