TSTP Solution File: SEU935^5 by Satallax---3.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Satallax---3.5
% Problem : SEU935^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 : n018.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 14:10:56 EDT 2022
% Result : Theorem 0.55s 0.93s
% Output : Proof 0.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 46
% Syntax : Number of formulae : 59 ( 18 unt; 8 typ; 3 def)
% Number of atoms : 103 ( 35 equ; 0 cnn)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 170 ( 72 ~; 15 |; 0 &; 52 @)
% ( 15 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 3 avg)
% Number of types : 4 ( 3 usr)
% Number of type conns : 11 ( 11 >; 0 *; 0 +; 0 <<)
% Number of symbols : 25 ( 23 usr; 22 con; 0-2 aty)
% Number of variables : 51 ( 3 ^ 48 !; 0 ?; 51 :)
% Comments :
%------------------------------------------------------------------------------
thf(ty_a,type,
a: $tType ).
thf(ty_b,type,
b: $tType ).
thf(ty_c,type,
c: $tType ).
thf(ty_eigen__12,type,
eigen__12: a ).
thf(ty_eigen__2,type,
eigen__2: c ).
thf(ty_eigen__1,type,
eigen__1: b > c ).
thf(ty_eigen__0,type,
eigen__0: a > b ).
thf(ty_eigen__5,type,
eigen__5: b ).
thf(h0,assumption,
! [X1: a > $o,X2: a] :
( ( X1 @ X2 )
=> ( X1 @ ( eps__0 @ X1 ) ) ),
introduced(assumption,[]) ).
thf(eigendef_eigen__12,definition,
( eigen__12
= ( eps__0
@ ^ [X1: a] :
~ ( ( ( eigen__0 @ X1 )
!= eigen__5 ) ) ) ),
introduced(definition,[new_symbols(definition,[eigen__12])]) ).
thf(h1,assumption,
! [X1: b > $o,X2: b] :
( ( X1 @ X2 )
=> ( X1 @ ( eps__1 @ X1 ) ) ),
introduced(assumption,[]) ).
thf(eigendef_eigen__9,definition,
( eigen__9
= ( eps__1
@ ^ [X1: b] :
~ ( ( ( eigen__1 @ X1 )
!= ( eigen__1 @ eigen__5 ) ) ) ) ),
introduced(definition,[new_symbols(definition,[eigen__9])]) ).
thf(eigendef_eigen__5,definition,
( eigen__5
= ( eps__1
@ ^ [X1: b] :
~ ( ( ( eigen__1 @ X1 )
!= eigen__2 ) ) ) ),
introduced(definition,[new_symbols(definition,[eigen__5])]) ).
thf(sP1,plain,
( sP1
<=> ! [X1: c] :
~ ! [X2: b] :
( ( eigen__1 @ X2 )
!= X1 ) ),
introduced(definition,[new_symbols(definition,[sP1])]) ).
thf(sP2,plain,
( sP2
<=> ( ( eigen__0 @ eigen__12 )
= eigen__5 ) ),
introduced(definition,[new_symbols(definition,[sP2])]) ).
thf(sP3,plain,
( sP3
<=> ! [X1: b] :
( ( ( eigen__0 @ eigen__12 )
= X1 )
=> ( X1
= ( eigen__0 @ eigen__12 ) ) ) ),
introduced(definition,[new_symbols(definition,[sP3])]) ).
thf(sP4,plain,
( sP4
<=> ( eigen__5
= ( eigen__0 @ eigen__12 ) ) ),
introduced(definition,[new_symbols(definition,[sP4])]) ).
thf(sP5,plain,
( sP5
<=> ( ( eigen__1 @ ( eigen__0 @ eigen__12 ) )
= eigen__2 ) ),
introduced(definition,[new_symbols(definition,[sP5])]) ).
thf(sP6,plain,
( sP6
<=> ( ( eigen__1 @ eigen__9 )
= ( eigen__1 @ eigen__5 ) ) ),
introduced(definition,[new_symbols(definition,[sP6])]) ).
thf(sP7,plain,
( sP7
<=> ! [X1: b,X2: b] :
( ( X1 = X2 )
=> ( X2 = X1 ) ) ),
introduced(definition,[new_symbols(definition,[sP7])]) ).
thf(sP8,plain,
( sP8
<=> ! [X1: a] :
( ( eigen__0 @ X1 )
!= eigen__5 ) ),
introduced(definition,[new_symbols(definition,[sP8])]) ).
thf(sP9,plain,
( sP9
<=> ! [X1: b] :
~ ! [X2: a] :
( ( eigen__0 @ X2 )
!= X1 ) ),
introduced(definition,[new_symbols(definition,[sP9])]) ).
thf(sP10,plain,
( sP10
<=> ! [X1: a] :
( ( eigen__1 @ ( eigen__0 @ X1 ) )
!= eigen__2 ) ),
introduced(definition,[new_symbols(definition,[sP10])]) ).
thf(sP11,plain,
( sP11
<=> ( ( eigen__1 @ eigen__5 )
= ( eigen__1 @ ( eigen__0 @ eigen__12 ) ) ) ),
introduced(definition,[new_symbols(definition,[sP11])]) ).
thf(sP12,plain,
( sP12
<=> ! [X1: b] :
( ( eigen__1 @ X1 )
!= eigen__2 ) ),
introduced(definition,[new_symbols(definition,[sP12])]) ).
thf(sP13,plain,
( sP13
<=> ( sP2
=> sP4 ) ),
introduced(definition,[new_symbols(definition,[sP13])]) ).
thf(sP14,plain,
( sP14
<=> ! [X1: b] :
( ( eigen__1 @ X1 )
!= ( eigen__1 @ eigen__5 ) ) ),
introduced(definition,[new_symbols(definition,[sP14])]) ).
thf(sP15,plain,
( sP15
<=> ( ( eigen__1 @ eigen__5 )
= eigen__2 ) ),
introduced(definition,[new_symbols(definition,[sP15])]) ).
thf(cFN_THM_2_pme,conjecture,
! [X1: a > b,X2: b > c] :
( ~ ( ! [X3: b] :
~ ! [X4: a] :
( ( X1 @ X4 )
!= X3 )
=> ~ ! [X3: c] :
~ ! [X4: b] :
( ( X2 @ X4 )
!= X3 ) )
=> ! [X3: c] :
~ ! [X4: a] :
( ( X2 @ ( X1 @ X4 ) )
!= X3 ) ) ).
thf(h2,negated_conjecture,
~ ! [X1: a > b,X2: b > c] :
( ~ ( ! [X3: b] :
~ ! [X4: a] :
( ( X1 @ X4 )
!= X3 )
=> ~ ! [X3: c] :
~ ! [X4: b] :
( ( X2 @ X4 )
!= X3 ) )
=> ! [X3: c] :
~ ! [X4: a] :
( ( X2 @ ( X1 @ X4 ) )
!= X3 ) ),
inference(assume_negation,[status(cth)],[cFN_THM_2_pme]) ).
thf(h3,assumption,
~ ! [X1: b > c] :
( ~ ( sP9
=> ~ ! [X2: c] :
~ ! [X3: b] :
( ( X1 @ X3 )
!= X2 ) )
=> ! [X2: c] :
~ ! [X3: a] :
( ( X1 @ ( eigen__0 @ X3 ) )
!= X2 ) ),
introduced(assumption,[]) ).
thf(h4,assumption,
~ ( ~ ( sP9
=> ~ sP1 )
=> ! [X1: c] :
~ ! [X2: a] :
( ( eigen__1 @ ( eigen__0 @ X2 ) )
!= X1 ) ),
introduced(assumption,[]) ).
thf(h5,assumption,
~ ( sP9
=> ~ sP1 ),
introduced(assumption,[]) ).
thf(h6,assumption,
~ ! [X1: c] :
~ ! [X2: a] :
( ( eigen__1 @ ( eigen__0 @ X2 ) )
!= X1 ),
introduced(assumption,[]) ).
thf(h7,assumption,
sP9,
introduced(assumption,[]) ).
thf(h8,assumption,
sP1,
introduced(assumption,[]) ).
thf(h9,assumption,
sP10,
introduced(assumption,[]) ).
thf(1,plain,
( sP11
| ~ sP4 ),
inference(prop_rule,[status(thm)],]) ).
thf(2,plain,
( ~ sP6
| sP5
| ~ sP11
| ~ sP15 ),
inference(confrontation_rule,[status(thm)],]) ).
thf(3,plain,
( ~ sP10
| ~ sP5 ),
inference(all_rule,[status(thm)],]) ).
thf(4,plain,
( ~ sP13
| ~ sP2
| sP4 ),
inference(prop_rule,[status(thm)],]) ).
thf(5,plain,
( ~ sP3
| sP13 ),
inference(all_rule,[status(thm)],]) ).
thf(6,plain,
( ~ sP7
| sP3 ),
inference(all_rule,[status(thm)],]) ).
thf(7,plain,
( sP8
| sP2 ),
inference(eigen_choice_rule,[status(thm),assumptions([h0])],[h0,eigendef_eigen__12]) ).
thf(8,plain,
( ~ sP9
| ~ sP8 ),
inference(all_rule,[status(thm)],]) ).
thf(9,plain,
( sP14
| sP6 ),
inference(eigen_choice_rule,[status(thm),assumptions([h1])],[h1,eigendef_eigen__9]) ).
thf(10,plain,
( ~ sP1
| ~ sP14 ),
inference(all_rule,[status(thm)],]) ).
thf(11,plain,
sP7,
inference(eq_sym,[status(thm)],]) ).
thf(12,plain,
( sP12
| sP15 ),
inference(eigen_choice_rule,[status(thm),assumptions([h1])],[h1,eigendef_eigen__5]) ).
thf(13,plain,
( ~ sP1
| ~ sP12 ),
inference(all_rule,[status(thm)],]) ).
thf(14,plain,
$false,
inference(prop_unsat,[status(thm),assumptions([h9,h7,h8,h5,h6,h4,h3,h2,h1,h0])],[1,2,3,4,5,6,7,8,9,10,11,12,13,h7,h8,h9]) ).
thf(15,plain,
$false,
inference(tab_negall,[status(thm),assumptions([h7,h8,h5,h6,h4,h3,h2,h1,h0]),tab_negall(discharge,[h9]),tab_negall(eigenvar,eigen__2)],[h6,14,h9]) ).
thf(16,plain,
$false,
inference(tab_negimp,[status(thm),assumptions([h5,h6,h4,h3,h2,h1,h0]),tab_negimp(discharge,[h7,h8])],[h5,15,h7,h8]) ).
thf(17,plain,
$false,
inference(tab_negimp,[status(thm),assumptions([h4,h3,h2,h1,h0]),tab_negimp(discharge,[h5,h6])],[h4,16,h5,h6]) ).
thf(18,plain,
$false,
inference(tab_negall,[status(thm),assumptions([h3,h2,h1,h0]),tab_negall(discharge,[h4]),tab_negall(eigenvar,eigen__1)],[h3,17,h4]) ).
thf(19,plain,
$false,
inference(tab_negall,[status(thm),assumptions([h2,h1,h0]),tab_negall(discharge,[h3]),tab_negall(eigenvar,eigen__0)],[h2,18,h3]) ).
thf(20,plain,
$false,
inference(eigenvar_choice,[status(thm),assumptions([h2,h0]),eigenvar_choice(discharge,[h1])],[19,h1]) ).
thf(21,plain,
$false,
inference(eigenvar_choice,[status(thm),assumptions([h2]),eigenvar_choice(discharge,[h0])],[20,h0]) ).
thf(0,theorem,
! [X1: a > b,X2: b > c] :
( ~ ( ! [X3: b] :
~ ! [X4: a] :
( ( X1 @ X4 )
!= X3 )
=> ~ ! [X3: c] :
~ ! [X4: b] :
( ( X2 @ X4 )
!= X3 ) )
=> ! [X3: c] :
~ ! [X4: a] :
( ( X2 @ ( X1 @ X4 ) )
!= X3 ) ),
inference(contra,[status(thm),contra(discharge,[h2])],[19,h2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.13 % Problem : SEU935^5 : TPTP v8.1.0. Released v4.0.0.
% 0.05/0.13 % Command : satallax -E eprover-ho -P picomus -M modes -p tstp -t %d %s
% 0.13/0.34 % Computer : n018.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 : Sun Jun 19 12:20:04 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.55/0.93 % SZS status Theorem
% 0.55/0.93 % Mode: mode213
% 0.55/0.93 % Inferences: 5697
% 0.55/0.93 % SZS output start Proof
% See solution above
%------------------------------------------------------------------------------