TSTP Solution File: LAT388+4 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : LAT388+4 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n007.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 06:02:24 EDT 2023
% Result : Theorem 0.20s 0.59s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 50
% Syntax : Number of formulae : 56 ( 3 unt; 48 typ; 0 def)
% Number of atoms : 100 ( 2 equ)
% Maximal formula atoms : 48 ( 12 avg)
% Number of connectives : 134 ( 42 ~; 46 |; 37 &)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 9 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 71 ( 42 >; 29 *; 0 +; 0 <<)
% Number of predicates : 18 ( 16 usr; 1 prp; 0-3 aty)
% Number of functors : 32 ( 32 usr; 6 con; 0-3 aty)
% Number of variables : 17 ( 1 sgn; 14 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
aSet0: $i > $o ).
tff(decl_23,type,
aElement0: $i > $o ).
tff(decl_24,type,
aElementOf0: ( $i * $i ) > $o ).
tff(decl_25,type,
isEmpty0: $i > $o ).
tff(decl_26,type,
aSubsetOf0: ( $i * $i ) > $o ).
tff(decl_27,type,
sdtlseqdt0: ( $i * $i ) > $o ).
tff(decl_28,type,
aLowerBoundOfIn0: ( $i * $i * $i ) > $o ).
tff(decl_29,type,
aUpperBoundOfIn0: ( $i * $i * $i ) > $o ).
tff(decl_30,type,
aInfimumOfIn0: ( $i * $i * $i ) > $o ).
tff(decl_31,type,
aSupremumOfIn0: ( $i * $i * $i ) > $o ).
tff(decl_32,type,
aCompleteLattice0: $i > $o ).
tff(decl_33,type,
aFunction0: $i > $o ).
tff(decl_34,type,
szDzozmdt0: $i > $i ).
tff(decl_35,type,
szRzazndt0: $i > $i ).
tff(decl_36,type,
isOn0: ( $i * $i ) > $o ).
tff(decl_37,type,
sdtlpdtrp0: ( $i * $i ) > $i ).
tff(decl_38,type,
aFixedPointOf0: ( $i * $i ) > $o ).
tff(decl_39,type,
isMonotone0: $i > $o ).
tff(decl_40,type,
xU: $i ).
tff(decl_41,type,
xf: $i ).
tff(decl_42,type,
xS: $i ).
tff(decl_43,type,
cS1142: $i > $i ).
tff(decl_44,type,
xT: $i ).
tff(decl_45,type,
xP: $i ).
tff(decl_46,type,
cS1241: ( $i * $i * $i ) > $i ).
tff(decl_47,type,
xp: $i ).
tff(decl_48,type,
epred1_1: $i > $o ).
tff(decl_49,type,
esk1_1: $i > $i ).
tff(decl_50,type,
esk2_2: ( $i * $i ) > $i ).
tff(decl_51,type,
esk3_3: ( $i * $i * $i ) > $i ).
tff(decl_52,type,
esk4_3: ( $i * $i * $i ) > $i ).
tff(decl_53,type,
esk5_3: ( $i * $i * $i ) > $i ).
tff(decl_54,type,
esk6_3: ( $i * $i * $i ) > $i ).
tff(decl_55,type,
esk7_2: ( $i * $i ) > $i ).
tff(decl_56,type,
esk8_2: ( $i * $i ) > $i ).
tff(decl_57,type,
esk9_1: $i > $i ).
tff(decl_58,type,
esk10_1: $i > $i ).
tff(decl_59,type,
esk11_1: $i > $i ).
tff(decl_60,type,
esk12_1: $i > $i ).
tff(decl_61,type,
esk13_1: $i > $i ).
tff(decl_62,type,
esk14_1: $i > $i ).
tff(decl_63,type,
esk15_1: $i > $i ).
tff(decl_64,type,
esk16_1: $i > $i ).
tff(decl_65,type,
esk17_1: $i > $i ).
tff(decl_66,type,
esk18_1: $i > $i ).
tff(decl_67,type,
esk19_2: ( $i * $i ) > $i ).
tff(decl_68,type,
esk20_1: $i > $i ).
tff(decl_69,type,
esk21_2: ( $i * $i ) > $i ).
fof(m__,conjecture,
? [X1] :
( ( aElementOf0(X1,xS)
& ( ( aElementOf0(X1,xS)
& ! [X2] :
( aElementOf0(X2,xT)
=> sdtlseqdt0(X2,X1) ) )
| aUpperBoundOfIn0(X1,xT,xS) )
& ! [X2] :
( ( aElementOf0(X2,xS)
& ! [X3] :
( aElementOf0(X3,xT)
=> sdtlseqdt0(X3,X2) )
& aUpperBoundOfIn0(X2,xT,xS) )
=> sdtlseqdt0(X1,X2) ) )
| aSupremumOfIn0(X1,xT,xS) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(m__1330,hypothesis,
( aElementOf0(xp,szDzozmdt0(xf))
& sdtlpdtrp0(xf,xp) = xp
& aFixedPointOf0(xp,xf)
& ! [X1] :
( aElementOf0(X1,xT)
=> sdtlseqdt0(X1,xp) )
& aUpperBoundOfIn0(xp,xT,xS)
& ! [X1] :
( ( ( aElementOf0(X1,xS)
& ! [X2] :
( aElementOf0(X2,xT)
=> sdtlseqdt0(X2,X1) ) )
| aUpperBoundOfIn0(X1,xT,xS) )
=> sdtlseqdt0(xp,X1) )
& aSupremumOfIn0(xp,xT,xS) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1330) ).
fof(c_0_2,negated_conjecture,
~ ? [X1] :
( ( aElementOf0(X1,xS)
& ( ( aElementOf0(X1,xS)
& ! [X2] :
( aElementOf0(X2,xT)
=> sdtlseqdt0(X2,X1) ) )
| aUpperBoundOfIn0(X1,xT,xS) )
& ! [X2] :
( ( aElementOf0(X2,xS)
& ! [X3] :
( aElementOf0(X3,xT)
=> sdtlseqdt0(X3,X2) )
& aUpperBoundOfIn0(X2,xT,xS) )
=> sdtlseqdt0(X1,X2) ) )
| aSupremumOfIn0(X1,xT,xS) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_3,hypothesis,
! [X90,X91] :
( aElementOf0(xp,szDzozmdt0(xf))
& sdtlpdtrp0(xf,xp) = xp
& aFixedPointOf0(xp,xf)
& ( ~ aElementOf0(X90,xT)
| sdtlseqdt0(X90,xp) )
& aUpperBoundOfIn0(xp,xT,xS)
& ( aElementOf0(esk15_1(X91),xT)
| ~ aElementOf0(X91,xS)
| sdtlseqdt0(xp,X91) )
& ( ~ sdtlseqdt0(esk15_1(X91),X91)
| ~ aElementOf0(X91,xS)
| sdtlseqdt0(xp,X91) )
& ( ~ aUpperBoundOfIn0(X91,xT,xS)
| sdtlseqdt0(xp,X91) )
& aSupremumOfIn0(xp,xT,xS) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__1330])])])])]) ).
fof(c_0_4,negated_conjecture,
! [X93,X96,X97] :
( ( aElementOf0(esk17_1(X93),xS)
| aElementOf0(esk16_1(X93),xT)
| ~ aElementOf0(X93,xS)
| ~ aElementOf0(X93,xS) )
& ( ~ aElementOf0(X96,xT)
| sdtlseqdt0(X96,esk17_1(X93))
| aElementOf0(esk16_1(X93),xT)
| ~ aElementOf0(X93,xS)
| ~ aElementOf0(X93,xS) )
& ( aUpperBoundOfIn0(esk17_1(X93),xT,xS)
| aElementOf0(esk16_1(X93),xT)
| ~ aElementOf0(X93,xS)
| ~ aElementOf0(X93,xS) )
& ( ~ sdtlseqdt0(X93,esk17_1(X93))
| aElementOf0(esk16_1(X93),xT)
| ~ aElementOf0(X93,xS)
| ~ aElementOf0(X93,xS) )
& ( aElementOf0(esk17_1(X93),xS)
| ~ sdtlseqdt0(esk16_1(X93),X93)
| ~ aElementOf0(X93,xS)
| ~ aElementOf0(X93,xS) )
& ( ~ aElementOf0(X96,xT)
| sdtlseqdt0(X96,esk17_1(X93))
| ~ sdtlseqdt0(esk16_1(X93),X93)
| ~ aElementOf0(X93,xS)
| ~ aElementOf0(X93,xS) )
& ( aUpperBoundOfIn0(esk17_1(X93),xT,xS)
| ~ sdtlseqdt0(esk16_1(X93),X93)
| ~ aElementOf0(X93,xS)
| ~ aElementOf0(X93,xS) )
& ( ~ sdtlseqdt0(X93,esk17_1(X93))
| ~ sdtlseqdt0(esk16_1(X93),X93)
| ~ aElementOf0(X93,xS)
| ~ aElementOf0(X93,xS) )
& ( aElementOf0(esk17_1(X93),xS)
| ~ aUpperBoundOfIn0(X93,xT,xS)
| ~ aElementOf0(X93,xS) )
& ( ~ aElementOf0(X96,xT)
| sdtlseqdt0(X96,esk17_1(X93))
| ~ aUpperBoundOfIn0(X93,xT,xS)
| ~ aElementOf0(X93,xS) )
& ( aUpperBoundOfIn0(esk17_1(X93),xT,xS)
| ~ aUpperBoundOfIn0(X93,xT,xS)
| ~ aElementOf0(X93,xS) )
& ( ~ sdtlseqdt0(X93,esk17_1(X93))
| ~ aUpperBoundOfIn0(X93,xT,xS)
| ~ aElementOf0(X93,xS) )
& ~ aSupremumOfIn0(X97,xT,xS) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])])])]) ).
cnf(c_0_5,hypothesis,
aSupremumOfIn0(xp,xT,xS),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,negated_conjecture,
~ aSupremumOfIn0(X1,xT,xS),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,hypothesis,
$false,
inference(sr,[status(thm)],[c_0_5,c_0_6]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : LAT388+4 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.14 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.14/0.35 % Computer : n007.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu Aug 24 06:18:39 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.20/0.57 start to proof: theBenchmark
% 0.20/0.59 % Version : CSE_E---1.5
% 0.20/0.59 % Problem : theBenchmark.p
% 0.20/0.59 % Proof found
% 0.20/0.59 % SZS status Theorem for theBenchmark.p
% 0.20/0.59 % SZS output start Proof
% See solution above
% 0.20/0.60 % Total time : 0.014000 s
% 0.20/0.60 % SZS output end Proof
% 0.20/0.60 % Total time : 0.018000 s
%------------------------------------------------------------------------------