TSTP Solution File: SEV081^5 by Satallax---3.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Satallax---3.5
% Problem : SEV081^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 : n008.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 18:04:46 EDT 2022
% Result : Theorem 0.12s 0.37s
% Output : Proof 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 24
% Syntax : Number of formulae : 32 ( 12 unt; 0 typ; 4 def)
% Number of atoms : 74 ( 4 equ; 0 cnn)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 96 ( 43 ~; 12 |; 0 &; 17 @)
% ( 11 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 32 ( 32 >; 0 *; 0 +; 0 <<)
% Number of symbols : 18 ( 16 usr; 17 con; 0-2 aty)
% Number of variables : 28 ( 4 ^ 24 !; 0 ?; 28 :)
% Comments :
%------------------------------------------------------------------------------
thf(h0,assumption,
! [X1: ( $i > $o ) > $o,X2: $i > $o] :
( ( X1 @ X2 )
=> ( X1 @ ( eps__0 @ X1 ) ) ),
introduced(assumption,[]) ).
thf(eigendef_eigen__6,definition,
( eigen__6
= ( eps__0
@ ^ [X1: $i > $o] :
~ ! [X2: $i > $o] :
( ~ $false
=> ~ $false ) ) ),
introduced(definition,[new_symbols(definition,[eigen__6])]) ).
thf(eigendef_eigen__4,definition,
( eigen__4
= ( eps__0
@ ^ [X1: $i > $o] :
~ ! [X2: $i > $o,X3: $i > $o] :
( ~ $false
=> ~ $false ) ) ),
introduced(definition,[new_symbols(definition,[eigen__4])]) ).
thf(eigendef_eigen__7,definition,
( eigen__7
= ( eps__0
@ ^ [X1: $i > $o] :
~ ( ~ $false
=> ~ $false ) ) ),
introduced(definition,[new_symbols(definition,[eigen__7])]) ).
thf(eigendef_eigen__5,definition,
( eigen__5
= ( eps__0
@ ^ [X1: $i > $o] :
~ ~ $false ) ),
introduced(definition,[new_symbols(definition,[eigen__5])]) ).
thf(sP1,plain,
( sP1
<=> ! [X1: $i > $o] : $false ),
introduced(definition,[new_symbols(definition,[sP1])]) ).
thf(sP2,plain,
( sP2
<=> ! [X1: $i > $o] :
( ~ $false
=> ~ $false ) ),
introduced(definition,[new_symbols(definition,[sP2])]) ).
thf(sP3,plain,
( sP3
<=> ( ~ ! [X1: $i > $o,X2: $i > $o] : $false
=> ~ ! [X1: $i > $o] : ~ $false ) ),
introduced(definition,[new_symbols(definition,[sP3])]) ).
thf(sP4,plain,
( sP4
<=> $false ),
introduced(definition,[new_symbols(definition,[sP4])]) ).
thf(sP5,plain,
( sP5
<=> ! [X1: $i > $o] : sP2 ),
introduced(definition,[new_symbols(definition,[sP5])]) ).
thf(sP6,plain,
( sP6
<=> ! [X1: ( $i > $o ) > ( $i > $o ) > $o] :
( ~ ( ~ ! [X2: $i > $o,X3: $i > $o] :
~ ( X1 @ X2 @ X3 )
=> ~ ! [X2: $i > $o] : ( X1 @ X2 @ X2 ) )
=> ~ ! [X2: $i > $o,X3: $i > $o,X4: $i > $o] :
( ~ ( ( X1 @ X2 @ X3 )
=> ~ ( X1 @ X3 @ X4 ) )
=> ( X1 @ X2 @ X4 ) ) ) ),
introduced(definition,[new_symbols(definition,[sP6])]) ).
thf(sP7,plain,
( sP7
<=> ! [X1: $i > $o] : ~ sP4 ),
introduced(definition,[new_symbols(definition,[sP7])]) ).
thf(sP8,plain,
( sP8
<=> ( ~ sP3
=> ~ ! [X1: $i > $o,X2: $i > $o,X3: $i > $o] :
( ~ sP4
=> ~ sP4 ) ) ),
introduced(definition,[new_symbols(definition,[sP8])]) ).
thf(sP9,plain,
( sP9
<=> ! [X1: $i > $o] : sP1 ),
introduced(definition,[new_symbols(definition,[sP9])]) ).
thf(sP10,plain,
( sP10
<=> ! [X1: $i > $o] : sP5 ),
introduced(definition,[new_symbols(definition,[sP10])]) ).
thf(sP11,plain,
( sP11
<=> ( ~ sP4
=> ~ sP4 ) ),
introduced(definition,[new_symbols(definition,[sP11])]) ).
thf(cTHM120_1_pme,conjecture,
~ sP6 ).
thf(h1,negated_conjecture,
sP6,
inference(assume_negation,[status(cth)],[cTHM120_1_pme]) ).
thf(1,plain,
( ~ sP9
| sP1 ),
inference(all_rule,[status(thm)],]) ).
thf(2,plain,
( ~ sP1
| sP4 ),
inference(all_rule,[status(thm)],]) ).
thf(3,plain,
( sP11
| sP4 ),
inference(prop_rule,[status(thm)],]) ).
thf(4,plain,
( sP2
| ~ sP11 ),
inference(eigen_choice_rule,[status(thm),assumptions([h0])],[h0,eigendef_eigen__7]) ).
thf(5,plain,
( sP5
| ~ sP2 ),
inference(eigen_choice_rule,[status(thm),assumptions([h0])],[h0,eigendef_eigen__6]) ).
thf(6,plain,
( sP7
| sP4 ),
inference(eigen_choice_rule,[status(thm),assumptions([h0])],[h0,eigendef_eigen__5]) ).
thf(7,plain,
( sP10
| ~ sP5 ),
inference(eigen_choice_rule,[status(thm),assumptions([h0])],[h0,eigendef_eigen__4]) ).
thf(8,plain,
( ~ sP3
| sP9
| ~ sP7 ),
inference(prop_rule,[status(thm)],]) ).
thf(9,plain,
( ~ sP8
| sP3
| ~ sP10 ),
inference(prop_rule,[status(thm)],]) ).
thf(10,plain,
( ~ sP6
| sP8 ),
inference(all_rule,[status(thm)],]) ).
thf(11,plain,
~ sP4,
inference(prop_rule,[status(thm)],]) ).
thf(12,plain,
$false,
inference(prop_unsat,[status(thm),assumptions([h1,h0])],[1,2,3,4,5,6,7,8,9,10,11,h1]) ).
thf(13,plain,
$false,
inference(eigenvar_choice,[status(thm),assumptions([h1]),eigenvar_choice(discharge,[h0])],[12,h0]) ).
thf(0,theorem,
~ sP6,
inference(contra,[status(thm),contra(discharge,[h1])],[12,h1]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SEV081^5 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.13 % Command : satallax -E eprover-ho -P picomus -M modes -p tstp -t %d %s
% 0.12/0.34 % Computer : n008.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 : Tue Jun 28 02:11:53 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.37 % SZS status Theorem
% 0.12/0.37 % Mode: mode213
% 0.12/0.37 % Inferences: 322
% 0.12/0.37 % SZS output start Proof
% See solution above
%------------------------------------------------------------------------------