TSTP Solution File: SEU641^2 by Satallax---3.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Satallax---3.5
% Problem : SEU641^2 : TPTP v8.1.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 : n004.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 : Tue Jul 19 13:54:58 EDT 2022
% Result : Theorem 0.45s 0.71s
% Output : Proof 0.45s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
thf(ty_eigen__1,type,
eigen__1: $i ).
thf(ty_eigen__0,type,
eigen__0: $i ).
thf(ty_emptyset,type,
emptyset: $i ).
thf(ty_in,type,
in: $i > $i > $o ).
thf(ty_setadjoin,type,
setadjoin: $i > $i > $i ).
thf(sP1,plain,
( sP1
<=> ( ( setadjoin @ eigen__0 @ emptyset )
= ( setadjoin @ eigen__1 @ emptyset ) ) ),
introduced(definition,[new_symbols(definition,[sP1])]) ).
thf(sP2,plain,
( sP2
<=> ( eigen__0 = eigen__0 ) ),
introduced(definition,[new_symbols(definition,[sP2])]) ).
thf(sP3,plain,
( sP3
<=> ( ( in @ eigen__0 @ ( setadjoin @ eigen__1 @ emptyset ) )
=> ( eigen__0 = eigen__1 ) ) ),
introduced(definition,[new_symbols(definition,[sP3])]) ).
thf(sP4,plain,
( sP4
<=> ( in @ eigen__0 @ ( setadjoin @ eigen__0 @ emptyset ) ) ),
introduced(definition,[new_symbols(definition,[sP4])]) ).
thf(sP5,plain,
( sP5
<=> ! [X1: $i] : ( in @ eigen__0 @ ( setadjoin @ eigen__0 @ X1 ) ) ),
introduced(definition,[new_symbols(definition,[sP5])]) ).
thf(sP6,plain,
( sP6
<=> ( in @ eigen__0 @ ( setadjoin @ eigen__1 @ emptyset ) ) ),
introduced(definition,[new_symbols(definition,[sP6])]) ).
thf(sP7,plain,
( sP7
<=> ! [X1: $i,X2: $i] :
( ( in @ X1 @ ( setadjoin @ X2 @ emptyset ) )
=> ( X1 = X2 ) ) ),
introduced(definition,[new_symbols(definition,[sP7])]) ).
thf(sP8,plain,
( sP8
<=> ( eigen__0 = eigen__1 ) ),
introduced(definition,[new_symbols(definition,[sP8])]) ).
thf(sP9,plain,
( sP9
<=> ! [X1: $i,X2: $i] : ( in @ X1 @ ( setadjoin @ X1 @ X2 ) ) ),
introduced(definition,[new_symbols(definition,[sP9])]) ).
thf(sP10,plain,
( sP10
<=> ! [X1: $i] :
( ( in @ eigen__0 @ ( setadjoin @ X1 @ emptyset ) )
=> ( eigen__0 = X1 ) ) ),
introduced(definition,[new_symbols(definition,[sP10])]) ).
thf(def_setadjoinIL,definition,
setadjoinIL = sP9 ).
thf(def_uniqinunit,definition,
uniqinunit = sP7 ).
thf(singletonsuniq,conjecture,
( sP9
=> ( sP7
=> ! [X1: $i,X2: $i] :
( ( ( setadjoin @ X1 @ emptyset )
= ( setadjoin @ X2 @ emptyset ) )
=> ( X1 = X2 ) ) ) ) ).
thf(h0,negated_conjecture,
~ ( sP9
=> ( sP7
=> ! [X1: $i,X2: $i] :
( ( ( setadjoin @ X1 @ emptyset )
= ( setadjoin @ X2 @ emptyset ) )
=> ( X1 = X2 ) ) ) ),
inference(assume_negation,[status(cth)],[singletonsuniq]) ).
thf(h1,assumption,
sP9,
introduced(assumption,[]) ).
thf(h2,assumption,
~ ( sP7
=> ! [X1: $i,X2: $i] :
( ( ( setadjoin @ X1 @ emptyset )
= ( setadjoin @ X2 @ emptyset ) )
=> ( X1 = X2 ) ) ),
introduced(assumption,[]) ).
thf(h3,assumption,
sP7,
introduced(assumption,[]) ).
thf(h4,assumption,
~ ! [X1: $i,X2: $i] :
( ( ( setadjoin @ X1 @ emptyset )
= ( setadjoin @ X2 @ emptyset ) )
=> ( X1 = X2 ) ),
introduced(assumption,[]) ).
thf(h5,assumption,
~ ! [X1: $i] :
( ( ( setadjoin @ eigen__0 @ emptyset )
= ( setadjoin @ X1 @ emptyset ) )
=> ( eigen__0 = X1 ) ),
introduced(assumption,[]) ).
thf(h6,assumption,
~ ( sP1
=> sP8 ),
introduced(assumption,[]) ).
thf(h7,assumption,
sP1,
introduced(assumption,[]) ).
thf(h8,assumption,
~ sP8,
introduced(assumption,[]) ).
thf(1,plain,
( ~ sP4
| sP6
| ~ sP2
| ~ sP1 ),
inference(mating_rule,[status(thm)],]) ).
thf(2,plain,
sP2,
inference(prop_rule,[status(thm)],]) ).
thf(3,plain,
( ~ sP5
| sP4 ),
inference(all_rule,[status(thm)],]) ).
thf(4,plain,
( ~ sP9
| sP5 ),
inference(all_rule,[status(thm)],]) ).
thf(5,plain,
( ~ sP7
| sP10 ),
inference(all_rule,[status(thm)],]) ).
thf(6,plain,
( ~ sP10
| sP3 ),
inference(all_rule,[status(thm)],]) ).
thf(7,plain,
( ~ sP3
| ~ sP6
| sP8 ),
inference(prop_rule,[status(thm)],]) ).
thf(8,plain,
$false,
inference(prop_unsat,[status(thm),assumptions([h7,h8,h6,h5,h3,h4,h1,h2,h0])],[1,2,3,4,5,6,7,h1,h3,h7,h8]) ).
thf(9,plain,
$false,
inference(tab_negimp,[status(thm),assumptions([h6,h5,h3,h4,h1,h2,h0]),tab_negimp(discharge,[h7,h8])],[h6,8,h7,h8]) ).
thf(10,plain,
$false,
inference(tab_negall,[status(thm),assumptions([h5,h3,h4,h1,h2,h0]),tab_negall(discharge,[h6]),tab_negall(eigenvar,eigen__1)],[h5,9,h6]) ).
thf(11,plain,
$false,
inference(tab_negall,[status(thm),assumptions([h3,h4,h1,h2,h0]),tab_negall(discharge,[h5]),tab_negall(eigenvar,eigen__0)],[h4,10,h5]) ).
thf(12,plain,
$false,
inference(tab_negimp,[status(thm),assumptions([h1,h2,h0]),tab_negimp(discharge,[h3,h4])],[h2,11,h3,h4]) ).
thf(13,plain,
$false,
inference(tab_negimp,[status(thm),assumptions([h0]),tab_negimp(discharge,[h1,h2])],[h0,12,h1,h2]) ).
thf(0,theorem,
( sP9
=> ( sP7
=> ! [X1: $i,X2: $i] :
( ( ( setadjoin @ X1 @ emptyset )
= ( setadjoin @ X2 @ emptyset ) )
=> ( X1 = X2 ) ) ) ),
inference(contra,[status(thm),contra(discharge,[h0])],[13,h0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU641^2 : TPTP v8.1.0. Released v3.7.0.
% 0.03/0.13 % Command : satallax -E eprover-ho -P picomus -M modes -p tstp -t %d %s
% 0.13/0.34 % Computer : n004.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 : Mon Jun 20 12:52:38 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.45/0.71 % SZS status Theorem
% 0.45/0.71 % Mode: mode213
% 0.45/0.71 % Inferences: 5120
% 0.45/0.71 % SZS output start Proof
% See solution above
%------------------------------------------------------------------------------