TSTP Solution File: CSR130^1 by Satallax---3.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Satallax---3.5
% Problem : CSR130^1 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : satallax -E eprover-ho -P picomus -M modes -p tstp -t %d %s
% Computer : n024.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 : Fri Jul 15 23:14:24 EDT 2022
% Result : Theorem 33.40s 33.68s
% Output : Proof 33.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 59
% Syntax : Number of formulae : 65 ( 17 unt; 7 typ; 2 def)
% Number of atoms : 137 ( 8 equ; 0 cnn)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 181 ( 55 ~; 34 |; 0 &; 55 @)
% ( 25 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 8 ( 8 >; 0 *; 0 +; 0 <<)
% Number of symbols : 38 ( 35 usr; 34 con; 0-2 aty)
% ( 4 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 22 ( 2 ^ 13 !; 0 ?; 22 :)
% ( 0 !>; 0 ?*; 0 @-; 7 @+)
% Comments :
%------------------------------------------------------------------------------
thf(ty_likes_THFTYPE_IiioI,type,
likes_THFTYPE_IiioI: $i > $i > $o ).
thf(ty_lYearFn_THFTYPE_IiiI,type,
lYearFn_THFTYPE_IiiI: $i > $i ).
thf(ty_lMary_THFTYPE_i,type,
lMary_THFTYPE_i: $i ).
thf(ty_holdsDuring_THFTYPE_IiooI,type,
holdsDuring_THFTYPE_IiooI: $i > $o > $o ).
thf(ty_n2009_THFTYPE_i,type,
n2009_THFTYPE_i: $i ).
thf(ty_lSue_THFTYPE_i,type,
lSue_THFTYPE_i: $i ).
thf(ty_lBill_THFTYPE_i,type,
lBill_THFTYPE_i: $i ).
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] :
~ ! [X2: $i] :
@+[X3: $o] : X3 ) ),
introduced(definition,[new_symbols(definition,[eigen__1])]) ).
thf(eigendef_eigen__2,definition,
( eigen__2
= ( eps__0
@ ^ [X1: $i] :
~ @+[X2: $o] : X2 ) ),
introduced(definition,[new_symbols(definition,[eigen__2])]) ).
thf(sP1,plain,
( sP1
<=> ( ~ ( @+[X1: $o] : X1
=> ~ @+[X1: $o] : X1 )
=> ! [X1: $i,X2: $i] :
@+[X3: $o] : X3 ) ),
introduced(definition,[new_symbols(definition,[sP1])]) ).
thf(sP2,plain,
( sP2
<=> ( !! @ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i ) ) ),
introduced(definition,[new_symbols(definition,[sP2])]) ).
thf(sP3,plain,
( sP3
<=> ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ sP1 ) ),
introduced(definition,[new_symbols(definition,[sP3])]) ).
thf(sP4,plain,
( sP4
<=> ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i ) ) ),
introduced(definition,[new_symbols(definition,[sP4])]) ).
thf(sP5,plain,
( sP5
<=> ( ~ ( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
=> ~ ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i ) )
=> ! [X1: $i] : ( !! @ ( likes_THFTYPE_IiioI @ X1 ) ) ) ),
introduced(definition,[new_symbols(definition,[sP5])]) ).
thf(sP6,plain,
( sP6
<=> ( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
= ( ~ sP1 ) ) ),
introduced(definition,[new_symbols(definition,[sP6])]) ).
thf(sP7,plain,
( sP7
<=> ( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
=> ~ ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i ) ) ),
introduced(definition,[new_symbols(definition,[sP7])]) ).
thf(sP8,plain,
( sP8
<=> ! [X1: $i] : ( !! @ ( likes_THFTYPE_IiioI @ X1 ) ) ),
introduced(definition,[new_symbols(definition,[sP8])]) ).
thf(sP9,plain,
( sP9
<=> ! [X1: $i,X2: $i] :
@+[X3: $o] : X3 ),
introduced(definition,[new_symbols(definition,[sP9])]) ).
thf(sP10,plain,
( sP10
<=> ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i ) ),
introduced(definition,[new_symbols(definition,[sP10])]) ).
thf(sP11,plain,
( sP11
<=> ( n2009_THFTYPE_i = n2009_THFTYPE_i ) ),
introduced(definition,[new_symbols(definition,[sP11])]) ).
thf(sP12,plain,
( sP12
<=> ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ sP5 ) ),
introduced(definition,[new_symbols(definition,[sP12])]) ).
thf(sP13,plain,
( sP13
<=> ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i ) ),
introduced(definition,[new_symbols(definition,[sP13])]) ).
thf(sP14,plain,
( sP14
<=> ! [X1: $i > $i > $o] :
~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i )
@ ~ ( ~ ( ( X1 @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
=> ~ ( X1 @ lMary_THFTYPE_i @ lBill_THFTYPE_i ) )
=> ! [X2: $i] : ( !! @ ( X1 @ X2 ) ) ) ) ),
introduced(definition,[new_symbols(definition,[sP14])]) ).
thf(sP15,plain,
( sP15
<=> ( ( ~ sP13 )
= ( ~ sP5 ) ) ),
introduced(definition,[new_symbols(definition,[sP15])]) ).
thf(sP16,plain,
( sP16
<=> ( ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i )
= ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) ) ),
introduced(definition,[new_symbols(definition,[sP16])]) ).
thf(sP17,plain,
( sP17
<=> $false ),
introduced(definition,[new_symbols(definition,[sP17])]) ).
thf(sP18,plain,
( sP18
<=> ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i ) ),
introduced(definition,[new_symbols(definition,[sP18])]) ).
thf(sP19,plain,
( sP19
<=> @+[X1: $o] : X1 ),
introduced(definition,[new_symbols(definition,[sP19])]) ).
thf(sP20,plain,
( sP20
<=> ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ sP18 ) ),
introduced(definition,[new_symbols(definition,[sP20])]) ).
thf(sP21,plain,
( sP21
<=> ! [X1: $i] : sP19 ),
introduced(definition,[new_symbols(definition,[sP21])]) ).
thf(sP22,plain,
( sP22
<=> ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ sP13 ) ),
introduced(definition,[new_symbols(definition,[sP22])]) ).
thf(sP23,plain,
( sP23
<=> ( ( ~ sP13 )
= ( ~ sP1 ) ) ),
introduced(definition,[new_symbols(definition,[sP23])]) ).
thf(sP24,plain,
( sP24
<=> ! [X1: $o] : ~ X1 ),
introduced(definition,[new_symbols(definition,[sP24])]) ).
thf(sP25,plain,
( sP25
<=> ( sP18
= ( ~ sP1 ) ) ),
introduced(definition,[new_symbols(definition,[sP25])]) ).
thf(con,conjecture,
~ sP14 ).
thf(h1,negated_conjecture,
sP14,
inference(assume_negation,[status(cth)],[con]) ).
thf(1,plain,
( ~ sP2
| sP13 ),
inference(all_rule,[status(thm)],]) ).
thf(2,plain,
( ~ sP7
| ~ sP18
| ~ sP10 ),
inference(prop_rule,[status(thm)],]) ).
thf(3,plain,
( ~ sP8
| sP2 ),
inference(all_rule,[status(thm)],]) ).
thf(4,plain,
( ~ sP5
| sP7
| sP8 ),
inference(prop_rule,[status(thm)],]) ).
thf(5,plain,
( sP15
| sP13
| sP5 ),
inference(prop_rule,[status(thm)],]) ).
thf(6,plain,
( ~ sP22
| sP12
| ~ sP16
| ~ sP15 ),
inference(mating_rule,[status(thm)],]) ).
thf(7,plain,
( ~ sP14
| ~ sP12 ),
inference(all_rule,[status(thm)],]) ).
thf(8,plain,
~ sP17,
inference(prop_rule,[status(thm)],]) ).
thf(9,plain,
( sP25
| sP18
| ~ sP1 ),
inference(prop_rule,[status(thm)],]) ).
thf(10,plain,
( ~ sP20
| sP3
| ~ sP16
| ~ sP25 ),
inference(mating_rule,[status(thm)],]) ).
thf(11,plain,
( sP6
| sP10
| ~ sP1 ),
inference(prop_rule,[status(thm)],]) ).
thf(12,plain,
( ~ sP4
| sP3
| ~ sP16
| ~ sP6 ),
inference(mating_rule,[status(thm)],]) ).
thf(13,plain,
sP11,
inference(prop_rule,[status(thm)],]) ).
thf(14,plain,
( sP16
| ~ sP11 ),
inference(prop_rule,[status(thm)],]) ).
thf(15,plain,
( sP21
| ~ sP19 ),
inference(eigen_choice_rule,[status(thm),assumptions([h0])],[h0,eigendef_eigen__2]) ).
thf(16,plain,
( sP9
| ~ sP21 ),
inference(eigen_choice_rule,[status(thm),assumptions([h0])],[h0,eigendef_eigen__1]) ).
thf(17,plain,
( sP1
| ~ sP9 ),
inference(prop_rule,[status(thm)],]) ).
thf(18,plain,
( ~ sP24
| sP17 ),
inference(all_rule,[status(thm)],]) ).
thf(19,plain,
( sP19
| sP24 ),
inference(choice_rule,[status(thm)],]) ).
thf(20,plain,
( sP23
| ~ sP13
| ~ sP1 ),
inference(prop_rule,[status(thm)],]) ).
thf(21,plain,
( ~ sP22
| sP3
| ~ sP16
| ~ sP23 ),
inference(mating_rule,[status(thm)],]) ).
thf(22,plain,
( ~ sP14
| ~ sP3 ),
inference(all_rule,[status(thm)],]) ).
thf(ax_007,axiom,
sP22 ).
thf(ax_004,axiom,
sP4 ).
thf(ax_002,axiom,
sP20 ).
thf(23,plain,
$false,
inference(prop_unsat,[status(thm),assumptions([h1,h0])],[1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,h1,ax_007,ax_004,ax_002]) ).
thf(24,plain,
$false,
inference(eigenvar_choice,[status(thm),assumptions([h1]),eigenvar_choice(discharge,[h0])],[23,h0]) ).
thf(0,theorem,
~ sP14,
inference(contra,[status(thm),contra(discharge,[h1])],[23,h1]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : CSR130^1 : TPTP v8.1.0. Released v4.1.0.
% 0.06/0.13 % Command : satallax -E eprover-ho -P picomus -M modes -p tstp -t %d %s
% 0.12/0.34 % Computer : n024.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 Jun 10 18:55:04 EDT 2022
% 0.12/0.34 % CPUTime :
% 33.40/33.68 % SZS status Theorem
% 33.40/33.68 % Mode: mode473
% 33.40/33.68 % Inferences: 1223
% 33.40/33.68 % SZS output start Proof
% See solution above
%------------------------------------------------------------------------------