TSTP Solution File: SET611^3 by Lash---1.13
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Lash---1.13
% Problem : SET611^3 : TPTP v8.1.2. Released v3.6.0.
% Transfm : none
% Format : tptp:raw
% Command : lash -P picomus -M modes -p tstp -t %d %s
% Computer : n013.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 : 300s
% DateTime : Thu Aug 31 15:17:48 EDT 2023
% Result : Theorem 0.19s 0.42s
% Output : Proof 0.19s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
thf(ty_eigen__2,type,
eigen__2: $i ).
thf(ty_eigen__1,type,
eigen__1: $i > $o ).
thf(ty_eigen__0,type,
eigen__0: $i > $o ).
thf(ty_eigen__3,type,
eigen__3: $i ).
thf(sP1,plain,
( sP1
<=> ( eigen__1 @ eigen__2 ) ),
introduced(definition,[new_symbols(definition,[sP1])]) ).
thf(sP2,plain,
( sP2
<=> ( ( ^ [X1: $i] :
~ ( ( eigen__0 @ X1 )
=> ( eigen__1 @ X1 ) ) )
= eigen__0 ) ),
introduced(definition,[new_symbols(definition,[sP2])]) ).
thf(sP3,plain,
( sP3
<=> ! [X1: $i] :
( ( ~ ( ( eigen__0 @ X1 )
=> ( eigen__1 @ X1 ) ) )
= ( eigen__0 @ X1 ) ) ),
introduced(definition,[new_symbols(definition,[sP3])]) ).
thf(sP4,plain,
( sP4
<=> ! [X1: $i] :
( ( eigen__0 @ X1 )
=> ~ ( eigen__1 @ X1 ) ) ),
introduced(definition,[new_symbols(definition,[sP4])]) ).
thf(sP5,plain,
( sP5
<=> ( ( eigen__0 @ eigen__2 )
=> ~ sP1 ) ),
introduced(definition,[new_symbols(definition,[sP5])]) ).
thf(sP6,plain,
( sP6
<=> ( ( ~ ( ( eigen__0 @ eigen__3 )
=> ( eigen__1 @ eigen__3 ) ) )
= ( eigen__0 @ eigen__3 ) ) ),
introduced(definition,[new_symbols(definition,[sP6])]) ).
thf(sP7,plain,
( sP7
<=> ( eigen__0 @ eigen__3 ) ),
introduced(definition,[new_symbols(definition,[sP7])]) ).
thf(sP8,plain,
( sP8
<=> ( ( eigen__0 @ eigen__2 )
=> sP1 ) ),
introduced(definition,[new_symbols(definition,[sP8])]) ).
thf(sP9,plain,
( sP9
<=> ( eigen__0 @ eigen__2 ) ),
introduced(definition,[new_symbols(definition,[sP9])]) ).
thf(sP10,plain,
( sP10
<=> ( eigen__1 @ eigen__3 ) ),
introduced(definition,[new_symbols(definition,[sP10])]) ).
thf(sP11,plain,
( sP11
<=> ( sP7
=> sP10 ) ),
introduced(definition,[new_symbols(definition,[sP11])]) ).
thf(sP12,plain,
( sP12
<=> ( ( ^ [X1: $i] :
~ ( ( eigen__0 @ X1 )
=> ~ ( eigen__1 @ X1 ) ) )
= ( ^ [X1: $i] : $false ) ) ),
introduced(definition,[new_symbols(definition,[sP12])]) ).
thf(def_in,definition,
( in
= ( ^ [X1: $i,X2: $i > $o] : ( X2 @ X1 ) ) ) ).
thf(def_is_a,definition,
( is_a
= ( ^ [X1: $i,X2: $i > $o] : ( X2 @ X1 ) ) ) ).
thf(def_emptyset,definition,
( emptyset
= ( ^ [X1: $i] : $false ) ) ).
thf(def_unord_pair,definition,
( unord_pair
= ( ^ [X1: $i,X2: $i,X3: $i] :
( ( X3 = X1 )
| ( X3 = X2 ) ) ) ) ).
thf(def_singleton,definition,
( singleton
= ( ^ [X1: $i,X2: $i] : ( X2 = X1 ) ) ) ).
thf(def_union,definition,
( union
= ( ^ [X1: $i > $o,X2: $i > $o,X3: $i] :
( ( X1 @ X3 )
| ( X2 @ X3 ) ) ) ) ).
thf(def_excl_union,definition,
( excl_union
= ( ^ [X1: $i > $o,X2: $i > $o,X3: $i] :
( ( ( X1 @ X3 )
& ( (~) @ ( X2 @ X3 ) ) )
| ( ( (~) @ ( X1 @ X3 ) )
& ( X2 @ X3 ) ) ) ) ) ).
thf(def_intersection,definition,
( intersection
= ( ^ [X1: $i > $o,X2: $i > $o,X3: $i] :
( ( X1 @ X3 )
& ( X2 @ X3 ) ) ) ) ).
thf(def_setminus,definition,
( setminus
= ( ^ [X1: $i > $o,X2: $i > $o,X3: $i] :
( ( X1 @ X3 )
& ( (~) @ ( X2 @ X3 ) ) ) ) ) ).
thf(def_complement,definition,
( complement
= ( ^ [X1: $i > $o,X2: $i] : ( (~) @ ( X1 @ X2 ) ) ) ) ).
thf(def_disjoint,definition,
( disjoint
= ( ^ [X1: $i > $o,X2: $i > $o] :
( ( intersection @ X1 @ X2 )
= emptyset ) ) ) ).
thf(def_subset,definition,
( subset
= ( ^ [X1: $i > $o,X2: $i > $o] :
! [X3: $i] :
( ^ [X4: $o,X5: $o] :
( X4
=> X5 )
@ ( X1 @ X3 )
@ ( X2 @ X3 ) ) ) ) ).
thf(def_meets,definition,
( meets
= ( ^ [X1: $i > $o,X2: $i > $o] :
? [X3: $i] :
( ( X1 @ X3 )
& ( X2 @ X3 ) ) ) ) ).
thf(def_misses,definition,
( misses
= ( ^ [X1: $i > $o,X2: $i > $o] :
( (~)
@ ? [X3: $i] :
( ( X1 @ X3 )
& ( X2 @ X3 ) ) ) ) ) ).
thf(thm,conjecture,
! [X1: $i > $o,X2: $i > $o] :
( ( ( ^ [X3: $i] :
~ ( ( X1 @ X3 )
=> ~ ( X2 @ X3 ) ) )
= ( ^ [X3: $i] : $false ) )
= ( ( ^ [X3: $i] :
~ ( ( X1 @ X3 )
=> ( X2 @ X3 ) ) )
= X1 ) ) ).
thf(h0,negated_conjecture,
~ ! [X1: $i > $o,X2: $i > $o] :
( ( ( ^ [X3: $i] :
~ ( ( X1 @ X3 )
=> ~ ( X2 @ X3 ) ) )
= ( ^ [X3: $i] : $false ) )
= ( ( ^ [X3: $i] :
~ ( ( X1 @ X3 )
=> ( X2 @ X3 ) ) )
= X1 ) ),
inference(assume_negation,[status(cth)],[thm]) ).
thf(h1,assumption,
~ ! [X1: $i > $o] :
( ( ( ^ [X2: $i] :
~ ( ( eigen__0 @ X2 )
=> ~ ( X1 @ X2 ) ) )
= ( ^ [X2: $i] : $false ) )
= ( ( ^ [X2: $i] :
~ ( ( eigen__0 @ X2 )
=> ( X1 @ X2 ) ) )
= eigen__0 ) ),
introduced(assumption,[]) ).
thf(h2,assumption,
sP12 != sP2,
introduced(assumption,[]) ).
thf(h3,assumption,
sP12,
introduced(assumption,[]) ).
thf(h4,assumption,
sP2,
introduced(assumption,[]) ).
thf(h5,assumption,
~ sP12,
introduced(assumption,[]) ).
thf(h6,assumption,
~ sP2,
introduced(assumption,[]) ).
thf(h7,assumption,
~ sP3,
introduced(assumption,[]) ).
thf(h8,assumption,
( ~ sP8 != sP9 ),
introduced(assumption,[]) ).
thf(h9,assumption,
~ sP8,
introduced(assumption,[]) ).
thf(h10,assumption,
sP9,
introduced(assumption,[]) ).
thf(h11,assumption,
sP8,
introduced(assumption,[]) ).
thf(h12,assumption,
~ sP9,
introduced(assumption,[]) ).
thf(h13,assumption,
~ sP1,
introduced(assumption,[]) ).
thf(1,plain,
$false,
inference(tab_conflict,[status(thm),assumptions([h10,h13,h9,h10,h8,h7,h3,h4,h2,h1,h0])],[h10,h10]) ).
thf(2,plain,
$false,
inference(tab_negimp,[status(thm),assumptions([h9,h10,h8,h7,h3,h4,h2,h1,h0]),tab_negimp(discharge,[h10,h13])],[h9,1,h10,h13]) ).
thf(3,plain,
( ~ sP5
| ~ sP9
| ~ sP1 ),
inference(prop_rule,[status(thm)],]) ).
thf(4,plain,
( ~ sP4
| sP5 ),
inference(all_rule,[status(thm)],]) ).
thf(5,plain,
( ~ sP12
| sP4 ),
inference(prop_rule,[status(thm)],]) ).
thf(6,plain,
( ~ sP8
| ~ sP9
| sP1 ),
inference(prop_rule,[status(thm)],]) ).
thf(7,plain,
$false,
inference(prop_unsat,[status(thm),assumptions([h11,h12,h8,h7,h3,h4,h2,h1,h0])],[3,4,5,6,h3,h11,h12]) ).
thf(8,plain,
$false,
inference(tab_be,[status(thm),assumptions([h8,h7,h3,h4,h2,h1,h0]),tab_be(discharge,[h9,h10]),tab_be(discharge,[h11,h12])],[h8,2,7,h9,h10,h11,h12]) ).
thf(9,plain,
$false,
inference(tab_negall,[status(thm),assumptions([h7,h3,h4,h2,h1,h0]),tab_negall(discharge,[h8]),tab_negall(eigenvar,eigen__2)],[h7,8,h8]) ).
thf(10,plain,
$false,
inference(tab_fe,[status(thm),assumptions([h3,h4,h2,h1,h0]),tab_fe(discharge,[h7])],[h4,9,h7]) ).
thf(h14,assumption,
~ ! [X1: $i] :
( ( ~ ( ( eigen__0 @ X1 )
=> ~ ( eigen__1 @ X1 ) ) )
= $false ),
introduced(assumption,[]) ).
thf(h15,assumption,
~ ( sP7
=> ~ sP10 ),
introduced(assumption,[]) ).
thf(h16,assumption,
sP7,
introduced(assumption,[]) ).
thf(h17,assumption,
sP10,
introduced(assumption,[]) ).
thf(11,plain,
( sP11
| ~ sP10 ),
inference(prop_rule,[status(thm)],]) ).
thf(12,plain,
( ~ sP6
| ~ sP11
| ~ sP7 ),
inference(prop_rule,[status(thm)],]) ).
thf(13,plain,
( ~ sP3
| sP6 ),
inference(all_rule,[status(thm)],]) ).
thf(14,plain,
( ~ sP2
| sP3 ),
inference(prop_rule,[status(thm)],]) ).
thf(15,plain,
$false,
inference(prop_unsat,[status(thm),assumptions([h16,h17,h15,h14,h5,h6,h2,h1,h0])],[11,12,13,14,h16,h17,h6]) ).
thf(16,plain,
$false,
inference(tab_negimp,[status(thm),assumptions([h15,h14,h5,h6,h2,h1,h0]),tab_negimp(discharge,[h16,h17])],[h15,15,h16,h17]) ).
thf(17,plain,
$false,
inference(tab_negall,[status(thm),assumptions([h14,h5,h6,h2,h1,h0]),tab_negall(discharge,[h15]),tab_negall(eigenvar,eigen__3)],[h14,16,h15]) ).
thf(18,plain,
$false,
inference(tab_fe,[status(thm),assumptions([h5,h6,h2,h1,h0]),tab_fe(discharge,[h14])],[h5,17,h14]) ).
thf(19,plain,
$false,
inference(tab_be,[status(thm),assumptions([h2,h1,h0]),tab_be(discharge,[h3,h4]),tab_be(discharge,[h5,h6])],[h2,10,18,h3,h4,h5,h6]) ).
thf(20,plain,
$false,
inference(tab_negall,[status(thm),assumptions([h1,h0]),tab_negall(discharge,[h2]),tab_negall(eigenvar,eigen__1)],[h1,19,h2]) ).
thf(21,plain,
$false,
inference(tab_negall,[status(thm),assumptions([h0]),tab_negall(discharge,[h1]),tab_negall(eigenvar,eigen__0)],[h0,20,h1]) ).
thf(0,theorem,
! [X1: $i > $o,X2: $i > $o] :
( ( ( ^ [X3: $i] :
~ ( ( X1 @ X3 )
=> ~ ( X2 @ X3 ) ) )
= ( ^ [X3: $i] : $false ) )
= ( ( ^ [X3: $i] :
~ ( ( X1 @ X3 )
=> ( X2 @ X3 ) ) )
= X1 ) ),
inference(contra,[status(thm),contra(discharge,[h0])],[21,h0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SET611^3 : TPTP v8.1.2. Released v3.6.0.
% 0.00/0.14 % Command : lash -P picomus -M modes -p tstp -t %d %s
% 0.14/0.34 % Computer : n013.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Sat Aug 26 08:51:17 EDT 2023
% 0.14/0.34 % CPUTime :
% 0.19/0.42 % SZS status Theorem
% 0.19/0.42 % Mode: cade22grackle2xfee4
% 0.19/0.42 % Steps: 30
% 0.19/0.42 % SZS output start Proof
% See solution above
%------------------------------------------------------------------------------