%------------------------------------------------------------------------------
% File : Satallax---3.5
% Problem : SYN997^1 : TPTP v9.2.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 : n017.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 : 300s
% DateTime : Thu Oct 9 03:19:01 PM UTC 2025
% Result : Theorem 1.10s 1.29s
% Output : Proof 1.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 12
% Syntax : Number of formulae : 17 ( 9 unt; 0 typ; 1 def)
% Number of atoms : 29 ( 1 equ; 0 cnn)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 50 ( 18 ~; 5 |; 0 &; 17 @)
% ( 5 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 8 ( 8 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 7 usr; 7 con; 0-2 aty)
% Number of variables : 14 ( 1 ^; 10 !; 0 ?; 14 :)
% ( 0 !>; 0 ?*; 0 @-; 3 @+)
% Comments :
%------------------------------------------------------------------------------
thf(ty_eigen__1,type,
eigen__1: $i > $o ).
thf(h0,assumption,
! [X1: ( $i > $o ) > $o,X2: $i > $o] :
( ( X1 @ X2 )
=> ( X1 @ ( eps__0 @ X1 ) ) ),
introduced(assumption,[]) ).
thf(eigendef_eigen__1,definition,
( eigen__1
= ( eps__0
@ ^ [X1: $i > $o] :
~ ( ~ ! [X2: $i] :
~ ( X1 @ X2 )
=> ( X1
@ @+[X2: $i] : ( X1 @ X2 ) ) ) ) ),
introduced(definition,[new_symbols(definition,[eigen__1])]) ).
thf(sP1,plain,
( sP1
<=> ! [X1: $i > $o] :
( ~ ! [X2: $i] :
~ ( X1 @ X2 )
=> ( X1
@ @+[X2: $i] : ( X1 @ X2 ) ) ) ),
introduced(definition,[new_symbols(definition,[sP1])]) ).
thf(sP2,plain,
( sP2
<=> ( eigen__1
@ @+[X1: $i] : ( eigen__1 @ X1 ) ) ),
introduced(definition,[new_symbols(definition,[sP2])]) ).
thf(sP3,plain,
( sP3
<=> ( ~ ! [X1: $i] :
~ ( eigen__1 @ X1 )
=> sP2 ) ),
introduced(definition,[new_symbols(definition,[sP3])]) ).
thf(sP4,plain,
( sP4
<=> ! [X1: ( $i > $o ) > $i] :
~ ! [X2: $i > $o] :
( ~ ! [X3: $i] :
~ ( X2 @ X3 )
=> ( X2 @ ( X1 @ X2 ) ) ) ),
introduced(definition,[new_symbols(definition,[sP4])]) ).
thf(sP5,plain,
( sP5
<=> ! [X1: $i] :
~ ( eigen__1 @ X1 ) ),
introduced(definition,[new_symbols(definition,[sP5])]) ).
thf(conj,conjecture,
~ sP4 ).
thf(h1,negated_conjecture,
sP4,
inference(assume_negation,[status(cth)],[conj]) ).
thf(1,plain,
( sP2
| sP5 ),
inference(choice_rule,[status(thm)],[]) ).
thf(2,plain,
( sP3
| ~ sP2 ),
inference(prop_rule,[status(thm)],[]) ).
thf(3,plain,
( sP3
| ~ sP5 ),
inference(prop_rule,[status(thm)],[]) ).
thf(4,plain,
( sP1
| ~ sP3 ),
inference(eigen_choice_rule,[status(thm),assumptions([h0])],[h0,eigendef_eigen__1]) ).
thf(5,plain,
( ~ sP4
| ~ sP1 ),
inference(all_rule,[status(thm)],[]) ).
thf(6,plain,
$false,
inference(prop_unsat,[status(thm),assumptions([h1,h0])],[1,2,3,4,5,h1]) ).
thf(7,plain,
$false,
inference(eigenvar_choice,[status(thm),assumptions([h1]),eigenvar_choice(discharge,[h0])],[6,h0]) ).
thf(0,theorem,
~ sP4,
inference(contra,[status(thm),contra(discharge,[h1])],[6,h1]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.14 % Problem : SYN997^1 : TPTP v9.2.0. Released v3.7.0.
% 0.03/0.14 % Command : satallax -E eprover-ho -P picomus -M modes -p tstp -t %d %s
% 0.13/0.35 % Computer : n017.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Wed Oct 8 15:10:23 EDT 2025
% 0.13/0.36 % CPUTime :
% 1.10/1.29 % SZS status Theorem
% 1.10/1.29 % Mode: mode506
% 1.10/1.29 % Inferences: 65
% 1.10/1.29 % SZS output start Proof
% See solution above
%------------------------------------------------------------------------------