TSTP Solution File: LCL609^1 by Satallax---3.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Satallax---3.5
% Problem : LCL609^1 : TPTP v8.1.0. Released v3.6.0.
% Transfm : none
% Format : tptp:raw
% Command : satallax -E eprover-ho -P picomus -M modes -p tstp -t %d %s
% Computer : n023.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 : Sun Jul 17 14:09:04 EDT 2022
% Result : Theorem 0.18s 0.35s
% Output : Proof 0.18s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
thf(ty_individuals,type,
individuals: $tType ).
thf(ty_eigen__2,type,
eigen__2: individuals ).
thf(ty_eigen__1,type,
eigen__1: $i ).
thf(ty_eigen__0,type,
eigen__0: individuals > $i > $o ).
thf(sP1,plain,
( sP1
<=> ! [X1: individuals] : ( !! @ ( eigen__0 @ X1 ) ) ),
introduced(definition,[new_symbols(definition,[sP1])]) ).
thf(sP2,plain,
( sP2
<=> ( !! @ ( eigen__0 @ eigen__2 ) ) ),
introduced(definition,[new_symbols(definition,[sP2])]) ).
thf(sP3,plain,
( sP3
<=> ( eigen__0 @ eigen__2 @ eigen__1 ) ),
introduced(definition,[new_symbols(definition,[sP3])]) ).
thf(def_mfalse,definition,
( mfalse
= ( ^ [X1: $i] : $false ) ) ).
thf(def_mtrue,definition,
( mtrue
= ( ^ [X1: $i] : ~ $false ) ) ).
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_mimpl,definition,
( mimpl
= ( ^ [X1: $i > $o] : ( mor @ ( mnot @ X1 ) ) ) ) ).
thf(def_miff,definition,
( miff
= ( ^ [X1: $i > $o,X2: $i > $o] : ( mand @ ( mimpl @ X1 @ X2 ) @ ( mimpl @ X2 @ X1 ) ) ) ) ).
thf(def_mbox,definition,
( mbox
= ( ^ [X1: $i > $i > $o,X2: $i > $o,X3: $i] :
! [X4: $i] :
( ( X1 @ X3 @ X4 )
=> ( X2 @ X4 ) ) ) ) ).
thf(def_mdia,definition,
( mdia
= ( ^ [X1: $i > $i > $o,X2: $i > $o,X3: $i] :
~ ! [X4: $i] :
( ( X1 @ X3 @ X4 )
=> ~ ( X2 @ X4 ) ) ) ) ).
thf(def_mall,definition,
( mall
= ( ^ [X1: individuals > $i > $o,X2: $i] :
! [X3: individuals] : ( X1 @ X3 @ X2 ) ) ) ).
thf(def_mexists,definition,
( mexists
= ( ^ [X1: individuals > $i > $o,X2: $i] :
~ ! [X3: individuals] :
~ ( X1 @ X3 @ X2 ) ) ) ).
thf(def_mvalid,definition,
mvalid = !! ).
thf(def_msatisfiable,definition,
( msatisfiable
= ( ^ [X1: $i > $o] :
~ ! [X2: $i] :
~ ( X1 @ X2 ) ) ) ).
thf(def_mcountersatisfiable,definition,
( mcountersatisfiable
= ( ^ [X1: $i > $o] :
~ ( !! @ X1 ) ) ) ).
thf(def_minvalid,definition,
( minvalid
= ( ^ [X1: $i > $o] :
! [X2: $i] :
~ ( X1 @ X2 ) ) ) ).
thf(thm,conjecture,
! [X1: individuals > $i > $o] :
( ! [X2: individuals] : ( !! @ ( X1 @ X2 ) )
=> ! [X2: $i,X3: individuals] : ( X1 @ X3 @ X2 ) ) ).
thf(h0,negated_conjecture,
~ ! [X1: individuals > $i > $o] :
( ! [X2: individuals] : ( !! @ ( X1 @ X2 ) )
=> ! [X2: $i,X3: individuals] : ( X1 @ X3 @ X2 ) ),
inference(assume_negation,[status(cth)],[thm]) ).
thf(h1,assumption,
~ ( sP1
=> ! [X1: $i,X2: individuals] : ( eigen__0 @ X2 @ X1 ) ),
introduced(assumption,[]) ).
thf(h2,assumption,
sP1,
introduced(assumption,[]) ).
thf(h3,assumption,
~ ! [X1: $i,X2: individuals] : ( eigen__0 @ X2 @ X1 ),
introduced(assumption,[]) ).
thf(h4,assumption,
~ ! [X1: individuals] : ( eigen__0 @ X1 @ eigen__1 ),
introduced(assumption,[]) ).
thf(h5,assumption,
~ sP3,
introduced(assumption,[]) ).
thf(1,plain,
( ~ sP2
| sP3 ),
inference(all_rule,[status(thm)],]) ).
thf(2,plain,
( ~ sP1
| sP2 ),
inference(all_rule,[status(thm)],]) ).
thf(3,plain,
$false,
inference(prop_unsat,[status(thm),assumptions([h5,h4,h2,h3,h1,h0])],[1,2,h2,h5]) ).
thf(4,plain,
$false,
inference(tab_negall,[status(thm),assumptions([h4,h2,h3,h1,h0]),tab_negall(discharge,[h5]),tab_negall(eigenvar,eigen__2)],[h4,3,h5]) ).
thf(5,plain,
$false,
inference(tab_negall,[status(thm),assumptions([h2,h3,h1,h0]),tab_negall(discharge,[h4]),tab_negall(eigenvar,eigen__1)],[h3,4,h4]) ).
thf(6,plain,
$false,
inference(tab_negimp,[status(thm),assumptions([h1,h0]),tab_negimp(discharge,[h2,h3])],[h1,5,h2,h3]) ).
thf(7,plain,
$false,
inference(tab_negall,[status(thm),assumptions([h0]),tab_negall(discharge,[h1]),tab_negall(eigenvar,eigen__0)],[h0,6,h1]) ).
thf(0,theorem,
! [X1: individuals > $i > $o] :
( ! [X2: individuals] : ( !! @ ( X1 @ X2 ) )
=> ! [X2: $i,X3: individuals] : ( X1 @ X3 @ X2 ) ),
inference(contra,[status(thm),contra(discharge,[h0])],[7,h0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : LCL609^1 : TPTP v8.1.0. Released v3.6.0.
% 0.11/0.12 % Command : satallax -E eprover-ho -P picomus -M modes -p tstp -t %d %s
% 0.12/0.33 % Computer : n023.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sat Jul 2 14:51:13 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.35 % SZS status Theorem
% 0.18/0.35 % Mode: mode213
% 0.18/0.35 % Inferences: 15
% 0.18/0.35 % SZS output start Proof
% See solution above
%------------------------------------------------------------------------------