%------------------------------------------------------------------------------
% File : Satallax---3.5
% Problem : SEU596^2 : TPTP v9.2.0. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : satallax -E eprover-ho -P picomus -M modes -p tstp -t %d %s
% Computer : n002.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 : Thu Oct 9 02:43:57 PM UTC 2025
% Result : Theorem 0.13s 0.38s
% Output : Proof 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 45
% Syntax : Number of formulae : 56 ( 18 unt; 0 typ; 4 def)
% Number of atoms : 137 ( 14 equ; 0 cnn)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 230 ( 38 ~; 17 |; 0 &; 118 @)
% ( 17 <=>; 40 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 1 ( 1 >; 0 *; 0 +; 0 <<)
% Number of symbols : 29 ( 27 usr; 26 con; 0-2 aty)
% Number of variables : 40 ( 1 ^; 39 !; 0 ?; 40 :)
% Comments :
%------------------------------------------------------------------------------
thf(ty_binintersect,type,
binintersect: $i > $i > $i ).
thf(ty_eigen__2,type,
eigen__2: $i ).
thf(ty_eigen__1,type,
eigen__1: $i ).
thf(ty_eigen__0,type,
eigen__0: $i ).
thf(ty_emptyset,type,
emptyset: $i ).
thf(ty_in,type,
in: $i > $i > $o ).
thf(h0,assumption,
! [X1: $i > $o,X2: $i] :
( ( X1 @ X2 )
=> ( X1 @ ( eps__0 @ X1 ) ) ),
introduced(assumption,[]) ).
thf(eigendef_eigen__2,definition,
( eigen__2
= ( eps__0
@ ^ [X1: $i] :
~ ~ ( in @ X1 @ ( binintersect @ eigen__0 @ eigen__1 ) ) ) ),
introduced(definition,[new_symbols(definition,[eigen__2])]) ).
thf(sP1,plain,
( sP1
<=> ! [X1: $i] :
( ( in @ X1 @ eigen__0 )
=> ~ ( in @ X1 @ eigen__1 ) ) ),
introduced(definition,[new_symbols(definition,[sP1])]) ).
thf(sP2,plain,
( sP2
<=> ! [X1: $i,X2: $i] :
( ( in @ X2 @ ( binintersect @ eigen__0 @ X1 ) )
=> ( in @ X2 @ X1 ) ) ),
introduced(definition,[new_symbols(definition,[sP2])]) ).
thf(sP3,plain,
( sP3
<=> ! [X1: $i] :
( ! [X2: $i] :
~ ( in @ X2 @ X1 )
=> ( X1 = emptyset ) ) ),
introduced(definition,[new_symbols(definition,[sP3])]) ).
thf(sP4,plain,
( sP4
<=> ! [X1: $i] :
( ( in @ X1 @ ( binintersect @ eigen__0 @ eigen__1 ) )
=> ( in @ X1 @ eigen__1 ) ) ),
introduced(definition,[new_symbols(definition,[sP4])]) ).
thf(sP5,plain,
( sP5
<=> ( in @ eigen__2 @ eigen__0 ) ),
introduced(definition,[new_symbols(definition,[sP5])]) ).
thf(sP6,plain,
( sP6
<=> ( ( in @ eigen__2 @ ( binintersect @ eigen__0 @ eigen__1 ) )
=> ( in @ eigen__2 @ eigen__1 ) ) ),
introduced(definition,[new_symbols(definition,[sP6])]) ).
thf(sP7,plain,
( sP7
<=> ( ! [X1: $i] :
~ ( in @ X1 @ ( binintersect @ eigen__0 @ eigen__1 ) )
=> ( ( binintersect @ eigen__0 @ eigen__1 )
= emptyset ) ) ),
introduced(definition,[new_symbols(definition,[sP7])]) ).
thf(sP8,plain,
( sP8
<=> ( in @ eigen__2 @ eigen__1 ) ),
introduced(definition,[new_symbols(definition,[sP8])]) ).
thf(sP9,plain,
( sP9
<=> ( in @ eigen__2 @ ( binintersect @ eigen__0 @ eigen__1 ) ) ),
introduced(definition,[new_symbols(definition,[sP9])]) ).
thf(sP10,plain,
( sP10
<=> ! [X1: $i] :
( ( in @ X1 @ ( binintersect @ eigen__0 @ eigen__1 ) )
=> ( in @ X1 @ eigen__0 ) ) ),
introduced(definition,[new_symbols(definition,[sP10])]) ).
thf(sP11,plain,
( sP11
<=> ! [X1: $i,X2: $i,X3: $i] :
( ( in @ X3 @ ( binintersect @ X1 @ X2 ) )
=> ( in @ X3 @ X2 ) ) ),
introduced(definition,[new_symbols(definition,[sP11])]) ).
thf(sP12,plain,
( sP12
<=> ( sP9
=> sP5 ) ),
introduced(definition,[new_symbols(definition,[sP12])]) ).
thf(sP13,plain,
( sP13
<=> ( ( binintersect @ eigen__0 @ eigen__1 )
= emptyset ) ),
introduced(definition,[new_symbols(definition,[sP13])]) ).
thf(sP14,plain,
( sP14
<=> ( sP5
=> ~ sP8 ) ),
introduced(definition,[new_symbols(definition,[sP14])]) ).
thf(sP15,plain,
( sP15
<=> ! [X1: $i,X2: $i,X3: $i] :
( ( in @ X3 @ ( binintersect @ X1 @ X2 ) )
=> ( in @ X3 @ X1 ) ) ),
introduced(definition,[new_symbols(definition,[sP15])]) ).
thf(sP16,plain,
( sP16
<=> ! [X1: $i,X2: $i] :
( ( in @ X2 @ ( binintersect @ eigen__0 @ X1 ) )
=> ( in @ X2 @ eigen__0 ) ) ),
introduced(definition,[new_symbols(definition,[sP16])]) ).
thf(sP17,plain,
( sP17
<=> ! [X1: $i] :
~ ( in @ X1 @ ( binintersect @ eigen__0 @ eigen__1 ) ) ),
introduced(definition,[new_symbols(definition,[sP17])]) ).
thf(def_emptyI,definition,
emptyI = sP3 ).
thf(def_binintersectEL,definition,
binintersectEL = sP15 ).
thf(def_binintersectER,definition,
binintersectER = sP11 ).
thf(disjointsetsI1,conjecture,
( sP3
=> ( sP15
=> ( sP11
=> ! [X1: $i,X2: $i] :
( ! [X3: $i] :
( ( in @ X3 @ X1 )
=> ~ ( in @ X3 @ X2 ) )
=> ( ( binintersect @ X1 @ X2 )
= emptyset ) ) ) ) ) ).
thf(h1,negated_conjecture,
~ ( sP3
=> ( sP15
=> ( sP11
=> ! [X1: $i,X2: $i] :
( ! [X3: $i] :
( ( in @ X3 @ X1 )
=> ~ ( in @ X3 @ X2 ) )
=> ( ( binintersect @ X1 @ X2 )
= emptyset ) ) ) ) ),
inference(assume_negation,[status(cth)],[disjointsetsI1]) ).
thf(h2,assumption,
sP3,
introduced(assumption,[]) ).
thf(h3,assumption,
~ ( sP15
=> ( sP11
=> ! [X1: $i,X2: $i] :
( ! [X3: $i] :
( ( in @ X3 @ X1 )
=> ~ ( in @ X3 @ X2 ) )
=> ( ( binintersect @ X1 @ X2 )
= emptyset ) ) ) ),
introduced(assumption,[]) ).
thf(h4,assumption,
sP15,
introduced(assumption,[]) ).
thf(h5,assumption,
~ ( sP11
=> ! [X1: $i,X2: $i] :
( ! [X3: $i] :
( ( in @ X3 @ X1 )
=> ~ ( in @ X3 @ X2 ) )
=> ( ( binintersect @ X1 @ X2 )
= emptyset ) ) ),
introduced(assumption,[]) ).
thf(h6,assumption,
sP11,
introduced(assumption,[]) ).
thf(h7,assumption,
~ ! [X1: $i,X2: $i] :
( ! [X3: $i] :
( ( in @ X3 @ X1 )
=> ~ ( in @ X3 @ X2 ) )
=> ( ( binintersect @ X1 @ X2 )
= emptyset ) ),
introduced(assumption,[]) ).
thf(h8,assumption,
~ ! [X1: $i] :
( ! [X2: $i] :
( ( in @ X2 @ eigen__0 )
=> ~ ( in @ X2 @ X1 ) )
=> ( ( binintersect @ eigen__0 @ X1 )
= emptyset ) ),
introduced(assumption,[]) ).
thf(h9,assumption,
~ ( sP1
=> sP13 ),
introduced(assumption,[]) ).
thf(h10,assumption,
sP1,
introduced(assumption,[]) ).
thf(h11,assumption,
~ sP13,
introduced(assumption,[]) ).
thf(1,plain,
( ~ sP1
| sP14 ),
inference(all_rule,[status(thm)],[]) ).
thf(2,plain,
( ~ sP14
| ~ sP5
| ~ sP8 ),
inference(prop_rule,[status(thm)],[]) ).
thf(3,plain,
( ~ sP11
| sP2 ),
inference(all_rule,[status(thm)],[]) ).
thf(4,plain,
( ~ sP2
| sP4 ),
inference(all_rule,[status(thm)],[]) ).
thf(5,plain,
( ~ sP4
| sP6 ),
inference(all_rule,[status(thm)],[]) ).
thf(6,plain,
( ~ sP6
| ~ sP9
| sP8 ),
inference(prop_rule,[status(thm)],[]) ).
thf(7,plain,
( ~ sP15
| sP16 ),
inference(all_rule,[status(thm)],[]) ).
thf(8,plain,
( ~ sP16
| sP10 ),
inference(all_rule,[status(thm)],[]) ).
thf(9,plain,
( ~ sP10
| sP12 ),
inference(all_rule,[status(thm)],[]) ).
thf(10,plain,
( ~ sP12
| ~ sP9
| sP5 ),
inference(prop_rule,[status(thm)],[]) ).
thf(11,plain,
( sP17
| sP9 ),
inference(eigen_choice_rule,[status(thm),assumptions([h0])],[h0,eigendef_eigen__2]) ).
thf(12,plain,
( ~ sP3
| sP7 ),
inference(all_rule,[status(thm)],[]) ).
thf(13,plain,
( ~ sP7
| ~ sP17
| sP13 ),
inference(prop_rule,[status(thm)],[]) ).
thf(14,plain,
$false,
inference(prop_unsat,[status(thm),assumptions([h10,h11,h9,h8,h6,h7,h4,h5,h2,h3,h1,h0])],[1,2,3,4,5,6,7,8,9,10,11,12,13,h2,h4,h6,h10,h11]) ).
thf(15,plain,
$false,
inference(tab_negimp,[status(thm),assumptions([h9,h8,h6,h7,h4,h5,h2,h3,h1,h0]),tab_negimp(discharge,[h10,h11])],[h9,14,h10,h11]) ).
thf(16,plain,
$false,
inference(tab_negall,[status(thm),assumptions([h8,h6,h7,h4,h5,h2,h3,h1,h0]),tab_negall(discharge,[h9]),tab_negall(eigenvar,eigen__1)],[h8,15,h9]) ).
thf(17,plain,
$false,
inference(tab_negall,[status(thm),assumptions([h6,h7,h4,h5,h2,h3,h1,h0]),tab_negall(discharge,[h8]),tab_negall(eigenvar,eigen__0)],[h7,16,h8]) ).
thf(18,plain,
$false,
inference(tab_negimp,[status(thm),assumptions([h4,h5,h2,h3,h1,h0]),tab_negimp(discharge,[h6,h7])],[h5,17,h6,h7]) ).
thf(19,plain,
$false,
inference(tab_negimp,[status(thm),assumptions([h2,h3,h1,h0]),tab_negimp(discharge,[h4,h5])],[h3,18,h4,h5]) ).
thf(20,plain,
$false,
inference(tab_negimp,[status(thm),assumptions([h1,h0]),tab_negimp(discharge,[h2,h3])],[h1,19,h2,h3]) ).
thf(21,plain,
$false,
inference(eigenvar_choice,[status(thm),assumptions([h1]),eigenvar_choice(discharge,[h0])],[20,h0]) ).
thf(0,theorem,
( sP3
=> ( sP15
=> ( sP11
=> ! [X1: $i,X2: $i] :
( ! [X3: $i] :
( ( in @ X3 @ X1 )
=> ~ ( in @ X3 @ X2 ) )
=> ( ( binintersect @ X1 @ X2 )
= emptyset ) ) ) ) ),
inference(contra,[status(thm),contra(discharge,[h1])],[20,h1]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SEU596^2 : TPTP v9.2.0. Released v3.7.0.
% 0.07/0.13 % Command : satallax -E eprover-ho -P picomus -M modes -p tstp -t %d %s
% 0.13/0.35 % Computer : n002.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Wed Oct 8 21:18:53 EDT 2025
% 0.13/0.35 % CPUTime :
% 0.13/0.38 % SZS status Theorem
% 0.13/0.38 % Mode: mode213
% 0.13/0.38 % Inferences: 12
% 0.13/0.38 % SZS output start Proof
% See solution above
%------------------------------------------------------------------------------