TSTP Solution File: SEU517^2 by Satallax---3.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Satallax---3.5
% Problem : SEU517^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 : n028.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:52:43 EDT 2022
% Result : Theorem 0.12s 0.36s
% Output : Proof 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 49
% Syntax : Number of formulae : 58 ( 17 unt; 4 typ; 4 def)
% Number of atoms : 154 ( 14 equ; 0 cnn)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 241 ( 46 ~; 18 |; 0 &; 120 @)
% ( 18 <=>; 39 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 10 ( 10 >; 0 *; 0 +; 0 <<)
% Number of symbols : 28 ( 26 usr; 25 con; 0-2 aty)
% Number of variables : 50 ( 21 ^ 29 !; 0 ?; 50 :)
% Comments :
%------------------------------------------------------------------------------
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__1,definition,
( eigen__1
= ( eps__0
@ ^ [X1: $i] :
~ ( ( in @ X1 @ eigen__0 )
=> ( in @ X1
@ ( dsetconstr @ eigen__0
@ ^ [X2: $i] : ~ $false ) ) ) ) ),
introduced(definition,[new_symbols(definition,[eigen__1])]) ).
thf(sP1,plain,
( sP1
<=> ! [X1: $i,X2: $i] :
( ! [X3: $i] :
( ( in @ X3 @ X1 )
=> ( in @ X3 @ X2 ) )
=> ( ! [X3: $i] :
( ( in @ X3 @ X2 )
=> ( in @ X3 @ X1 ) )
=> ( X1 = X2 ) ) ) ),
introduced(definition,[new_symbols(definition,[sP1])]) ).
thf(sP2,plain,
( sP2
<=> ( ( in @ eigen__1 @ eigen__0 )
=> ( ~ $false
=> ( in @ eigen__1
@ ( dsetconstr @ eigen__0
@ ^ [X1: $i] : ~ $false ) ) ) ) ),
introduced(definition,[new_symbols(definition,[sP2])]) ).
thf(sP3,plain,
( sP3
<=> ( ~ $false
=> ( in @ eigen__1
@ ( dsetconstr @ eigen__0
@ ^ [X1: $i] : ~ $false ) ) ) ),
introduced(definition,[new_symbols(definition,[sP3])]) ).
thf(sP4,plain,
( sP4
<=> $false ),
introduced(definition,[new_symbols(definition,[sP4])]) ).
thf(sP5,plain,
( sP5
<=> ! [X1: $i > $o,X2: $i] :
( ( in @ X2 @ ( dsetconstr @ eigen__0 @ X1 ) )
=> ( in @ X2 @ eigen__0 ) ) ),
introduced(definition,[new_symbols(definition,[sP5])]) ).
thf(sP6,plain,
( sP6
<=> ! [X1: $i > $o,X2: $i] :
( ( in @ X2 @ eigen__0 )
=> ( ( X1 @ X2 )
=> ( in @ X2 @ ( dsetconstr @ eigen__0 @ X1 ) ) ) ) ),
introduced(definition,[new_symbols(definition,[sP6])]) ).
thf(sP7,plain,
( sP7
<=> ( ! [X1: $i] :
( ( in @ X1 @ eigen__0 )
=> ( in @ X1
@ ( dsetconstr @ eigen__0
@ ^ [X2: $i] : ~ sP4 ) ) )
=> ( ( dsetconstr @ eigen__0
@ ^ [X1: $i] : ~ sP4 )
= eigen__0 ) ) ),
introduced(definition,[new_symbols(definition,[sP7])]) ).
thf(sP8,plain,
( sP8
<=> ! [X1: $i] :
( ( in @ X1 @ eigen__0 )
=> ( in @ X1
@ ( dsetconstr @ eigen__0
@ ^ [X2: $i] : ~ sP4 ) ) ) ),
introduced(definition,[new_symbols(definition,[sP8])]) ).
thf(sP9,plain,
( sP9
<=> ( ( in @ eigen__1 @ eigen__0 )
=> ( in @ eigen__1
@ ( dsetconstr @ eigen__0
@ ^ [X1: $i] : ~ sP4 ) ) ) ),
introduced(definition,[new_symbols(definition,[sP9])]) ).
thf(sP10,plain,
( sP10
<=> ( in @ eigen__1
@ ( dsetconstr @ eigen__0
@ ^ [X1: $i] : ~ sP4 ) ) ),
introduced(definition,[new_symbols(definition,[sP10])]) ).
thf(sP11,plain,
( sP11
<=> ! [X1: $i,X2: $i > $o,X3: $i] :
( ( in @ X3 @ ( dsetconstr @ X1 @ X2 ) )
=> ( in @ X3 @ X1 ) ) ),
introduced(definition,[new_symbols(definition,[sP11])]) ).
thf(sP12,plain,
( sP12
<=> ( in @ eigen__1 @ eigen__0 ) ),
introduced(definition,[new_symbols(definition,[sP12])]) ).
thf(sP13,plain,
( sP13
<=> ( ( dsetconstr @ eigen__0
@ ^ [X1: $i] : ~ sP4 )
= eigen__0 ) ),
introduced(definition,[new_symbols(definition,[sP13])]) ).
thf(sP14,plain,
( sP14
<=> ! [X1: $i] :
( ( in @ X1
@ ( dsetconstr @ eigen__0
@ ^ [X2: $i] : ~ sP4 ) )
=> ( in @ X1 @ eigen__0 ) ) ),
introduced(definition,[new_symbols(definition,[sP14])]) ).
thf(sP15,plain,
( sP15
<=> ! [X1: $i] :
( ! [X2: $i] :
( ( in @ X2
@ ( dsetconstr @ eigen__0
@ ^ [X3: $i] : ~ sP4 ) )
=> ( in @ X2 @ X1 ) )
=> ( ! [X2: $i] :
( ( in @ X2 @ X1 )
=> ( in @ X2
@ ( dsetconstr @ eigen__0
@ ^ [X3: $i] : ~ sP4 ) ) )
=> ( ( dsetconstr @ eigen__0
@ ^ [X2: $i] : ~ sP4 )
= X1 ) ) ) ),
introduced(definition,[new_symbols(definition,[sP15])]) ).
thf(sP16,plain,
( sP16
<=> ( sP14
=> sP7 ) ),
introduced(definition,[new_symbols(definition,[sP16])]) ).
thf(sP17,plain,
( sP17
<=> ! [X1: $i] :
( ( in @ X1 @ eigen__0 )
=> ( ~ sP4
=> ( in @ X1
@ ( dsetconstr @ eigen__0
@ ^ [X2: $i] : ~ sP4 ) ) ) ) ),
introduced(definition,[new_symbols(definition,[sP17])]) ).
thf(sP18,plain,
( sP18
<=> ! [X1: $i,X2: $i > $o,X3: $i] :
( ( in @ X3 @ X1 )
=> ( ( X2 @ X3 )
=> ( in @ X3 @ ( dsetconstr @ X1 @ X2 ) ) ) ) ),
introduced(definition,[new_symbols(definition,[sP18])]) ).
thf(def_dsetconstrI,definition,
dsetconstrI = sP18 ).
thf(def_dsetconstrEL,definition,
dsetconstrEL = sP11 ).
thf(def_setext,definition,
setext = sP1 ).
thf(setoftrueEq,conjecture,
( sP18
=> ( sP11
=> ( sP1
=> ! [X1: $i] :
( ( dsetconstr @ X1
@ ^ [X2: $i] : ~ sP4 )
= X1 ) ) ) ) ).
thf(h1,negated_conjecture,
~ ( sP18
=> ( sP11
=> ( sP1
=> ! [X1: $i] :
( ( dsetconstr @ X1
@ ^ [X2: $i] : ~ sP4 )
= X1 ) ) ) ),
inference(assume_negation,[status(cth)],[setoftrueEq]) ).
thf(h2,assumption,
sP18,
introduced(assumption,[]) ).
thf(h3,assumption,
~ ( sP11
=> ( sP1
=> ! [X1: $i] :
( ( dsetconstr @ X1
@ ^ [X2: $i] : ~ sP4 )
= X1 ) ) ),
introduced(assumption,[]) ).
thf(h4,assumption,
sP11,
introduced(assumption,[]) ).
thf(h5,assumption,
~ ( sP1
=> ! [X1: $i] :
( ( dsetconstr @ X1
@ ^ [X2: $i] : ~ sP4 )
= X1 ) ),
introduced(assumption,[]) ).
thf(h6,assumption,
sP1,
introduced(assumption,[]) ).
thf(h7,assumption,
~ ! [X1: $i] :
( ( dsetconstr @ X1
@ ^ [X2: $i] : ~ sP4 )
= X1 ),
introduced(assumption,[]) ).
thf(h8,assumption,
~ sP13,
introduced(assumption,[]) ).
thf(1,plain,
~ sP4,
inference(prop_rule,[status(thm)],]) ).
thf(2,plain,
( ~ sP6
| sP17 ),
inference(all_rule,[status(thm)],]) ).
thf(3,plain,
( ~ sP17
| sP2 ),
inference(all_rule,[status(thm)],]) ).
thf(4,plain,
( ~ sP2
| ~ sP12
| sP3 ),
inference(prop_rule,[status(thm)],]) ).
thf(5,plain,
( ~ sP3
| sP4
| sP10 ),
inference(prop_rule,[status(thm)],]) ).
thf(6,plain,
( sP9
| ~ sP10 ),
inference(prop_rule,[status(thm)],]) ).
thf(7,plain,
( sP9
| sP12 ),
inference(prop_rule,[status(thm)],]) ).
thf(8,plain,
( ~ sP5
| sP14 ),
inference(all_rule,[status(thm)],]) ).
thf(9,plain,
( sP8
| ~ sP9 ),
inference(eigen_choice_rule,[status(thm),assumptions([h0])],[h0,eigendef_eigen__1]) ).
thf(10,plain,
( ~ sP18
| sP6 ),
inference(all_rule,[status(thm)],]) ).
thf(11,plain,
( ~ sP11
| sP5 ),
inference(all_rule,[status(thm)],]) ).
thf(12,plain,
( ~ sP1
| sP15 ),
inference(all_rule,[status(thm)],]) ).
thf(13,plain,
( ~ sP15
| sP16 ),
inference(all_rule,[status(thm)],]) ).
thf(14,plain,
( ~ sP16
| ~ sP14
| sP7 ),
inference(prop_rule,[status(thm)],]) ).
thf(15,plain,
( ~ sP7
| ~ sP8
| sP13 ),
inference(prop_rule,[status(thm)],]) ).
thf(16,plain,
$false,
inference(prop_unsat,[status(thm),assumptions([h8,h6,h7,h4,h5,h2,h3,h1,h0])],[1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,h2,h4,h6,h8]) ).
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,
( sP18
=> ( sP11
=> ( sP1
=> ! [X1: $i] :
( ( dsetconstr @ X1
@ ^ [X2: $i] : ~ sP4 )
= X1 ) ) ) ),
inference(contra,[status(thm),contra(discharge,[h1])],[20,h1]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU517^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 : n028.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 08:11:30 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.36 % SZS status Theorem
% 0.12/0.36 % Mode: mode213
% 0.12/0.36 % Inferences: 16
% 0.12/0.36 % SZS output start Proof
% See solution above
%------------------------------------------------------------------------------