TSTP Solution File: SYO059^4 by Lash---1.13
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Lash---1.13
% Problem : SYO059^4 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : lash -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 : 300s
% DateTime : Fri Sep 1 04:44:57 EDT 2023
% Result : Theorem 0.20s 0.42s
% Output : Proof 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 42
% Syntax : Number of formulae : 48 ( 27 unt; 4 typ; 20 def)
% Number of atoms : 117 ( 20 equ; 3 cnn)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 141 ( 21 ~; 8 |; 1 &; 88 @)
% ( 8 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 30 ( 30 >; 0 *; 0 +; 0 <<)
% Number of symbols : 36 ( 32 usr; 33 con; 0-2 aty)
% Number of variables : 56 ( 34 ^; 20 !; 2 ?; 56 :)
% Comments :
%------------------------------------------------------------------------------
thf(ty_eigen__0,type,
eigen__0: $i ).
thf(ty_a,type,
a: $i > $o ).
thf(ty_eigen__1,type,
eigen__1: $i ).
thf(ty_irel,type,
irel: $i > $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] :
~ ( ( irel @ eigen__0 @ X1 )
=> ( a @ X1 ) ) ) ),
introduced(definition,[new_symbols(definition,[eigen__1])]) ).
thf(sP1,plain,
( sP1
<=> ( ( irel @ eigen__0 @ eigen__1 )
=> ( a @ eigen__1 ) ) ),
introduced(definition,[new_symbols(definition,[sP1])]) ).
thf(sP2,plain,
( sP2
<=> ( ( irel @ eigen__0 @ eigen__0 )
=> ~ ! [X1: $i] :
( ( irel @ eigen__0 @ X1 )
=> ( a @ X1 ) ) ) ),
introduced(definition,[new_symbols(definition,[sP2])]) ).
thf(sP3,plain,
( sP3
<=> ! [X1: $i] :
( ( irel @ eigen__0 @ X1 )
=> ( a @ X1 ) ) ),
introduced(definition,[new_symbols(definition,[sP3])]) ).
thf(sP4,plain,
( sP4
<=> ! [X1: $i] : ( a @ X1 ) ),
introduced(definition,[new_symbols(definition,[sP4])]) ).
thf(sP5,plain,
( sP5
<=> ! [X1: $i] : ( irel @ X1 @ X1 ) ),
introduced(definition,[new_symbols(definition,[sP5])]) ).
thf(sP6,plain,
( sP6
<=> ( irel @ eigen__0 @ eigen__0 ) ),
introduced(definition,[new_symbols(definition,[sP6])]) ).
thf(sP7,plain,
( sP7
<=> ( a @ eigen__1 ) ),
introduced(definition,[new_symbols(definition,[sP7])]) ).
thf(sP8,plain,
( sP8
<=> ! [X1: $i] :
( ( irel @ eigen__0 @ X1 )
=> ~ ! [X2: $i] :
( ( irel @ X1 @ X2 )
=> ( a @ X2 ) ) ) ),
introduced(definition,[new_symbols(definition,[sP8])]) ).
thf(def_mnot,definition,
( mnot
= ( ^ [X1: $i > $o,X2: $i] : ( (~) @ ( X1 @ X2 ) ) ) ) ).
thf(def_mor,definition,
( mor
= ( ^ [X1: $i > $o,X2: $i > $o,X3: $i] :
( ( X1 @ X3 )
| ( X2 @ X3 ) ) ) ) ).
thf(def_mand,definition,
( mand
= ( ^ [X1: $i > $o,X2: $i > $o,X3: $i] :
( ( X1 @ X3 )
& ( X2 @ X3 ) ) ) ) ).
thf(def_mimplies,definition,
( mimplies
= ( ^ [X1: $i > $o,X2: $i > $o] : ( mor @ ( mnot @ X1 ) @ X2 ) ) ) ).
thf(def_mbox_s4,definition,
( mbox_s4
= ( ^ [X1: $i > $o,X2: $i] :
! [X3: $i] :
( ^ [X4: $o,X5: $o] :
( X4
=> X5 )
@ ( irel @ X2 @ X3 )
@ ( X1 @ X3 ) ) ) ) ).
thf(def_iatom,definition,
( iatom
= ( ^ [X1: $i > $o] : X1 ) ) ).
thf(def_inot,definition,
( inot
= ( ^ [X1: $i > $o] : ( mnot @ ( mbox_s4 @ X1 ) ) ) ) ).
thf(def_itrue,definition,
( itrue
= ( ^ [X1: $i] : $true ) ) ).
thf(def_ifalse,definition,
( ifalse
= ( inot @ itrue ) ) ).
thf(def_iand,definition,
( iand
= ( ^ [X1: $i > $o,X2: $i > $o] : ( mand @ X1 @ X2 ) ) ) ).
thf(def_ior,definition,
( ior
= ( ^ [X1: $i > $o,X2: $i > $o] : ( mor @ ( mbox_s4 @ X1 ) @ ( mbox_s4 @ X2 ) ) ) ) ).
thf(def_iimplies,definition,
( iimplies
= ( ^ [X1: $i > $o,X2: $i > $o] : ( mimplies @ ( mbox_s4 @ X1 ) @ ( mbox_s4 @ X2 ) ) ) ) ).
thf(def_iimplied,definition,
( iimplied
= ( ^ [X1: $i > $o,X2: $i > $o] : ( iimplies @ X2 @ X1 ) ) ) ).
thf(def_iequiv,definition,
( iequiv
= ( ^ [X1: $i > $o,X2: $i > $o] : ( iand @ ( iimplies @ X1 @ X2 ) @ ( iimplies @ X2 @ X1 ) ) ) ) ).
thf(def_ixor,definition,
( ixor
= ( ^ [X1: $i > $o,X2: $i > $o] : ( inot @ ( iequiv @ X1 @ X2 ) ) ) ) ).
thf(def_ivalid,definition,
( ivalid
= ( ^ [X1: $i > $o] :
! [X2: $i] : ( X1 @ X2 ) ) ) ).
thf(def_isatisfiable,definition,
( isatisfiable
= ( ^ [X1: $i > $o] :
? [X2: $i] : ( X1 @ X2 ) ) ) ).
thf(def_icountersatisfiable,definition,
( icountersatisfiable
= ( ^ [X1: $i > $o] :
? [X2: $i] : ( (~) @ ( X1 @ X2 ) ) ) ) ).
thf(def_iinvalid,definition,
( iinvalid
= ( ^ [X1: $i > $o] :
! [X2: $i] : ( (~) @ ( X1 @ X2 ) ) ) ) ).
thf(con,conjecture,
! [X1: $i] :
~ ! [X2: $i] :
( ( irel @ X1 @ X2 )
=> ~ ! [X3: $i] :
( ( irel @ X2 @ X3 )
=> ( a @ X3 ) ) ) ).
thf(h1,negated_conjecture,
~ ! [X1: $i] :
~ ! [X2: $i] :
( ( irel @ X1 @ X2 )
=> ~ ! [X3: $i] :
( ( irel @ X2 @ X3 )
=> ( a @ X3 ) ) ),
inference(assume_negation,[status(cth)],[con]) ).
thf(h2,assumption,
sP8,
introduced(assumption,[]) ).
thf(1,plain,
( ~ sP4
| sP7 ),
inference(all_rule,[status(thm)],]) ).
thf(2,plain,
( sP1
| ~ sP7 ),
inference(prop_rule,[status(thm)],]) ).
thf(3,plain,
( sP3
| ~ sP1 ),
inference(eigen_choice_rule,[status(thm),assumptions([h0])],[h0,eigendef_eigen__1]) ).
thf(4,plain,
( ~ sP2
| ~ sP6
| ~ sP3 ),
inference(prop_rule,[status(thm)],]) ).
thf(5,plain,
( ~ sP5
| sP6 ),
inference(all_rule,[status(thm)],]) ).
thf(6,plain,
( ~ sP8
| sP2 ),
inference(all_rule,[status(thm)],]) ).
thf(axiom1,axiom,
sP4 ).
thf(refl_axiom,axiom,
sP5 ).
thf(7,plain,
$false,
inference(prop_unsat,[status(thm),assumptions([h2,h1,h0])],[1,2,3,4,5,6,h2,axiom1,refl_axiom]) ).
thf(8,plain,
$false,
inference(tab_negall,[status(thm),assumptions([h1,h0]),tab_negall(discharge,[h2]),tab_negall(eigenvar,eigen__0)],[h1,7,h2]) ).
thf(9,plain,
$false,
inference(eigenvar_choice,[status(thm),assumptions([h1]),eigenvar_choice(discharge,[h0])],[8,h0]) ).
thf(0,theorem,
! [X1: $i] :
~ ! [X2: $i] :
( ( irel @ X1 @ X2 )
=> ~ ! [X3: $i] :
( ( irel @ X2 @ X3 )
=> ( a @ X3 ) ) ),
inference(contra,[status(thm),contra(discharge,[h1])],[8,h1]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SYO059^4 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.13 % Command : lash -P picomus -M modes -p tstp -t %d %s
% 0.13/0.35 % Computer : n024.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sat Aug 26 01:24:54 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.42 % SZS status Theorem
% 0.20/0.42 % Mode: cade22grackle2xfee4
% 0.20/0.42 % Steps: 27
% 0.20/0.42 % SZS output start Proof
% See solution above
%------------------------------------------------------------------------------