TSTP Solution File: LAT388+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : LAT388+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% Computer : n011.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 : Tue Aug 22 10:47:07 EDT 2023
% Result : Theorem 3.53s 1.80s
% Output : CNFRefutation 3.76s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 39
% Syntax : Number of formulae : 42 ( 4 unt; 37 typ; 0 def)
% Number of atoms : 6 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 3 ( 2 ~; 0 |; 1 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 58 ( 31 >; 27 *; 0 +; 0 <<)
% Number of predicates : 16 ( 15 usr; 1 prp; 0-3 aty)
% Number of functors : 22 ( 22 usr; 6 con; 0-3 aty)
% Number of variables : 2 (; 1 !; 1 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ aUpperBoundOfIn0 > aSupremumOfIn0 > aLowerBoundOfIn0 > aInfimumOfIn0 > sdtlseqdt0 > isOn0 > aSubsetOf0 > aFixedPointOf0 > aElementOf0 > isMonotone0 > isEmpty0 > aSet0 > aFunction0 > aElement0 > aCompleteLattice0 > cS1241 > sdtlpdtrp0 > #nlpp > szRzazndt0 > szDzozmdt0 > cS1142 > xp > xf > xU > xT > xS > xP > #skF_7 > #skF_6 > #skF_1 > #skF_4 > #skF_10 > #skF_5 > #skF_8 > #skF_11 > #skF_3 > #skF_2 > #skF_9
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_7',type,
'#skF_7': $i > $i ).
tff(xf,type,
xf: $i ).
tff(aSet0,type,
aSet0: $i > $o ).
tff(cS1241,type,
cS1241: ( $i * $i * $i ) > $i ).
tff(cS1142,type,
cS1142: $i > $i ).
tff(szDzozmdt0,type,
szDzozmdt0: $i > $i ).
tff('#skF_6',type,
'#skF_6': ( $i * $i * $i ) > $i ).
tff(aFixedPointOf0,type,
aFixedPointOf0: ( $i * $i ) > $o ).
tff('#skF_1',type,
'#skF_1': $i > $i ).
tff(aElement0,type,
aElement0: $i > $o ).
tff(sdtlseqdt0,type,
sdtlseqdt0: ( $i * $i ) > $o ).
tff(xS,type,
xS: $i ).
tff(sdtlpdtrp0,type,
sdtlpdtrp0: ( $i * $i ) > $i ).
tff(aUpperBoundOfIn0,type,
aUpperBoundOfIn0: ( $i * $i * $i ) > $o ).
tff('#skF_4',type,
'#skF_4': ( $i * $i * $i ) > $i ).
tff(xP,type,
xP: $i ).
tff(xU,type,
xU: $i ).
tff('#skF_10',type,
'#skF_10': $i > $i ).
tff(aSubsetOf0,type,
aSubsetOf0: ( $i * $i ) > $o ).
tff('#skF_5',type,
'#skF_5': ( $i * $i * $i ) > $i ).
tff(aLowerBoundOfIn0,type,
aLowerBoundOfIn0: ( $i * $i * $i ) > $o ).
tff(isMonotone0,type,
isMonotone0: $i > $o ).
tff('#skF_8',type,
'#skF_8': ( $i * $i ) > $i ).
tff(xT,type,
xT: $i ).
tff(aElementOf0,type,
aElementOf0: ( $i * $i ) > $o ).
tff(aFunction0,type,
aFunction0: $i > $o ).
tff(aInfimumOfIn0,type,
aInfimumOfIn0: ( $i * $i * $i ) > $o ).
tff('#skF_11',type,
'#skF_11': $i > $i ).
tff('#skF_3',type,
'#skF_3': ( $i * $i * $i ) > $i ).
tff(isOn0,type,
isOn0: ( $i * $i ) > $o ).
tff('#skF_2',type,
'#skF_2': ( $i * $i ) > $i ).
tff(szRzazndt0,type,
szRzazndt0: $i > $i ).
tff(isEmpty0,type,
isEmpty0: $i > $o ).
tff(xp,type,
xp: $i ).
tff(aSupremumOfIn0,type,
aSupremumOfIn0: ( $i * $i * $i ) > $o ).
tff('#skF_9',type,
'#skF_9': ( $i * $i ) > $i ).
tff(aCompleteLattice0,type,
aCompleteLattice0: $i > $o ).
tff(f_264,negated_conjecture,
~ ? [W0] : aSupremumOfIn0(W0,xT,xS),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
tff(f_261,hypothesis,
( aFixedPointOf0(xp,xf)
& aSupremumOfIn0(xp,xT,xS) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1330) ).
tff(c_132,plain,
! [W0_182] : ~ aSupremumOfIn0(W0_182,xT,xS),
inference(cnfTransformation,[status(thm)],[f_264]) ).
tff(c_128,plain,
aSupremumOfIn0(xp,xT,xS),
inference(cnfTransformation,[status(thm)],[f_261]) ).
tff(c_133,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_132,c_128]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : LAT388+1 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.14 % Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.13/0.36 % Computer : n011.cluster.edu
% 0.13/0.36 % Model : x86_64 x86_64
% 0.13/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.36 % Memory : 8042.1875MB
% 0.13/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.36 % CPULimit : 300
% 0.13/0.36 % WCLimit : 300
% 0.13/0.36 % DateTime : Thu Aug 3 12:18:51 EDT 2023
% 0.13/0.36 % CPUTime :
% 3.53/1.80 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.53/1.81
% 3.53/1.81 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.76/1.83
% 3.76/1.83 Inference rules
% 3.76/1.83 ----------------------
% 3.76/1.83 #Ref : 0
% 3.76/1.83 #Sup : 0
% 3.76/1.83 #Fact : 0
% 3.76/1.83 #Define : 0
% 3.76/1.83 #Split : 0
% 3.76/1.83 #Chain : 0
% 3.76/1.83 #Close : 0
% 3.76/1.83
% 3.76/1.83 Ordering : KBO
% 3.76/1.83
% 3.76/1.83 Simplification rules
% 3.76/1.83 ----------------------
% 3.76/1.83 #Subsume : 61
% 3.76/1.83 #Demod : 0
% 3.76/1.83 #Tautology : 4
% 3.76/1.83 #SimpNegUnit : 1
% 3.76/1.83 #BackRed : 0
% 3.76/1.83
% 3.76/1.83 #Partial instantiations: 0
% 3.76/1.83 #Strategies tried : 1
% 3.76/1.83
% 3.76/1.83 Timing (in seconds)
% 3.76/1.83 ----------------------
% 3.76/1.84 Preprocessing : 0.71
% 3.76/1.84 Parsing : 0.33
% 3.76/1.84 CNF conversion : 0.07
% 3.76/1.84 Main loop : 0.06
% 3.76/1.84 Inferencing : 0.00
% 3.76/1.84 Reduction : 0.02
% 3.76/1.84 Demodulation : 0.02
% 3.76/1.84 BG Simplification : 0.04
% 3.76/1.84 Subsumption : 0.03
% 3.76/1.84 Abstraction : 0.01
% 3.76/1.84 MUC search : 0.00
% 3.76/1.84 Cooper : 0.00
% 3.76/1.84 Total : 0.81
% 3.76/1.84 Index Insertion : 0.00
% 3.76/1.84 Index Deletion : 0.00
% 3.76/1.84 Index Matching : 0.00
% 3.76/1.84 BG Taut test : 0.00
%------------------------------------------------------------------------------