TSTP Solution File: SYO265^5 by Satallax---3.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Satallax---3.5
% Problem : SYO265^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 : n013.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:31:10 EDT 2022
% Result : Theorem 0.17s 0.34s
% Output : Proof 0.17s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
thf(ty_a,type,
a: $tType ).
thf(ty_eigen__2,type,
eigen__2: a ).
thf(ty_eigen__0,type,
eigen__0: a ).
thf(ty_x,type,
x: a ).
thf(sP1,plain,
( sP1
<=> ( x = eigen__0 ) ),
introduced(definition,[new_symbols(definition,[sP1])]) ).
thf(sP2,plain,
( sP2
<=> ! [X1: a] :
( ( eigen__0 = X1 )
=> ( X1 = eigen__0 ) ) ),
introduced(definition,[new_symbols(definition,[sP2])]) ).
thf(sP3,plain,
( sP3
<=> ! [X1: a] :
( ( x = X1 )
=> ( X1 = x ) ) ),
introduced(definition,[new_symbols(definition,[sP3])]) ).
thf(sP4,plain,
( sP4
<=> ( eigen__0 = eigen__2 ) ),
introduced(definition,[new_symbols(definition,[sP4])]) ).
thf(sP5,plain,
( sP5
<=> ( sP1
=> ( eigen__0 = x ) ) ),
introduced(definition,[new_symbols(definition,[sP5])]) ).
thf(sP6,plain,
( sP6
<=> ( x = x ) ),
introduced(definition,[new_symbols(definition,[sP6])]) ).
thf(sP7,plain,
( sP7
<=> ( eigen__2 = eigen__0 ) ),
introduced(definition,[new_symbols(definition,[sP7])]) ).
thf(sP8,plain,
( sP8
<=> ( sP6
=> ( eigen__0 != x ) ) ),
introduced(definition,[new_symbols(definition,[sP8])]) ).
thf(sP9,plain,
( sP9
<=> ( eigen__0 = x ) ),
introduced(definition,[new_symbols(definition,[sP9])]) ).
thf(sP10,plain,
( sP10
<=> ( eigen__2 = x ) ),
introduced(definition,[new_symbols(definition,[sP10])]) ).
thf(sP11,plain,
( sP11
<=> ! [X1: a] :
( ( X1 = x )
=> ( eigen__0 != X1 ) ) ),
introduced(definition,[new_symbols(definition,[sP11])]) ).
thf(sP12,plain,
( sP12
<=> ! [X1: a,X2: a] :
( ( X1 = X2 )
=> ( X2 = X1 ) ) ),
introduced(definition,[new_symbols(definition,[sP12])]) ).
thf(sP13,plain,
( sP13
<=> ( sP4
=> sP7 ) ),
introduced(definition,[new_symbols(definition,[sP13])]) ).
thf(cX5210,conjecture,
( ( (=) @ x )
= ( ^ [X1: a] :
~ ! [X2: a] :
( ( X2 = x )
=> ( X1 != X2 ) ) ) ) ).
thf(h0,negated_conjecture,
( (=) @ x )
!= ( ^ [X1: a] :
~ ! [X2: a] :
( ( X2 = x )
=> ( X1 != X2 ) ) ),
inference(assume_negation,[status(cth)],[cX5210]) ).
thf(h1,assumption,
~ ! [X1: a] :
( ( x = X1 )
= ( ~ ! [X2: a] :
( ( X2 = x )
=> ( X1 != X2 ) ) ) ),
introduced(assumption,[]) ).
thf(h2,assumption,
sP1
!= ( ~ sP11 ),
introduced(assumption,[]) ).
thf(h3,assumption,
sP1,
introduced(assumption,[]) ).
thf(h4,assumption,
~ sP11,
introduced(assumption,[]) ).
thf(h5,assumption,
~ sP1,
introduced(assumption,[]) ).
thf(h6,assumption,
sP11,
introduced(assumption,[]) ).
thf(1,plain,
sP6,
inference(prop_rule,[status(thm)],]) ).
thf(2,plain,
( ~ sP8
| ~ sP6
| ~ sP9 ),
inference(prop_rule,[status(thm)],]) ).
thf(3,plain,
( ~ sP11
| sP8 ),
inference(all_rule,[status(thm)],]) ).
thf(4,plain,
( ~ sP5
| ~ sP1
| sP9 ),
inference(prop_rule,[status(thm)],]) ).
thf(5,plain,
( ~ sP3
| sP5 ),
inference(all_rule,[status(thm)],]) ).
thf(6,plain,
( ~ sP12
| sP3 ),
inference(all_rule,[status(thm)],]) ).
thf(7,plain,
sP12,
inference(eq_sym,[status(thm)],]) ).
thf(8,plain,
$false,
inference(prop_unsat,[status(thm),assumptions([h3,h4,h2,h1,h0])],[1,2,3,4,5,6,7,h3,h4]) ).
thf(h7,assumption,
~ ( sP10
=> ~ sP4 ),
introduced(assumption,[]) ).
thf(h8,assumption,
sP10,
introduced(assumption,[]) ).
thf(h9,assumption,
sP4,
introduced(assumption,[]) ).
thf(9,plain,
( ~ sP10
| sP1
| ~ sP10
| ~ sP7 ),
inference(confrontation_rule,[status(thm)],]) ).
thf(10,plain,
( ~ sP13
| ~ sP4
| sP7 ),
inference(prop_rule,[status(thm)],]) ).
thf(11,plain,
( ~ sP2
| sP13 ),
inference(all_rule,[status(thm)],]) ).
thf(12,plain,
( ~ sP12
| sP2 ),
inference(all_rule,[status(thm)],]) ).
thf(13,plain,
sP12,
inference(eq_sym,[status(thm)],]) ).
thf(14,plain,
$false,
inference(prop_unsat,[status(thm),assumptions([h8,h9,h7,h5,h6,h2,h1,h0])],[9,10,11,12,13,h5,h8,h9]) ).
thf(15,plain,
$false,
inference(tab_negimp,[status(thm),assumptions([h7,h5,h6,h2,h1,h0]),tab_negimp(discharge,[h8,h9])],[h7,14,h8,h9]) ).
thf(16,plain,
$false,
inference(tab_negall,[status(thm),assumptions([h5,h6,h2,h1,h0]),tab_negall(discharge,[h7]),tab_negall(eigenvar,eigen__2)],[h6,15,h7]) ).
thf(17,plain,
$false,
inference(tab_be,[status(thm),assumptions([h2,h1,h0]),tab_be(discharge,[h3,h4]),tab_be(discharge,[h5,h6])],[h2,8,16,h3,h4,h5,h6]) ).
thf(18,plain,
$false,
inference(tab_negall,[status(thm),assumptions([h1,h0]),tab_negall(discharge,[h2]),tab_negall(eigenvar,eigen__0)],[h1,17,h2]) ).
thf(19,plain,
$false,
inference(tab_fe,[status(thm),assumptions([h0]),tab_fe(discharge,[h1])],[h0,18,h1]) ).
thf(0,theorem,
( ( (=) @ x )
= ( ^ [X1: a] :
~ ! [X2: a] :
( ( X2 = x )
=> ( X1 != X2 ) ) ) ),
inference(contra,[status(thm),contra(discharge,[h0])],[19,h0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : SYO265^5 : TPTP v8.1.0. Released v4.0.0.
% 0.10/0.12 % Command : satallax -E eprover-ho -P picomus -M modes -p tstp -t %d %s
% 0.13/0.31 % Computer : n013.cluster.edu
% 0.13/0.31 % Model : x86_64 x86_64
% 0.13/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.31 % Memory : 8042.1875MB
% 0.13/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.31 % CPULimit : 300
% 0.13/0.31 % WCLimit : 600
% 0.13/0.31 % DateTime : Sat Jul 9 11:14:45 EDT 2022
% 0.17/0.31 % CPUTime :
% 0.17/0.34 % SZS status Theorem
% 0.17/0.34 % Mode: mode213
% 0.17/0.34 % Inferences: 15
% 0.17/0.34 % SZS output start Proof
% See solution above
%------------------------------------------------------------------------------