TSTP Solution File: SYO092^5 by Satallax---3.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Satallax---3.5
% Problem : SYO092^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 : n012.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:16 EDT 2022
% Result : Theorem 0.12s 0.36s
% Output : Proof 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 34
% Syntax : Number of formulae : 41 ( 8 unt; 5 typ; 2 def)
% Number of atoms : 88 ( 2 equ; 0 cnn)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 118 ( 39 ~; 15 |; 0 &; 30 @)
% ( 13 <=>; 21 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 3 ( 3 >; 0 *; 0 +; 0 <<)
% Number of symbols : 21 ( 19 usr; 18 con; 0-2 aty)
% Number of variables : 9 ( 2 ^ 7 !; 0 ?; 9 :)
% Comments :
%------------------------------------------------------------------------------
thf(ty_eigen__2,type,
eigen__2: $i ).
thf(ty_cP,type,
cP: $i > $o ).
thf(ty_eigen__1,type,
eigen__1: $i ).
thf(ty_eigen__0,type,
eigen__0: $i ).
thf(ty_cQ,type,
cQ: $i > $o ).
thf(h0,assumption,
! [X1: $i > $o,X2: $i] :
( ( X1 @ X2 )
=> ( X1 @ ( eps__0 @ X1 ) ) ),
introduced(assumption,[]) ).
thf(eigendef_eigen__1,definition,
( eigen__1
= ( eps__0
@ ^ [X1: $i] :
~ ( ( cP @ eigen__0 )
=> ~ ( ~ ( cQ @ X1 )
=> ( cQ @ eigen__0 ) ) ) ) ),
introduced(definition,[new_symbols(definition,[eigen__1])]) ).
thf(eigendef_eigen__2,definition,
( eigen__2
= ( eps__0
@ ^ [X1: $i] :
~ ( ( cP @ eigen__1 )
=> ~ ( ~ ( cQ @ X1 )
=> ( cQ @ eigen__1 ) ) ) ) ),
introduced(definition,[new_symbols(definition,[eigen__2])]) ).
thf(sP1,plain,
( sP1
<=> ! [X1: $i] :
~ ! [X2: $i] :
( ( cP @ X1 )
=> ~ ( ~ ( cQ @ X2 )
=> ( cQ @ X1 ) ) ) ),
introduced(definition,[new_symbols(definition,[sP1])]) ).
thf(sP2,plain,
( sP2
<=> ( ( cP @ eigen__1 )
=> ~ ( ~ ( cQ @ eigen__2 )
=> ( cQ @ eigen__1 ) ) ) ),
introduced(definition,[new_symbols(definition,[sP2])]) ).
thf(sP3,plain,
( sP3
<=> ( ~ ( cQ @ eigen__1 )
=> ( cQ @ eigen__0 ) ) ),
introduced(definition,[new_symbols(definition,[sP3])]) ).
thf(sP4,plain,
( sP4
<=> ( cP @ eigen__1 ) ),
introduced(definition,[new_symbols(definition,[sP4])]) ).
thf(sP5,plain,
( sP5
<=> ( ( cP @ eigen__0 )
=> ~ sP3 ) ),
introduced(definition,[new_symbols(definition,[sP5])]) ).
thf(sP6,plain,
( sP6
<=> ( cP @ eigen__0 ) ),
introduced(definition,[new_symbols(definition,[sP6])]) ).
thf(sP7,plain,
( sP7
<=> ! [X1: $i] :
( sP4
=> ~ ( ~ ( cQ @ X1 )
=> ( cQ @ eigen__1 ) ) ) ),
introduced(definition,[new_symbols(definition,[sP7])]) ).
thf(sP8,plain,
( sP8
<=> ( cQ @ eigen__1 ) ),
introduced(definition,[new_symbols(definition,[sP8])]) ).
thf(sP9,plain,
( sP9
<=> ( sP4
=> ~ sP8 ) ),
introduced(definition,[new_symbols(definition,[sP9])]) ).
thf(sP10,plain,
( sP10
<=> ! [X1: $i] :
( sP6
=> ~ ( ~ ( cQ @ X1 )
=> ( cQ @ eigen__0 ) ) ) ),
introduced(definition,[new_symbols(definition,[sP10])]) ).
thf(sP11,plain,
( sP11
<=> ! [X1: $i] :
( ( cP @ X1 )
=> ~ ( cQ @ X1 ) ) ),
introduced(definition,[new_symbols(definition,[sP11])]) ).
thf(sP12,plain,
( sP12
<=> ( cQ @ eigen__0 ) ),
introduced(definition,[new_symbols(definition,[sP12])]) ).
thf(sP13,plain,
( sP13
<=> ( sP6
=> ~ sP12 ) ),
introduced(definition,[new_symbols(definition,[sP13])]) ).
thf(cY2141,conjecture,
( sP1
=> ~ sP11 ) ).
thf(h1,negated_conjecture,
~ ( sP1
=> ~ sP11 ),
inference(assume_negation,[status(cth)],[cY2141]) ).
thf(h2,assumption,
sP1,
introduced(assumption,[]) ).
thf(h3,assumption,
sP11,
introduced(assumption,[]) ).
thf(1,plain,
( sP2
| sP4 ),
inference(prop_rule,[status(thm)],]) ).
thf(2,plain,
( sP7
| ~ sP2 ),
inference(eigen_choice_rule,[status(thm),assumptions([h0])],[h0,eigendef_eigen__2]) ).
thf(3,plain,
( ~ sP1
| ~ sP7 ),
inference(all_rule,[status(thm)],]) ).
thf(4,plain,
( ~ sP11
| sP9 ),
inference(all_rule,[status(thm)],]) ).
thf(5,plain,
( ~ sP9
| ~ sP4
| ~ sP8 ),
inference(prop_rule,[status(thm)],]) ).
thf(6,plain,
( ~ sP3
| sP8
| sP12 ),
inference(prop_rule,[status(thm)],]) ).
thf(7,plain,
( ~ sP13
| ~ sP6
| ~ sP12 ),
inference(prop_rule,[status(thm)],]) ).
thf(8,plain,
( sP5
| sP3 ),
inference(prop_rule,[status(thm)],]) ).
thf(9,plain,
( sP5
| sP6 ),
inference(prop_rule,[status(thm)],]) ).
thf(10,plain,
( sP10
| ~ sP5 ),
inference(eigen_choice_rule,[status(thm),assumptions([h0])],[h0,eigendef_eigen__1]) ).
thf(11,plain,
( ~ sP11
| sP13 ),
inference(all_rule,[status(thm)],]) ).
thf(12,plain,
( ~ sP1
| ~ sP10 ),
inference(all_rule,[status(thm)],]) ).
thf(13,plain,
$false,
inference(prop_unsat,[status(thm),assumptions([h2,h3,h1,h0])],[1,2,3,4,5,6,7,8,9,10,11,12,h2,h3]) ).
thf(14,plain,
$false,
inference(tab_negimp,[status(thm),assumptions([h1,h0]),tab_negimp(discharge,[h2,h3])],[h1,13,h2,h3]) ).
thf(15,plain,
$false,
inference(eigenvar_choice,[status(thm),assumptions([h1]),eigenvar_choice(discharge,[h0])],[14,h0]) ).
thf(0,theorem,
( sP1
=> ~ sP11 ),
inference(contra,[status(thm),contra(discharge,[h1])],[14,h1]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYO092^5 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : satallax -E eprover-ho -P picomus -M modes -p tstp -t %d %s
% 0.12/0.34 % Computer : n012.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 : 600
% 0.12/0.34 % DateTime : Fri Jul 8 17:58:59 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.36 % SZS status Theorem
% 0.12/0.36 % Mode: mode213
% 0.12/0.36 % Inferences: 23
% 0.12/0.36 % SZS output start Proof
% See solution above
%------------------------------------------------------------------------------