TSTP Solution File: SYO215^5 by Satallax---3.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Satallax---3.5
% Problem : SYO215^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 : 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 : 600s
% DateTime : Thu Jul 21 19:30:55 EDT 2022
% Result : Theorem 0.13s 0.37s
% Output : Proof 0.13s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% 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(sP1,plain,
( sP1
<=> ( eigen__0 = eigen__1 ) ),
introduced(definition,[new_symbols(definition,[sP1])]) ).
thf(sP2,plain,
( sP2
<=> ! [X1: $i] :
( ( eigen__1 = X1 )
=> ( X1 = eigen__1 ) ) ),
introduced(definition,[new_symbols(definition,[sP2])]) ).
thf(sP3,plain,
( sP3
<=> ( eigen__1 = eigen__2 ) ),
introduced(definition,[new_symbols(definition,[sP3])]) ).
thf(sP4,plain,
( sP4
<=> ! [X1: $i] :
( ( eigen__0 = X1 )
=> ( X1 = eigen__0 ) ) ),
introduced(definition,[new_symbols(definition,[sP4])]) ).
thf(sP5,plain,
( sP5
<=> ( eigen__0 = eigen__2 ) ),
introduced(definition,[new_symbols(definition,[sP5])]) ).
thf(sP6,plain,
( sP6
<=> ( eigen__2 = eigen__0 ) ),
introduced(definition,[new_symbols(definition,[sP6])]) ).
thf(sP7,plain,
( sP7
<=> ( sP3
=> ( eigen__2 = eigen__1 ) ) ),
introduced(definition,[new_symbols(definition,[sP7])]) ).
thf(sP8,plain,
( sP8
<=> ! [X1: $i] : ( X1 = eigen__2 ) ),
introduced(definition,[new_symbols(definition,[sP8])]) ).
thf(sP9,plain,
( sP9
<=> ( sP5
=> sP6 ) ),
introduced(definition,[new_symbols(definition,[sP9])]) ).
thf(sP10,plain,
( sP10
<=> ( eigen__2 = eigen__1 ) ),
introduced(definition,[new_symbols(definition,[sP10])]) ).
thf(sP11,plain,
( sP11
<=> ! [X1: $i,X2: $i] :
( ( X1 = X2 )
=> ( X2 = X1 ) ) ),
introduced(definition,[new_symbols(definition,[sP11])]) ).
thf(cTHM26,conjecture,
( ~ ! [X1: $i] : ( !! @ ( (=) @ X1 ) )
=> ! [X1: $i] :
~ ! [X2: $i] : ( X2 = X1 ) ) ).
thf(h0,negated_conjecture,
~ ( ~ ! [X1: $i] : ( !! @ ( (=) @ X1 ) )
=> ! [X1: $i] :
~ ! [X2: $i] : ( X2 = X1 ) ),
inference(assume_negation,[status(cth)],[cTHM26]) ).
thf(h1,assumption,
~ ! [X1: $i] : ( !! @ ( (=) @ X1 ) ),
introduced(assumption,[]) ).
thf(h2,assumption,
~ ! [X1: $i] :
~ ! [X2: $i] : ( X2 = X1 ),
introduced(assumption,[]) ).
thf(h3,assumption,
~ ( !! @ ( (=) @ eigen__0 ) ),
introduced(assumption,[]) ).
thf(h4,assumption,
~ sP1,
introduced(assumption,[]) ).
thf(h5,assumption,
sP8,
introduced(assumption,[]) ).
thf(1,plain,
( ~ sP5
| sP1
| ~ sP6
| ~ sP10 ),
inference(confrontation_rule,[status(thm)],]) ).
thf(2,plain,
( ~ sP7
| ~ sP3
| sP10 ),
inference(prop_rule,[status(thm)],]) ).
thf(3,plain,
( ~ sP2
| sP7 ),
inference(all_rule,[status(thm)],]) ).
thf(4,plain,
( ~ sP9
| ~ sP5
| sP6 ),
inference(prop_rule,[status(thm)],]) ).
thf(5,plain,
( ~ sP4
| sP9 ),
inference(all_rule,[status(thm)],]) ).
thf(6,plain,
( ~ sP8
| sP3 ),
inference(all_rule,[status(thm)],]) ).
thf(7,plain,
( ~ sP8
| sP5 ),
inference(all_rule,[status(thm)],]) ).
thf(8,plain,
( ~ sP11
| sP2 ),
inference(all_rule,[status(thm)],]) ).
thf(9,plain,
( ~ sP11
| sP4 ),
inference(all_rule,[status(thm)],]) ).
thf(10,plain,
sP11,
inference(eq_sym,[status(thm)],]) ).
thf(11,plain,
$false,
inference(prop_unsat,[status(thm),assumptions([h5,h4,h3,h1,h2,h0])],[1,2,3,4,5,6,7,8,9,10,h4,h5]) ).
thf(12,plain,
$false,
inference(tab_negall,[status(thm),assumptions([h4,h3,h1,h2,h0]),tab_negall(discharge,[h5]),tab_negall(eigenvar,eigen__2)],[h2,11,h5]) ).
thf(13,plain,
$false,
inference(tab_negall,[status(thm),assumptions([h3,h1,h2,h0]),tab_negall(discharge,[h4]),tab_negall(eigenvar,eigen__1)],[h3,12,h4]) ).
thf(14,plain,
$false,
inference(tab_negall,[status(thm),assumptions([h1,h2,h0]),tab_negall(discharge,[h3]),tab_negall(eigenvar,eigen__0)],[h1,13,h3]) ).
thf(15,plain,
$false,
inference(tab_negimp,[status(thm),assumptions([h0]),tab_negimp(discharge,[h1,h2])],[h0,14,h1,h2]) ).
thf(0,theorem,
( ~ ! [X1: $i] : ( !! @ ( (=) @ X1 ) )
=> ! [X1: $i] :
~ ! [X2: $i] : ( X2 = X1 ) ),
inference(contra,[status(thm),contra(discharge,[h0])],[15,h0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SYO215^5 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.13 % Command : satallax -E eprover-ho -P picomus -M modes -p tstp -t %d %s
% 0.13/0.34 % Computer : n017.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 : 600
% 0.13/0.34 % DateTime : Fri Jul 8 20:28:01 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.37 % SZS status Theorem
% 0.13/0.37 % Mode: mode213
% 0.13/0.37 % Inferences: 7
% 0.13/0.37 % SZS output start Proof
% See solution above
%------------------------------------------------------------------------------