TSTP Solution File: SEV166^5 by Satallax---3.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Satallax---3.5
% Problem : SEV166^5 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : satallax -E eprover-ho -P picomus -M modes -p tstp -t %d %s
% Computer : n008.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:05:10 EDT 2022
% Result : Theorem 1.95s 2.19s
% Output : Proof 1.95s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 35
% Syntax : Number of formulae : 45 ( 13 unt; 6 typ; 5 def)
% Number of atoms : 107 ( 48 equ; 0 cnn)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 146 ( 41 ~; 19 |; 0 &; 63 @)
% ( 11 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 52 ( 52 >; 0 *; 0 +; 0 <<)
% Number of symbols : 20 ( 18 usr; 18 con; 0-2 aty)
% Number of variables : 46 ( 25 ^ 21 !; 0 ?; 46 :)
% Comments :
%------------------------------------------------------------------------------
thf(ty_a,type,
a: $tType ).
thf(ty_eigen__2,type,
eigen__2: a ).
thf(ty_eigen__1,type,
eigen__1: a ).
thf(ty_eigen__0,type,
eigen__0: a ).
thf(ty_eigen__5,type,
eigen__5: a > a > a ).
thf(ty_eigen__3,type,
eigen__3: a ).
thf(h0,assumption,
! [X1: a > $o,X2: a] :
( ( X1 @ X2 )
=> ( X1 @ ( eps__0 @ X1 ) ) ),
introduced(assumption,[]) ).
thf(eigendef_eigen__3,definition,
( eigen__3
= ( eps__0
@ ^ [X1: a] :
( ( ( ^ [X2: a > a > a] : ( X2 @ eigen__0 @ eigen__1 ) )
= ( ^ [X2: a > a > a] : ( X2 @ eigen__2 @ X1 ) ) )
!= ( ~ ( ( eigen__0 = eigen__2 )
=> ( eigen__1 != X1 ) ) ) ) ) ),
introduced(definition,[new_symbols(definition,[eigen__3])]) ).
thf(eigendef_eigen__1,definition,
( eigen__1
= ( eps__0
@ ^ [X1: a] :
~ ! [X2: a,X3: a] :
( ( ( ^ [X4: a > a > a] : ( X4 @ eigen__0 @ X1 ) )
= ( ^ [X4: a > a > a] : ( X4 @ X2 @ X3 ) ) )
= ( ~ ( ( eigen__0 = X2 )
=> ( X1 != X3 ) ) ) ) ) ),
introduced(definition,[new_symbols(definition,[eigen__1])]) ).
thf(eigendef_eigen__0,definition,
( eigen__0
= ( eps__0
@ ^ [X1: a] :
~ ! [X2: a,X3: a,X4: a] :
( ( ( ^ [X5: a > a > a] : ( X5 @ X1 @ X2 ) )
= ( ^ [X5: a > a > a] : ( X5 @ X3 @ X4 ) ) )
= ( ~ ( ( X1 = X3 )
=> ( X2 != X4 ) ) ) ) ) ),
introduced(definition,[new_symbols(definition,[eigen__0])]) ).
thf(eigendef_eigen__2,definition,
( eigen__2
= ( eps__0
@ ^ [X1: a] :
~ ! [X2: a] :
( ( ( ^ [X3: a > a > a] : ( X3 @ eigen__0 @ eigen__1 ) )
= ( ^ [X3: a > a > a] : ( X3 @ X1 @ X2 ) ) )
= ( ~ ( ( eigen__0 = X1 )
=> ( eigen__1 != X2 ) ) ) ) ) ),
introduced(definition,[new_symbols(definition,[eigen__2])]) ).
thf(h1,assumption,
! [X1: ( a > a > a ) > $o,X2: a > a > a] :
( ( X1 @ X2 )
=> ( X1 @ ( eps__1 @ X1 ) ) ),
introduced(assumption,[]) ).
thf(eigendef_eigen__5,definition,
( eigen__5
= ( eps__1
@ ^ [X1: a > a > a] :
( ( X1 @ eigen__0 @ eigen__1 )
!= ( X1 @ eigen__2 @ eigen__3 ) ) ) ),
introduced(definition,[new_symbols(definition,[eigen__5])]) ).
thf(sP1,plain,
( sP1
<=> ! [X1: a,X2: a,X3: a] :
( ( ( ^ [X4: a > a > a] : ( X4 @ eigen__0 @ X1 ) )
= ( ^ [X4: a > a > a] : ( X4 @ X2 @ X3 ) ) )
= ( ~ ( ( eigen__0 = X2 )
=> ( X1 != X3 ) ) ) ) ),
introduced(definition,[new_symbols(definition,[sP1])]) ).
thf(sP2,plain,
( sP2
<=> ( ( ( ^ [X1: a > a > a] : ( X1 @ eigen__0 @ eigen__1 ) )
= ( ^ [X1: a > a > a] : ( X1 @ eigen__2 @ eigen__3 ) ) )
= ( ~ ( ( eigen__0 = eigen__2 )
=> ( eigen__1 != eigen__3 ) ) ) ) ),
introduced(definition,[new_symbols(definition,[sP2])]) ).
thf(sP3,plain,
( sP3
<=> ! [X1: a > a > a] :
( ( X1 @ eigen__0 @ eigen__1 )
= ( X1 @ eigen__2 @ eigen__3 ) ) ),
introduced(definition,[new_symbols(definition,[sP3])]) ).
thf(sP4,plain,
( sP4
<=> ( ( eigen__5 @ eigen__0 @ eigen__1 )
= ( eigen__5 @ eigen__2 @ eigen__3 ) ) ),
introduced(definition,[new_symbols(definition,[sP4])]) ).
thf(sP5,plain,
( sP5
<=> ( ( eigen__0 = eigen__2 )
=> ( eigen__1 != eigen__3 ) ) ),
introduced(definition,[new_symbols(definition,[sP5])]) ).
thf(sP6,plain,
( sP6
<=> ! [X1: a,X2: a] :
( ( ( ^ [X3: a > a > a] : ( X3 @ eigen__0 @ eigen__1 ) )
= ( ^ [X3: a > a > a] : ( X3 @ X1 @ X2 ) ) )
= ( ~ ( ( eigen__0 = X1 )
=> ( eigen__1 != X2 ) ) ) ) ),
introduced(definition,[new_symbols(definition,[sP6])]) ).
thf(sP7,plain,
( sP7
<=> ! [X1: a,X2: a,X3: a,X4: a] :
( ( ( ^ [X5: a > a > a] : ( X5 @ X1 @ X2 ) )
= ( ^ [X5: a > a > a] : ( X5 @ X3 @ X4 ) ) )
= ( ~ ( ( X1 = X3 )
=> ( X2 != X4 ) ) ) ) ),
introduced(definition,[new_symbols(definition,[sP7])]) ).
thf(sP8,plain,
( sP8
<=> ( ( ^ [X1: a > a > a] : ( X1 @ eigen__0 @ eigen__1 ) )
= ( ^ [X1: a > a > a] : ( X1 @ eigen__2 @ eigen__3 ) ) ) ),
introduced(definition,[new_symbols(definition,[sP8])]) ).
thf(sP9,plain,
( sP9
<=> ( eigen__1 = eigen__3 ) ),
introduced(definition,[new_symbols(definition,[sP9])]) ).
thf(sP10,plain,
( sP10
<=> ( eigen__0 = eigen__2 ) ),
introduced(definition,[new_symbols(definition,[sP10])]) ).
thf(sP11,plain,
( sP11
<=> ! [X1: a] :
( ( ( ^ [X2: a > a > a] : ( X2 @ eigen__0 @ eigen__1 ) )
= ( ^ [X2: a > a > a] : ( X2 @ eigen__2 @ X1 ) ) )
= ( ~ ( sP10
=> ( eigen__1 != X1 ) ) ) ) ),
introduced(definition,[new_symbols(definition,[sP11])]) ).
thf(cTHM182_pme,conjecture,
sP7 ).
thf(h2,negated_conjecture,
~ sP7,
inference(assume_negation,[status(cth)],[cTHM182_pme]) ).
thf(1,plain,
( sP5
| sP9 ),
inference(prop_rule,[status(thm)],]) ).
thf(2,plain,
( sP5
| sP10 ),
inference(prop_rule,[status(thm)],]) ).
thf(3,plain,
( sP4
| ~ sP10
| ~ sP9 ),
inference(prop_rule,[status(thm)],]) ).
thf(4,plain,
( sP3
| ~ sP4 ),
inference(eigen_choice_rule,[status(thm),assumptions([h1])],[h1,eigendef_eigen__5]) ).
thf(5,plain,
( sP8
| ~ sP3 ),
inference(prop_rule,[status(thm)],]) ).
thf(6,plain,
( ~ sP3
| sP9 ),
inference(all_rule,[status(thm)],]) ).
thf(7,plain,
( ~ sP3
| sP10 ),
inference(all_rule,[status(thm)],]) ).
thf(8,plain,
( ~ sP8
| sP3 ),
inference(prop_rule,[status(thm)],]) ).
thf(9,plain,
( ~ sP5
| ~ sP10
| ~ sP9 ),
inference(prop_rule,[status(thm)],]) ).
thf(10,plain,
( sP2
| ~ sP8
| sP5 ),
inference(prop_rule,[status(thm)],]) ).
thf(11,plain,
( sP2
| sP8
| ~ sP5 ),
inference(prop_rule,[status(thm)],]) ).
thf(12,plain,
( sP11
| ~ sP2 ),
inference(eigen_choice_rule,[status(thm),assumptions([h0])],[h0,eigendef_eigen__3]) ).
thf(13,plain,
( sP6
| ~ sP11 ),
inference(eigen_choice_rule,[status(thm),assumptions([h0])],[h0,eigendef_eigen__2]) ).
thf(14,plain,
( sP1
| ~ sP6 ),
inference(eigen_choice_rule,[status(thm),assumptions([h0])],[h0,eigendef_eigen__1]) ).
thf(15,plain,
( sP7
| ~ sP1 ),
inference(eigen_choice_rule,[status(thm),assumptions([h0])],[h0,eigendef_eigen__0]) ).
thf(16,plain,
$false,
inference(prop_unsat,[status(thm),assumptions([h2,h1,h0])],[1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,h2]) ).
thf(17,plain,
$false,
inference(eigenvar_choice,[status(thm),assumptions([h2,h0]),eigenvar_choice(discharge,[h1])],[16,h1]) ).
thf(18,plain,
$false,
inference(eigenvar_choice,[status(thm),assumptions([h2]),eigenvar_choice(discharge,[h0])],[17,h0]) ).
thf(0,theorem,
sP7,
inference(contra,[status(thm),contra(discharge,[h2])],[16,h2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEV166^5 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12 % Command : satallax -E eprover-ho -P picomus -M modes -p tstp -t %d %s
% 0.12/0.33 % Computer : n008.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 : Tue Jun 28 12:41:23 EDT 2022
% 0.18/0.33 % CPUTime :
% 1.95/2.19 % SZS status Theorem
% 1.95/2.19 % Mode: mode506
% 1.95/2.19 % Inferences: 19460
% 1.95/2.19 % SZS output start Proof
% See solution above
%------------------------------------------------------------------------------