TSTP Solution File: SEU594^2 by Satallax---3.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Satallax---3.5
% Problem : SEU594^2 : TPTP v8.1.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 : n022.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 : 600s
% DateTime : Tue Jul 19 13:53:54 EDT 2022
% Result : Theorem 0.18s 0.54s
% Output : Proof 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 62
% Syntax : Number of formulae : 73 ( 20 unt; 6 typ; 5 def)
% Number of atoms : 198 ( 29 equ; 0 cnn)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 299 ( 29 ~; 22 |; 0 &; 182 @)
% ( 22 <=>; 44 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 8 ( 8 >; 0 *; 0 +; 0 <<)
% Number of symbols : 35 ( 33 usr; 31 con; 0-2 aty)
% Number of variables : 66 ( 23 ^ 43 !; 0 ?; 66 :)
% Comments :
%------------------------------------------------------------------------------
thf(ty_subset,type,
subset: $i > $i > $o ).
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_dsetconstr,type,
dsetconstr: $i > ( $i > $o ) > $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 @ eigen__1 )
=> ( in @ X1 @ eigen__0 ) ) ) ),
introduced(definition,[new_symbols(definition,[eigen__2])]) ).
thf(sP1,plain,
( sP1
<=> ( ( dsetconstr @ eigen__0
@ ^ [X1: $i] : ( in @ X1 @ eigen__1 ) )
= eigen__1 ) ),
introduced(definition,[new_symbols(definition,[sP1])]) ).
thf(sP2,plain,
( sP2
<=> ! [X1: $i] :
( ( in @ X1
@ ( dsetconstr @ eigen__0
@ ^ [X2: $i] : ( in @ X2 @ eigen__1 ) ) )
=> ( in @ X1 @ eigen__0 ) ) ),
introduced(definition,[new_symbols(definition,[sP2])]) ).
thf(sP3,plain,
( sP3
<=> ! [X1: $i,X2: $i] :
( ( in @ X2
@ ( dsetconstr @ eigen__0
@ ^ [X3: $i] : ( in @ X3 @ X1 ) ) )
=> ( in @ X2 @ eigen__0 ) ) ),
introduced(definition,[new_symbols(definition,[sP3])]) ).
thf(sP4,plain,
( sP4
<=> ! [X1: $i,X2: $i] :
( ( X1 = X2 )
=> ! [X3: $i,X4: $i] :
( ( X3 = X4 )
=> ( ( in @ X3 @ X1 )
= ( in @ X4 @ X2 ) ) ) ) ),
introduced(definition,[new_symbols(definition,[sP4])]) ).
thf(sP5,plain,
( sP5
<=> ! [X1: $i] :
( ( eigen__2 = X1 )
=> ( ( in @ eigen__2
@ ( dsetconstr @ eigen__0
@ ^ [X2: $i] : ( in @ X2 @ eigen__1 ) ) )
= ( in @ X1 @ eigen__1 ) ) ) ),
introduced(definition,[new_symbols(definition,[sP5])]) ).
thf(sP6,plain,
( sP6
<=> ( ( eigen__2 = eigen__2 )
=> ( ( in @ eigen__2
@ ( dsetconstr @ eigen__0
@ ^ [X1: $i] : ( in @ X1 @ eigen__1 ) ) )
= ( in @ eigen__2 @ eigen__1 ) ) ) ),
introduced(definition,[new_symbols(definition,[sP6])]) ).
thf(sP7,plain,
( sP7
<=> ( ( in @ eigen__2
@ ( dsetconstr @ eigen__0
@ ^ [X1: $i] : ( in @ X1 @ eigen__1 ) ) )
= ( in @ eigen__2 @ eigen__1 ) ) ),
introduced(definition,[new_symbols(definition,[sP7])]) ).
thf(sP8,plain,
( sP8
<=> ! [X1: $i] :
( ( ( dsetconstr @ eigen__0
@ ^ [X2: $i] : ( in @ X2 @ eigen__1 ) )
= X1 )
=> ! [X2: $i,X3: $i] :
( ( X2 = X3 )
=> ( ( in @ X2
@ ( dsetconstr @ eigen__0
@ ^ [X4: $i] : ( in @ X4 @ eigen__1 ) ) )
= ( in @ X3 @ X1 ) ) ) ) ),
introduced(definition,[new_symbols(definition,[sP8])]) ).
thf(sP9,plain,
( sP9
<=> ( eigen__2 = eigen__2 ) ),
introduced(definition,[new_symbols(definition,[sP9])]) ).
thf(sP10,plain,
( sP10
<=> ( ! [X1: $i] :
( ( in @ X1 @ eigen__1 )
=> ( in @ X1 @ eigen__0 ) )
=> ( subset @ eigen__1 @ eigen__0 ) ) ),
introduced(definition,[new_symbols(definition,[sP10])]) ).
thf(sP11,plain,
( sP11
<=> ( ( in @ eigen__2 @ eigen__1 )
=> ( in @ eigen__2 @ eigen__0 ) ) ),
introduced(definition,[new_symbols(definition,[sP11])]) ).
thf(sP12,plain,
( sP12
<=> ( sP1
=> ! [X1: $i,X2: $i] :
( ( X1 = X2 )
=> ( ( in @ X1
@ ( dsetconstr @ eigen__0
@ ^ [X3: $i] : ( in @ X3 @ eigen__1 ) ) )
= ( in @ X2 @ eigen__1 ) ) ) ) ),
introduced(definition,[new_symbols(definition,[sP12])]) ).
thf(sP13,plain,
( sP13
<=> ! [X1: $i,X2: $i,X3: $i] :
( ( in @ X3
@ ( dsetconstr @ X1
@ ^ [X4: $i] : ( in @ X4 @ X2 ) ) )
=> ( in @ X3 @ X1 ) ) ),
introduced(definition,[new_symbols(definition,[sP13])]) ).
thf(sP14,plain,
( sP14
<=> ( subset @ eigen__1 @ eigen__0 ) ),
introduced(definition,[new_symbols(definition,[sP14])]) ).
thf(sP15,plain,
( sP15
<=> ( in @ eigen__2
@ ( dsetconstr @ eigen__0
@ ^ [X1: $i] : ( in @ X1 @ eigen__1 ) ) ) ),
introduced(definition,[new_symbols(definition,[sP15])]) ).
thf(sP16,plain,
( sP16
<=> ! [X1: $i] :
( ( in @ X1 @ eigen__1 )
=> ( in @ X1 @ eigen__0 ) ) ),
introduced(definition,[new_symbols(definition,[sP16])]) ).
thf(sP17,plain,
( sP17
<=> ( in @ eigen__2 @ eigen__0 ) ),
introduced(definition,[new_symbols(definition,[sP17])]) ).
thf(sP18,plain,
( sP18
<=> ! [X1: $i,X2: $i] :
( ( X1 = X2 )
=> ( ( in @ X1
@ ( dsetconstr @ eigen__0
@ ^ [X3: $i] : ( in @ X3 @ eigen__1 ) ) )
= ( in @ X2 @ eigen__1 ) ) ) ),
introduced(definition,[new_symbols(definition,[sP18])]) ).
thf(sP19,plain,
( sP19
<=> ! [X1: $i] :
( ! [X2: $i] :
( ( in @ X2 @ eigen__1 )
=> ( in @ X2 @ X1 ) )
=> ( subset @ eigen__1 @ X1 ) ) ),
introduced(definition,[new_symbols(definition,[sP19])]) ).
thf(sP20,plain,
( sP20
<=> ( in @ eigen__2 @ eigen__1 ) ),
introduced(definition,[new_symbols(definition,[sP20])]) ).
thf(sP21,plain,
( sP21
<=> ( sP15
=> sP17 ) ),
introduced(definition,[new_symbols(definition,[sP21])]) ).
thf(sP22,plain,
( sP22
<=> ! [X1: $i,X2: $i] :
( ! [X3: $i] :
( ( in @ X3 @ X1 )
=> ( in @ X3 @ X2 ) )
=> ( subset @ X1 @ X2 ) ) ),
introduced(definition,[new_symbols(definition,[sP22])]) ).
thf(def_in__Cong,definition,
in__Cong = sP4 ).
thf(def_subsetI1,definition,
subsetI1 = sP22 ).
thf(def_binintersect,definition,
( binintersect
= ( ^ [X1: $i,X2: $i] :
( dsetconstr @ X1
@ ^ [X3: $i] : ( in @ X3 @ X2 ) ) ) ) ).
thf(def_binintersectEL,definition,
( binintersectEL
= ( ! [X1: $i,X2: $i,X3: $i] :
( ( in @ X3 @ ( binintersect @ X1 @ X2 ) )
=> ( in @ X3 @ X1 ) ) ) ) ).
thf(binintersectSubset3,conjecture,
( sP4
=> ( sP22
=> ( sP13
=> ! [X1: $i,X2: $i] :
( ( ( dsetconstr @ X1
@ ^ [X3: $i] : ( in @ X3 @ X2 ) )
= X2 )
=> ( subset @ X2 @ X1 ) ) ) ) ) ).
thf(h1,negated_conjecture,
~ ( sP4
=> ( sP22
=> ( sP13
=> ! [X1: $i,X2: $i] :
( ( ( dsetconstr @ X1
@ ^ [X3: $i] : ( in @ X3 @ X2 ) )
= X2 )
=> ( subset @ X2 @ X1 ) ) ) ) ),
inference(assume_negation,[status(cth)],[binintersectSubset3]) ).
thf(h2,assumption,
sP4,
introduced(assumption,[]) ).
thf(h3,assumption,
~ ( sP22
=> ( sP13
=> ! [X1: $i,X2: $i] :
( ( ( dsetconstr @ X1
@ ^ [X3: $i] : ( in @ X3 @ X2 ) )
= X2 )
=> ( subset @ X2 @ X1 ) ) ) ),
introduced(assumption,[]) ).
thf(h4,assumption,
sP22,
introduced(assumption,[]) ).
thf(h5,assumption,
~ ( sP13
=> ! [X1: $i,X2: $i] :
( ( ( dsetconstr @ X1
@ ^ [X3: $i] : ( in @ X3 @ X2 ) )
= X2 )
=> ( subset @ X2 @ X1 ) ) ),
introduced(assumption,[]) ).
thf(h6,assumption,
sP13,
introduced(assumption,[]) ).
thf(h7,assumption,
~ ! [X1: $i,X2: $i] :
( ( ( dsetconstr @ X1
@ ^ [X3: $i] : ( in @ X3 @ X2 ) )
= X2 )
=> ( subset @ X2 @ X1 ) ),
introduced(assumption,[]) ).
thf(h8,assumption,
~ ! [X1: $i] :
( ( ( dsetconstr @ eigen__0
@ ^ [X2: $i] : ( in @ X2 @ X1 ) )
= X1 )
=> ( subset @ X1 @ eigen__0 ) ),
introduced(assumption,[]) ).
thf(h9,assumption,
~ ( sP1
=> sP14 ),
introduced(assumption,[]) ).
thf(h10,assumption,
sP1,
introduced(assumption,[]) ).
thf(h11,assumption,
~ sP14,
introduced(assumption,[]) ).
thf(1,plain,
( ~ sP2
| sP21 ),
inference(all_rule,[status(thm)],]) ).
thf(2,plain,
( ~ sP21
| ~ sP15
| sP17 ),
inference(prop_rule,[status(thm)],]) ).
thf(3,plain,
( ~ sP7
| sP15
| ~ sP20 ),
inference(prop_rule,[status(thm)],]) ).
thf(4,plain,
( ~ sP6
| ~ sP9
| sP7 ),
inference(prop_rule,[status(thm)],]) ).
thf(5,plain,
( ~ sP5
| sP6 ),
inference(all_rule,[status(thm)],]) ).
thf(6,plain,
( ~ sP18
| sP5 ),
inference(all_rule,[status(thm)],]) ).
thf(7,plain,
sP9,
inference(prop_rule,[status(thm)],]) ).
thf(8,plain,
( ~ sP13
| sP3 ),
inference(all_rule,[status(thm)],]) ).
thf(9,plain,
( ~ sP3
| sP2 ),
inference(all_rule,[status(thm)],]) ).
thf(10,plain,
( sP11
| ~ sP17 ),
inference(prop_rule,[status(thm)],]) ).
thf(11,plain,
( sP11
| sP20 ),
inference(prop_rule,[status(thm)],]) ).
thf(12,plain,
( sP16
| ~ sP11 ),
inference(eigen_choice_rule,[status(thm),assumptions([h0])],[h0,eigendef_eigen__2]) ).
thf(13,plain,
( ~ sP4
| sP8 ),
inference(all_rule,[status(thm)],]) ).
thf(14,plain,
( ~ sP8
| sP12 ),
inference(all_rule,[status(thm)],]) ).
thf(15,plain,
( ~ sP12
| ~ sP1
| sP18 ),
inference(prop_rule,[status(thm)],]) ).
thf(16,plain,
( ~ sP22
| sP19 ),
inference(all_rule,[status(thm)],]) ).
thf(17,plain,
( ~ sP19
| sP10 ),
inference(all_rule,[status(thm)],]) ).
thf(18,plain,
( ~ sP10
| ~ sP16
| sP14 ),
inference(prop_rule,[status(thm)],]) ).
thf(19,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,14,15,16,17,18,h2,h4,h6,h10,h11]) ).
thf(20,plain,
$false,
inference(tab_negimp,[status(thm),assumptions([h9,h8,h6,h7,h4,h5,h2,h3,h1,h0]),tab_negimp(discharge,[h10,h11])],[h9,19,h10,h11]) ).
thf(21,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,20,h9]) ).
thf(22,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,21,h8]) ).
thf(23,plain,
$false,
inference(tab_negimp,[status(thm),assumptions([h4,h5,h2,h3,h1,h0]),tab_negimp(discharge,[h6,h7])],[h5,22,h6,h7]) ).
thf(24,plain,
$false,
inference(tab_negimp,[status(thm),assumptions([h2,h3,h1,h0]),tab_negimp(discharge,[h4,h5])],[h3,23,h4,h5]) ).
thf(25,plain,
$false,
inference(tab_negimp,[status(thm),assumptions([h1,h0]),tab_negimp(discharge,[h2,h3])],[h1,24,h2,h3]) ).
thf(26,plain,
$false,
inference(eigenvar_choice,[status(thm),assumptions([h1]),eigenvar_choice(discharge,[h0])],[25,h0]) ).
thf(0,theorem,
( sP4
=> ( sP22
=> ( sP13
=> ! [X1: $i,X2: $i] :
( ( ( dsetconstr @ X1
@ ^ [X3: $i] : ( in @ X3 @ X2 ) )
= X2 )
=> ( subset @ X2 @ X1 ) ) ) ) ),
inference(contra,[status(thm),contra(discharge,[h1])],[25,h1]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SEU594^2 : TPTP v8.1.0. Released v3.7.0.
% 0.03/0.12 % Command : satallax -E eprover-ho -P picomus -M modes -p tstp -t %d %s
% 0.12/0.33 % Computer : n022.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sun Jun 19 06:22:31 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.54 % SZS status Theorem
% 0.18/0.54 % Mode: mode213
% 0.18/0.54 % Inferences: 1416
% 0.18/0.54 % SZS output start Proof
% See solution above
%------------------------------------------------------------------------------