%------------------------------------------------------------------------------
% File : Satallax---3.5
% Problem : SYO548^1 : TPTP v9.2.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 : n027.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:26:00 PM UTC 2025
% Result : Theorem 17.74s 18.16s
% Output : Proof 17.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 12
% Syntax : Number of formulae : 17 ( 7 unt; 0 typ; 1 def)
% Number of atoms : 35 ( 1 equ; 0 cnn)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 60 ( 21 ~; 5 |; 0 &; 19 @)
% ( 5 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 8 ( 8 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 7 usr; 8 con; 0-2 aty)
% ( 5 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 10 ( 1 ^; 5 !; 0 ?; 10 :)
% ( 0 !>; 0 ?*; 0 @-; 4 @+)
% Comments :
%------------------------------------------------------------------------------
thf(ty_eigen__14,type,
eigen__14: $i > $o ).
thf(h0,assumption,
! [X1: ( $i > $o ) > $o,X2: $i > $o] :
( ( X1 @ X2 )
=> ( X1 @ ( eps__0 @ X1 ) ) ),
introduced(assumption,[]) ).
thf(eigendef_eigen__14,definition,
( eigen__14
= ( eps__0
@ ^ [X1: $i > $o] :
~ ( ~ ( !! @ X1 )
=> ~ ( X1
@ @+[X2: $i] :
~ ( X1 @ X2 ) ) ) ) ),
introduced(definition,[new_symbols(definition,[eigen__14])]) ).
thf(sP1,plain,
( sP1
<=> ( ~ ( !! @ eigen__14 )
=> ~ ( eigen__14
@ @+[X1: $i] :
~ ( eigen__14 @ X1 ) ) ) ),
introduced(definition,[new_symbols(definition,[sP1])]) ).
thf(sP2,plain,
( sP2
<=> ( !! @ eigen__14 ) ),
introduced(definition,[new_symbols(definition,[sP2])]) ).
thf(sP3,plain,
( sP3
<=> ( eigen__14
@ @+[X1: $i] :
~ ( eigen__14 @ X1 ) ) ),
introduced(definition,[new_symbols(definition,[sP3])]) ).
thf(sP4,plain,
( sP4
<=> ! [X1: $i > $o] :
( ~ ( !! @ X1 )
=> ~ ( X1
@ @+[X2: $i] :
~ ( X1 @ X2 ) ) ) ),
introduced(definition,[new_symbols(definition,[sP4])]) ).
thf(sP5,plain,
( sP5
<=> ! [X1: ( $i > $o ) > $i] :
~ ! [X2: $i > $o] :
( ~ ( !! @ X2 )
=> ~ ( X2 @ ( X1 @ X2 ) ) ) ),
introduced(definition,[new_symbols(definition,[sP5])]) ).
thf(choicecomp,conjecture,
~ sP5 ).
thf(h1,negated_conjecture,
sP5,
inference(assume_negation,[status(cth)],[choicecomp]) ).
thf(1,plain,
( ~ sP3
| sP2 ),
inference(choice_rule,[status(thm)],[]) ).
thf(2,plain,
( sP1
| sP3 ),
inference(prop_rule,[status(thm)],[]) ).
thf(3,plain,
( sP1
| ~ sP2 ),
inference(prop_rule,[status(thm)],[]) ).
thf(4,plain,
( sP4
| ~ sP1 ),
inference(eigen_choice_rule,[status(thm),assumptions([h0])],[h0,eigendef_eigen__14]) ).
thf(5,plain,
( ~ sP5
| ~ sP4 ),
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,
~ sP5,
inference(contra,[status(thm),contra(discharge,[h1])],[6,h1]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SYO548^1 : TPTP v9.2.0. Released v5.2.0.
% 0.12/0.13 % Command : satallax -E eprover-ho -P picomus -M modes -p tstp -t %d %s
% 0.12/0.34 % Computer : n027.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Thu Oct 9 01:01:38 EDT 2025
% 0.12/0.34 % CPUTime :
% 17.74/18.16 % SZS status Theorem
% 17.74/18.16 % Mode: mode466
% 17.74/18.16 % Inferences: 60962
% 17.74/18.16 % SZS output start Proof
% See solution above
%------------------------------------------------------------------------------