TSTP Solution File: SEV434^1 by Satallax---3.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Satallax---3.5
% Problem : SEV434^1 : TPTP v8.1.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : satallax -E eprover-ho -P picomus -M modes -p tstp -t %d %s
% Computer : n021.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 18:06:23 EDT 2022
% Result : Theorem 0.18s 0.43s
% Output : Proof 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 60
% Syntax : Number of formulae : 72 ( 15 unt; 7 typ; 3 def)
% Number of atoms : 166 ( 39 equ; 0 cnn)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 165 ( 65 ~; 39 |; 0 &; 25 @)
% ( 22 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 2 ( 2 >; 0 *; 0 +; 0 <<)
% Number of symbols : 32 ( 30 usr; 30 con; 0-2 aty)
% Number of variables : 22 ( 3 ^ 19 !; 0 ?; 22 :)
% Comments :
%------------------------------------------------------------------------------
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_eigen__4,type,
eigen__4: $o ).
thf(ty_eigen__5,type,
eigen__5: $o ).
thf(ty_eigen__3,type,
eigen__3: $o ).
thf(ty_f,type,
f: $o > $i ).
thf(h0,assumption,
! [X1: $o > $o,X2: $o] :
( ( X1 @ X2 )
=> ( X1 @ ( eps__0 @ X1 ) ) ),
introduced(assumption,[]) ).
thf(eigendef_eigen__3,definition,
( eigen__3
= ( eps__0
@ ^ [X1: $o] :
~ ( ( ( f @ X1 )
!= eigen__0 ) ) ) ),
introduced(definition,[new_symbols(definition,[eigen__3])]) ).
thf(eigendef_eigen__4,definition,
( eigen__4
= ( eps__0
@ ^ [X1: $o] :
~ ( ( ( f @ X1 )
!= eigen__2 ) ) ) ),
introduced(definition,[new_symbols(definition,[eigen__4])]) ).
thf(eigendef_eigen__5,definition,
( eigen__5
= ( eps__0
@ ^ [X1: $o] :
~ ( ( ( f @ X1 )
!= eigen__1 ) ) ) ),
introduced(definition,[new_symbols(definition,[eigen__5])]) ).
thf(sP1,plain,
( sP1
<=> ! [X1: $o] :
( ( f @ X1 )
!= eigen__1 ) ),
introduced(definition,[new_symbols(definition,[sP1])]) ).
thf(sP2,plain,
( sP2
<=> ( eigen__0 = eigen__2 ) ),
introduced(definition,[new_symbols(definition,[sP2])]) ).
thf(sP3,plain,
( sP3
<=> eigen__3 ),
introduced(definition,[new_symbols(definition,[sP3])]) ).
thf(sP4,plain,
( sP4
<=> ( ( f @ sP3 )
= eigen__1 ) ),
introduced(definition,[new_symbols(definition,[sP4])]) ).
thf(sP5,plain,
( sP5
<=> ( ( f @ sP3 )
= eigen__2 ) ),
introduced(definition,[new_symbols(definition,[sP5])]) ).
thf(sP6,plain,
( sP6
<=> ( eigen__4 = sP3 ) ),
introduced(definition,[new_symbols(definition,[sP6])]) ).
thf(sP7,plain,
( sP7
<=> ( ( f @ eigen__4 )
= eigen__1 ) ),
introduced(definition,[new_symbols(definition,[sP7])]) ).
thf(sP8,plain,
( sP8
<=> ! [X1: $o] :
( ( f @ X1 )
!= eigen__2 ) ),
introduced(definition,[new_symbols(definition,[sP8])]) ).
thf(sP9,plain,
( sP9
<=> ( eigen__5 = sP3 ) ),
introduced(definition,[new_symbols(definition,[sP9])]) ).
thf(sP10,plain,
( sP10
<=> ( eigen__5 = eigen__4 ) ),
introduced(definition,[new_symbols(definition,[sP10])]) ).
thf(sP11,plain,
( sP11
<=> eigen__4 ),
introduced(definition,[new_symbols(definition,[sP11])]) ).
thf(sP12,plain,
( sP12
<=> ( ( f @ sP11 )
= eigen__2 ) ),
introduced(definition,[new_symbols(definition,[sP12])]) ).
thf(sP13,plain,
( sP13
<=> eigen__5 ),
introduced(definition,[new_symbols(definition,[sP13])]) ).
thf(sP14,plain,
( sP14
<=> ( ( f @ sP3 )
= eigen__0 ) ),
introduced(definition,[new_symbols(definition,[sP14])]) ).
thf(sP15,plain,
( sP15
<=> ( eigen__0 = eigen__1 ) ),
introduced(definition,[new_symbols(definition,[sP15])]) ).
thf(sP16,plain,
( sP16
<=> ( eigen__1 = eigen__2 ) ),
introduced(definition,[new_symbols(definition,[sP16])]) ).
thf(sP17,plain,
( sP17
<=> ( ( f @ sP13 )
= ( f @ sP3 ) ) ),
introduced(definition,[new_symbols(definition,[sP17])]) ).
thf(sP18,plain,
( sP18
<=> ( ( f @ sP13 )
= eigen__1 ) ),
introduced(definition,[new_symbols(definition,[sP18])]) ).
thf(sP19,plain,
( sP19
<=> ( ( f @ sP13 )
= ( f @ sP11 ) ) ),
introduced(definition,[new_symbols(definition,[sP19])]) ).
thf(sP20,plain,
( sP20
<=> ( ( f @ sP11 )
= ( f @ sP3 ) ) ),
introduced(definition,[new_symbols(definition,[sP20])]) ).
thf(sP21,plain,
( sP21
<=> ! [X1: $i] :
~ ! [X2: $o] :
( ( f @ X2 )
!= X1 ) ),
introduced(definition,[new_symbols(definition,[sP21])]) ).
thf(sP22,plain,
( sP22
<=> ! [X1: $o] :
( ( f @ X1 )
!= eigen__0 ) ),
introduced(definition,[new_symbols(definition,[sP22])]) ).
thf(less3,conjecture,
! [X1: $i,X2: $i,X3: $i] :
( ~ ( ( X1 != X2 )
=> ( X1 = X3 ) )
=> ( X2 = X3 ) ) ).
thf(h1,negated_conjecture,
~ ! [X1: $i,X2: $i,X3: $i] :
( ~ ( ( X1 != X2 )
=> ( X1 = X3 ) )
=> ( X2 = X3 ) ),
inference(assume_negation,[status(cth)],[less3]) ).
thf(h2,assumption,
~ ! [X1: $i,X2: $i] :
( ~ ( ( eigen__0 != X1 )
=> ( eigen__0 = X2 ) )
=> ( X1 = X2 ) ),
introduced(assumption,[]) ).
thf(h3,assumption,
~ ! [X1: $i] :
( ~ ( ~ sP15
=> ( eigen__0 = X1 ) )
=> ( eigen__1 = X1 ) ),
introduced(assumption,[]) ).
thf(h4,assumption,
~ ( ~ ( ~ sP15
=> sP2 )
=> sP16 ),
introduced(assumption,[]) ).
thf(h5,assumption,
~ ( ~ sP15
=> sP2 ),
introduced(assumption,[]) ).
thf(h6,assumption,
~ sP16,
introduced(assumption,[]) ).
thf(h7,assumption,
~ sP15,
introduced(assumption,[]) ).
thf(h8,assumption,
~ sP2,
introduced(assumption,[]) ).
thf(1,plain,
( sP10
| ~ sP13
| ~ sP11 ),
inference(prop_rule,[status(thm)],]) ).
thf(2,plain,
( sP10
| sP13
| sP11 ),
inference(prop_rule,[status(thm)],]) ).
thf(3,plain,
( sP6
| ~ sP11
| ~ sP3 ),
inference(prop_rule,[status(thm)],]) ).
thf(4,plain,
( sP6
| sP11
| sP3 ),
inference(prop_rule,[status(thm)],]) ).
thf(5,plain,
( sP9
| ~ sP13
| ~ sP3 ),
inference(prop_rule,[status(thm)],]) ).
thf(6,plain,
( sP9
| sP13
| sP3 ),
inference(prop_rule,[status(thm)],]) ).
thf(7,plain,
( sP19
| ~ sP10 ),
inference(prop_rule,[status(thm)],]) ).
thf(8,plain,
( sP20
| ~ sP6 ),
inference(prop_rule,[status(thm)],]) ).
thf(9,plain,
( sP17
| ~ sP9 ),
inference(prop_rule,[status(thm)],]) ).
thf(10,plain,
( ~ sP18
| sP7
| ~ sP19
| ~ sP18 ),
inference(confrontation_rule,[status(thm)],]) ).
thf(11,plain,
( ~ sP12
| sP5
| ~ sP20
| ~ sP12 ),
inference(confrontation_rule,[status(thm)],]) ).
thf(12,plain,
( ~ sP18
| sP4
| ~ sP17
| ~ sP18 ),
inference(confrontation_rule,[status(thm)],]) ).
thf(13,plain,
( ~ sP12
| sP16
| ~ sP7
| ~ sP12 ),
inference(confrontation_rule,[status(thm)],]) ).
thf(14,plain,
( ~ sP14
| sP2
| ~ sP14
| ~ sP5 ),
inference(confrontation_rule,[status(thm)],]) ).
thf(15,plain,
( ~ sP14
| sP15
| ~ sP14
| ~ sP4 ),
inference(confrontation_rule,[status(thm)],]) ).
thf(16,plain,
( sP1
| sP18 ),
inference(eigen_choice_rule,[status(thm),assumptions([h0])],[h0,eigendef_eigen__5]) ).
thf(17,plain,
( sP8
| sP12 ),
inference(eigen_choice_rule,[status(thm),assumptions([h0])],[h0,eigendef_eigen__4]) ).
thf(18,plain,
( sP22
| sP14 ),
inference(eigen_choice_rule,[status(thm),assumptions([h0])],[h0,eigendef_eigen__3]) ).
thf(19,plain,
( ~ sP21
| ~ sP1 ),
inference(all_rule,[status(thm)],]) ).
thf(20,plain,
( ~ sP21
| ~ sP8 ),
inference(all_rule,[status(thm)],]) ).
thf(21,plain,
( ~ sP21
| ~ sP22 ),
inference(all_rule,[status(thm)],]) ).
thf(fsurj,axiom,
sP21 ).
thf(22,plain,
$false,
inference(prop_unsat,[status(thm),assumptions([h7,h8,h5,h6,h4,h3,h2,h1,h0])],[1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,fsurj,h7,h8,h6]) ).
thf(23,plain,
$false,
inference(tab_negimp,[status(thm),assumptions([h5,h6,h4,h3,h2,h1,h0]),tab_negimp(discharge,[h7,h8])],[h5,22,h7,h8]) ).
thf(24,plain,
$false,
inference(tab_negimp,[status(thm),assumptions([h4,h3,h2,h1,h0]),tab_negimp(discharge,[h5,h6])],[h4,23,h5,h6]) ).
thf(25,plain,
$false,
inference(tab_negall,[status(thm),assumptions([h3,h2,h1,h0]),tab_negall(discharge,[h4]),tab_negall(eigenvar,eigen__2)],[h3,24,h4]) ).
thf(26,plain,
$false,
inference(tab_negall,[status(thm),assumptions([h2,h1,h0]),tab_negall(discharge,[h3]),tab_negall(eigenvar,eigen__1)],[h2,25,h3]) ).
thf(27,plain,
$false,
inference(tab_negall,[status(thm),assumptions([h1,h0]),tab_negall(discharge,[h2]),tab_negall(eigenvar,eigen__0)],[h1,26,h2]) ).
thf(28,plain,
$false,
inference(eigenvar_choice,[status(thm),assumptions([h1]),eigenvar_choice(discharge,[h0])],[27,h0]) ).
thf(0,theorem,
! [X1: $i,X2: $i,X3: $i] :
( ~ ( ( X1 != X2 )
=> ( X1 = X3 ) )
=> ( X2 = X3 ) ),
inference(contra,[status(thm),contra(discharge,[h1])],[27,h1]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEV434^1 : TPTP v8.1.0. Released v5.2.0.
% 0.11/0.12 % Command : satallax -E eprover-ho -P picomus -M modes -p tstp -t %d %s
% 0.12/0.33 % Computer : n021.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 27 22:35:40 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.43 % SZS status Theorem
% 0.18/0.43 % Mode: mode213
% 0.18/0.43 % Inferences: 679
% 0.18/0.43 % SZS output start Proof
% See solution above
%------------------------------------------------------------------------------