%------------------------------------------------------------------------------
% File : Satallax---3.5
% Problem : SYO540^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 : n018.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:25:59 PM UTC 2025
% Result : Theorem 0.19s 0.37s
% Output : Proof 0.19s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
thf(ty_eps,type,
eps: ( $i > $o ) > $i ).
thf(ty_eigen__1,type,
eigen__1: $i ).
thf(ty_eigen__0,type,
eigen__0: $o ).
thf(sP1,plain,
( sP1
<=> ( ( eigen__0
=> ( eigen__1 != eigen__1 ) )
=> ~ ( ~ eigen__0
=> ( eigen__1 != eigen__1 ) ) ) ),
introduced(definition,[new_symbols(definition,[sP1])]) ).
thf(sP2,plain,
( sP2
<=> eigen__0 ),
introduced(definition,[new_symbols(definition,[sP2])]) ).
thf(sP3,plain,
( sP3
<=> ( ( sP2
=> ( ( eps
@ ^ [X1: $i] :
( ( sP2
=> ( X1 != eigen__1 ) )
=> ~ ( ~ sP2
=> ( X1 != eigen__1 ) ) ) )
!= eigen__1 ) )
=> ~ ( ~ sP2
=> ( ( eps
@ ^ [X1: $i] :
( ( sP2
=> ( X1 != eigen__1 ) )
=> ~ ( ~ sP2
=> ( X1 != eigen__1 ) ) ) )
!= eigen__1 ) ) ) ),
introduced(definition,[new_symbols(definition,[sP3])]) ).
thf(sP4,plain,
( sP4
<=> ( sP2
=> ( eigen__1 != eigen__1 ) ) ),
introduced(definition,[new_symbols(definition,[sP4])]) ).
thf(sP5,plain,
( sP5
<=> ( ~ sP2
=> ( ( eps
@ ^ [X1: $i] :
( ( sP2
=> ( X1 != eigen__1 ) )
=> ~ ( ~ sP2
=> ( X1 != eigen__1 ) ) ) )
!= eigen__1 ) ) ),
introduced(definition,[new_symbols(definition,[sP5])]) ).
thf(sP6,plain,
( sP6
<=> ( ( eps
@ ^ [X1: $i] :
( ( sP2
=> ( X1 != eigen__1 ) )
=> ~ ( ~ sP2
=> ( X1 != eigen__1 ) ) ) )
= eigen__1 ) ),
introduced(definition,[new_symbols(definition,[sP6])]) ).
thf(sP7,plain,
( sP7
<=> ! [X1: $i] :
~ ( ( sP2
=> ( X1 != eigen__1 ) )
=> ~ ( ~ sP2
=> ( X1 != eigen__1 ) ) ) ),
introduced(definition,[new_symbols(definition,[sP7])]) ).
thf(sP8,plain,
( sP8
<=> ( ~ sP2
=> ( eigen__1 != eigen__1 ) ) ),
introduced(definition,[new_symbols(definition,[sP8])]) ).
thf(sP9,plain,
( sP9
<=> ( sP2
=> ~ sP6 ) ),
introduced(definition,[new_symbols(definition,[sP9])]) ).
thf(sP10,plain,
( sP10
<=> ( eigen__1 = eigen__1 ) ),
introduced(definition,[new_symbols(definition,[sP10])]) ).
thf(def_if,definition,
( if
= ( ^ [X1: $o,X2: $i,X3: $i] :
( eps
@ ^ [X4: $i] :
( ( X1
=> ( X4 != X2 ) )
=> ~ ( ~ X1
=> ( X4 != X3 ) ) ) ) ) ) ).
thf(conj,conjecture,
! [X1: $o,X2: $i] :
( ( eps
@ ^ [X3: $i] :
( ( X1
=> ( X3 != X2 ) )
=> ~ ( ~ X1
=> ( X3 != X2 ) ) ) )
= X2 ) ).
thf(h0,negated_conjecture,
~ ! [X1: $o,X2: $i] :
( ( eps
@ ^ [X3: $i] :
( ( X1
=> ( X3 != X2 ) )
=> ~ ( ~ X1
=> ( X3 != X2 ) ) ) )
= X2 ),
inference(assume_negation,[status(cth)],[conj]) ).
thf(h1,assumption,
~ ! [X1: $i] :
( ( eps
@ ^ [X2: $i] :
( ( sP2
=> ( X2 != X1 ) )
=> ~ ( ~ sP2
=> ( X2 != X1 ) ) ) )
= X1 ),
introduced(assumption,[]) ).
thf(h2,assumption,
~ sP6,
introduced(assumption,[]) ).
thf(1,plain,
( sP5
| sP6 ),
inference(prop_rule,[status(thm)],[]) ).
thf(2,plain,
( sP9
| sP6 ),
inference(prop_rule,[status(thm)],[]) ).
thf(3,plain,
( ~ sP3
| ~ sP9
| ~ sP5 ),
inference(prop_rule,[status(thm)],[]) ).
thf(4,plain,
sP10,
inference(prop_rule,[status(thm)],[]) ).
thf(5,plain,
( ~ sP8
| sP2
| ~ sP10 ),
inference(prop_rule,[status(thm)],[]) ).
thf(6,plain,
( ~ sP4
| ~ sP2
| ~ sP10 ),
inference(prop_rule,[status(thm)],[]) ).
thf(7,plain,
( sP1
| sP8 ),
inference(prop_rule,[status(thm)],[]) ).
thf(8,plain,
( sP1
| sP4 ),
inference(prop_rule,[status(thm)],[]) ).
thf(9,plain,
( ~ sP7
| ~ sP1 ),
inference(all_rule,[status(thm)],[]) ).
thf(choiceax,axiom,
! [X1: $i > $o] :
( ~ ! [X2: $i] :
~ ( X1 @ X2 )
=> ( X1 @ ( eps @ X1 ) ) ) ).
thf(10,plain,
( sP3
| sP7 ),
inference(choice_rule,[status(thm)],[choiceax]) ).
thf(11,plain,
$false,
inference(prop_unsat,[status(thm),assumptions([h2,h1,h0])],[1,2,3,4,5,6,7,8,9,10,h2]) ).
thf(12,plain,
$false,
inference(tab_negall,[status(thm),assumptions([h1,h0]),tab_negall(discharge,[h2]),tab_negall(eigenvar,eigen__1)],[h1,11,h2]) ).
thf(13,plain,
$false,
inference(tab_negall,[status(thm),assumptions([h0]),tab_negall(discharge,[h1]),tab_negall(eigenvar,eigen__0)],[h0,12,h1]) ).
thf(0,theorem,
! [X1: $o,X2: $i] :
( ( eps
@ ^ [X3: $i] :
( ( X1
=> ( X3 != X2 ) )
=> ~ ( ~ X1
=> ( X3 != X2 ) ) ) )
= X2 ),
inference(contra,[status(thm),contra(discharge,[h0])],[13,h0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYO540^1 : TPTP v9.2.0. Released v5.2.0.
% 0.03/0.13 % Command : satallax -E eprover-ho -P picomus -M modes -p tstp -t %d %s
% 0.13/0.34 % Computer : n018.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Thu Oct 9 00:34:38 EDT 2025
% 0.13/0.35 % CPUTime :
% 0.19/0.37 % SZS status Theorem
% 0.19/0.37 % Mode: mode213
% 0.19/0.37 % Inferences: 20
% 0.19/0.37 % SZS output start Proof
% See solution above
%------------------------------------------------------------------------------