TSTP Solution File: NUM689^1 by Lash---1.13
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Lash---1.13
% Problem : NUM689^1 : TPTP v8.1.2. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : lash -P picomus -M modes -p tstp -t %d %s
% Computer : n020.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 11:40:29 EDT 2023
% Result : Theorem 0.81s 1.02s
% Output : Proof 0.81s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
thf(ty_nat,type,
nat: $tType ).
thf(ty_x,type,
x: nat ).
thf(ty_some,type,
some: ( nat > $o ) > $o ).
thf(ty_moreis,type,
moreis: nat > nat > $o ).
thf(ty_u,type,
u: nat ).
thf(ty_lessis,type,
lessis: nat > nat > $o ).
thf(ty_pl,type,
pl: nat > nat > nat ).
thf(ty_y,type,
y: nat ).
thf(ty_diffprop,type,
diffprop: nat > nat > nat > $o ).
thf(ty_z,type,
z: nat ).
thf(sP1,plain,
( sP1
<=> ( some @ ( diffprop @ u @ z ) ) ),
introduced(definition,[new_symbols(definition,[sP1])]) ).
thf(sP2,plain,
( sP2
<=> ( ( lessis @ x @ y )
=> ( moreis @ y @ x ) ) ),
introduced(definition,[new_symbols(definition,[sP2])]) ).
thf(sP3,plain,
( sP3
<=> ( moreis @ y @ x ) ),
introduced(definition,[new_symbols(definition,[sP3])]) ).
thf(sP4,plain,
( sP4
<=> ( some @ ( diffprop @ ( pl @ y @ u ) @ ( pl @ x @ z ) ) ) ),
introduced(definition,[new_symbols(definition,[sP4])]) ).
thf(sP5,plain,
( sP5
<=> ! [X1: nat,X2: nat,X3: nat] :
( ( moreis @ y @ X1 )
=> ( ( some @ ( diffprop @ X2 @ X3 ) )
=> ( some @ ( diffprop @ ( pl @ y @ X2 ) @ ( pl @ X1 @ X3 ) ) ) ) ) ),
introduced(definition,[new_symbols(definition,[sP5])]) ).
thf(sP6,plain,
( sP6
<=> ( sP3
=> ( sP1
=> sP4 ) ) ),
introduced(definition,[new_symbols(definition,[sP6])]) ).
thf(sP7,plain,
( sP7
<=> ! [X1: nat,X2: nat] :
( sP3
=> ( ( some @ ( diffprop @ X1 @ X2 ) )
=> ( some @ ( diffprop @ ( pl @ y @ X1 ) @ ( pl @ x @ X2 ) ) ) ) ) ),
introduced(definition,[new_symbols(definition,[sP7])]) ).
thf(sP8,plain,
( sP8
<=> ! [X1: nat] :
( ( lessis @ x @ X1 )
=> ( moreis @ X1 @ x ) ) ),
introduced(definition,[new_symbols(definition,[sP8])]) ).
thf(sP9,plain,
( sP9
<=> ( sP1
=> sP4 ) ),
introduced(definition,[new_symbols(definition,[sP9])]) ).
thf(sP10,plain,
( sP10
<=> ! [X1: nat,X2: nat,X3: nat,X4: nat] :
( ( moreis @ X1 @ X2 )
=> ( ( some @ ( diffprop @ X3 @ X4 ) )
=> ( some @ ( diffprop @ ( pl @ X1 @ X3 ) @ ( pl @ X2 @ X4 ) ) ) ) ) ),
introduced(definition,[new_symbols(definition,[sP10])]) ).
thf(sP11,plain,
( sP11
<=> ( lessis @ x @ y ) ),
introduced(definition,[new_symbols(definition,[sP11])]) ).
thf(sP12,plain,
( sP12
<=> ! [X1: nat,X2: nat] :
( ( lessis @ X1 @ X2 )
=> ( moreis @ X2 @ X1 ) ) ),
introduced(definition,[new_symbols(definition,[sP12])]) ).
thf(sP13,plain,
( sP13
<=> ! [X1: nat] :
( sP3
=> ( ( some @ ( diffprop @ u @ X1 ) )
=> ( some @ ( diffprop @ ( pl @ y @ u ) @ ( pl @ x @ X1 ) ) ) ) ) ),
introduced(definition,[new_symbols(definition,[sP13])]) ).
thf(satz22c,conjecture,
sP4 ).
thf(h0,negated_conjecture,
~ sP4,
inference(assume_negation,[status(cth)],[satz22c]) ).
thf(1,plain,
( ~ sP9
| ~ sP1
| sP4 ),
inference(prop_rule,[status(thm)],]) ).
thf(2,plain,
( ~ sP6
| ~ sP3
| sP9 ),
inference(prop_rule,[status(thm)],]) ).
thf(3,plain,
( ~ sP13
| sP6 ),
inference(all_rule,[status(thm)],]) ).
thf(4,plain,
( ~ sP7
| sP13 ),
inference(all_rule,[status(thm)],]) ).
thf(5,plain,
( ~ sP5
| sP7 ),
inference(all_rule,[status(thm)],]) ).
thf(6,plain,
( ~ sP2
| ~ sP11
| sP3 ),
inference(prop_rule,[status(thm)],]) ).
thf(7,plain,
( ~ sP10
| sP5 ),
inference(all_rule,[status(thm)],]) ).
thf(8,plain,
( ~ sP8
| sP2 ),
inference(all_rule,[status(thm)],]) ).
thf(9,plain,
( ~ sP12
| sP8 ),
inference(all_rule,[status(thm)],]) ).
thf(satz14,axiom,
sP12 ).
thf(satz22a,axiom,
sP10 ).
thf(k,axiom,
sP1 ).
thf(l,axiom,
sP11 ).
thf(10,plain,
$false,
inference(prop_unsat,[status(thm),assumptions([h0])],[1,2,3,4,5,6,7,8,9,h0,satz14,satz22a,k,l]) ).
thf(0,theorem,
sP4,
inference(contra,[status(thm),contra(discharge,[h0])],[10,h0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : NUM689^1 : TPTP v8.1.2. Released v3.7.0.
% 0.00/0.13 % Command : lash -P picomus -M modes -p tstp -t %d %s
% 0.13/0.35 % Computer : n020.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 : Fri Aug 25 13:10:15 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.81/1.02 % SZS status Theorem
% 0.81/1.02 % Mode: cade22grackle2xfee4
% 0.81/1.02 % Steps: 17190
% 0.81/1.02 % SZS output start Proof
% See solution above
%------------------------------------------------------------------------------