TSTP Solution File: SEU569^2 by Satallax---3.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Satallax---3.5
% Problem : SEU569^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 : n029.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:28 EDT 2022
% Result : Theorem 0.12s 0.35s
% Output : Proof 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 23
% Syntax : Number of formulae : 30 ( 10 unt; 4 typ; 2 def)
% Number of atoms : 55 ( 2 equ; 0 cnn)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 72 ( 10 ~; 7 |; 0 &; 36 @)
% ( 7 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 5 ( 5 >; 0 *; 0 +; 0 <<)
% Number of symbols : 15 ( 13 usr; 12 con; 0-2 aty)
% Number of variables : 13 ( 1 ^ 12 !; 0 ?; 13 :)
% Comments :
%------------------------------------------------------------------------------
thf(ty_subset,type,
subset: $i > $i > $o ).
thf(ty_eigen__1,type,
eigen__1: $i ).
thf(ty_eigen__0,type,
eigen__0: $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 @ eigen__0 ) ) ) ),
introduced(definition,[new_symbols(definition,[eigen__1])]) ).
thf(sP1,plain,
( sP1
<=> ! [X1: $i,X2: $i] :
( ! [X3: $i] :
( ( in @ X3 @ X1 )
=> ( in @ X3 @ X2 ) )
=> ( subset @ X1 @ X2 ) ) ),
introduced(definition,[new_symbols(definition,[sP1])]) ).
thf(sP2,plain,
( sP2
<=> ( in @ eigen__1 @ eigen__0 ) ),
introduced(definition,[new_symbols(definition,[sP2])]) ).
thf(sP3,plain,
( sP3
<=> ! [X1: $i] :
( ! [X2: $i] :
( ( in @ X2 @ eigen__0 )
=> ( in @ X2 @ X1 ) )
=> ( subset @ eigen__0 @ X1 ) ) ),
introduced(definition,[new_symbols(definition,[sP3])]) ).
thf(sP4,plain,
( sP4
<=> ( sP2
=> sP2 ) ),
introduced(definition,[new_symbols(definition,[sP4])]) ).
thf(sP5,plain,
( sP5
<=> ! [X1: $i] :
( ( in @ X1 @ eigen__0 )
=> ( in @ X1 @ eigen__0 ) ) ),
introduced(definition,[new_symbols(definition,[sP5])]) ).
thf(sP6,plain,
( sP6
<=> ( subset @ eigen__0 @ eigen__0 ) ),
introduced(definition,[new_symbols(definition,[sP6])]) ).
thf(sP7,plain,
( sP7
<=> ( sP5
=> sP6 ) ),
introduced(definition,[new_symbols(definition,[sP7])]) ).
thf(def_subsetI2,definition,
subsetI2 = sP1 ).
thf(subsetRefl,conjecture,
( sP1
=> ! [X1: $i] : ( subset @ X1 @ X1 ) ) ).
thf(h1,negated_conjecture,
~ ( sP1
=> ! [X1: $i] : ( subset @ X1 @ X1 ) ),
inference(assume_negation,[status(cth)],[subsetRefl]) ).
thf(h2,assumption,
sP1,
introduced(assumption,[]) ).
thf(h3,assumption,
~ ! [X1: $i] : ( subset @ X1 @ X1 ),
introduced(assumption,[]) ).
thf(h4,assumption,
~ sP6,
introduced(assumption,[]) ).
thf(1,plain,
( sP4
| ~ sP2 ),
inference(prop_rule,[status(thm)],]) ).
thf(2,plain,
( sP4
| sP2 ),
inference(prop_rule,[status(thm)],]) ).
thf(3,plain,
( sP5
| ~ sP4 ),
inference(eigen_choice_rule,[status(thm),assumptions([h0])],[h0,eigendef_eigen__1]) ).
thf(4,plain,
( ~ sP1
| sP3 ),
inference(all_rule,[status(thm)],]) ).
thf(5,plain,
( ~ sP3
| sP7 ),
inference(all_rule,[status(thm)],]) ).
thf(6,plain,
( ~ sP7
| ~ sP5
| sP6 ),
inference(prop_rule,[status(thm)],]) ).
thf(7,plain,
$false,
inference(prop_unsat,[status(thm),assumptions([h4,h2,h3,h1,h0])],[1,2,3,4,5,6,h2,h4]) ).
thf(8,plain,
$false,
inference(tab_negall,[status(thm),assumptions([h2,h3,h1,h0]),tab_negall(discharge,[h4]),tab_negall(eigenvar,eigen__0)],[h3,7,h4]) ).
thf(9,plain,
$false,
inference(tab_negimp,[status(thm),assumptions([h1,h0]),tab_negimp(discharge,[h2,h3])],[h1,8,h2,h3]) ).
thf(10,plain,
$false,
inference(eigenvar_choice,[status(thm),assumptions([h1]),eigenvar_choice(discharge,[h0])],[9,h0]) ).
thf(0,theorem,
( sP1
=> ! [X1: $i] : ( subset @ X1 @ X1 ) ),
inference(contra,[status(thm),contra(discharge,[h1])],[9,h1]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SEU569^2 : TPTP v8.1.0. Released v3.7.0.
% 0.06/0.12 % Command : satallax -E eprover-ho -P picomus -M modes -p tstp -t %d %s
% 0.12/0.33 % Computer : n029.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 : Mon Jun 20 13:30:45 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.35 % SZS status Theorem
% 0.12/0.35 % Mode: mode213
% 0.12/0.35 % Inferences: 5
% 0.12/0.35 % SZS output start Proof
% See solution above
%------------------------------------------------------------------------------