TSTP Solution File: LAT385+4 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : LAT385+4 : 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/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% Computer : n010.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:06 EDT 2023
% Result : Theorem 7.03s 2.53s
% Output : CNFRefutation 7.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 47
% Syntax : Number of formulae : 58 ( 6 unt; 44 typ; 0 def)
% Number of atoms : 80 ( 3 equ)
% Maximal formula atoms : 37 ( 5 avg)
% Number of connectives : 77 ( 11 ~; 13 |; 36 &)
% ( 0 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 68 ( 39 >; 29 *; 0 +; 0 <<)
% Number of predicates : 17 ( 15 usr; 1 prp; 0-3 aty)
% Number of functors : 29 ( 29 usr; 5 con; 0-3 aty)
% Number of variables : 23 (; 20 !; 3 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ aUpperBoundOfIn0 > aSupremumOfIn0 > aLowerBoundOfIn0 > aInfimumOfIn0 > sdtlseqdt0 > isOn0 > aSubsetOf0 > aFixedPointOf0 > aElementOf0 > isMonotone0 > isEmpty0 > aSet0 > aFunction0 > aElement0 > aCompleteLattice0 > cS1241 > sdtlpdtrp0 > #nlpp > szRzazndt0 > szDzozmdt0 > cS1142 > xf > xU > xT > xS > xP > #skF_7 > #skF_18 > #skF_6 > #skF_19 > #skF_1 > #skF_4 > #skF_14 > #skF_15 > #skF_10 > #skF_5 > #skF_8 > #skF_13 > #skF_17 > #skF_11 > #skF_3 > #skF_2 > #skF_12 > #skF_16 > #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('#skF_18',type,
'#skF_18': $i > $i ).
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_19',type,
'#skF_19': $i > $i ).
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('#skF_14',type,
'#skF_14': ( $i * $i ) > $i ).
tff(xP,type,
xP: $i ).
tff('#skF_15',type,
'#skF_15': $i > $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('#skF_13',type,
'#skF_13': $i > $i ).
tff(aFunction0,type,
aFunction0: $i > $o ).
tff('#skF_17',type,
'#skF_17': $i > $i ).
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('#skF_12',type,
'#skF_12': $i > $i ).
tff(aSupremumOfIn0,type,
aSupremumOfIn0: ( $i * $i * $i ) > $o ).
tff('#skF_16',type,
'#skF_16': ( $i * $i ) > $i ).
tff('#skF_9',type,
'#skF_9': ( $i * $i ) > $i ).
tff(aCompleteLattice0,type,
aCompleteLattice0: $i > $o ).
tff(f_386,hypothesis,
( aSet0(xP)
& ! [W0] :
( ( aElementOf0(W0,xP)
=> ( aElementOf0(W0,xU)
& sdtlseqdt0(sdtlpdtrp0(xf,W0),W0)
& ! [W1] :
( aElementOf0(W1,xT)
=> sdtlseqdt0(W1,W0) )
& aUpperBoundOfIn0(W0,xT,xU) ) )
& ( ( aElementOf0(W0,xU)
& sdtlseqdt0(sdtlpdtrp0(xf,W0),W0)
& ( ! [W1] :
( aElementOf0(W1,xT)
=> sdtlseqdt0(W1,W0) )
| aUpperBoundOfIn0(W0,xT,xU) ) )
=> aElementOf0(W0,xP) ) )
& ( xP = cS1241(xU,xf,xT) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1244) ).
tff(f_328,hypothesis,
( aSet0(xU)
& ! [W0] :
( ( ( aSet0(W0)
& ! [W1] :
( aElementOf0(W1,W0)
=> aElementOf0(W1,xU) ) )
| aSubsetOf0(W0,xU) )
=> ? [W1] :
( aElementOf0(W1,xU)
& aElementOf0(W1,xU)
& ! [W2] :
( aElementOf0(W2,W0)
=> sdtlseqdt0(W1,W2) )
& aLowerBoundOfIn0(W1,W0,xU)
& ! [W2] :
( ( ( aElementOf0(W2,xU)
& ! [W3] :
( aElementOf0(W3,W0)
=> sdtlseqdt0(W2,W3) ) )
| aLowerBoundOfIn0(W2,W0,xU) )
=> sdtlseqdt0(W2,W1) )
& aInfimumOfIn0(W1,W0,xU)
& ? [W2] :
( aElementOf0(W2,xU)
& aElementOf0(W2,xU)
& ! [W3] :
( aElementOf0(W3,W0)
=> sdtlseqdt0(W3,W2) )
& aUpperBoundOfIn0(W2,W0,xU)
& ! [W3] :
( ( ( aElementOf0(W3,xU)
& ! [W4] :
( aElementOf0(W4,W0)
=> sdtlseqdt0(W4,W3) ) )
| aUpperBoundOfIn0(W3,W0,xU) )
=> sdtlseqdt0(W2,W3) )
& aSupremumOfIn0(W2,W0,xU) ) ) )
& aCompleteLattice0(xU)
& aFunction0(xf)
& ! [W0,W1] :
( ( aElementOf0(W0,szDzozmdt0(xf))
& aElementOf0(W1,szDzozmdt0(xf)) )
=> ( sdtlseqdt0(W0,W1)
=> sdtlseqdt0(sdtlpdtrp0(xf,W0),sdtlpdtrp0(xf,W1)) ) )
& isMonotone0(xf)
& ( szDzozmdt0(xf) = szRzazndt0(xf) )
& ( szRzazndt0(xf) = xU )
& isOn0(xf,xU) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1123) ).
tff(f_412,negated_conjecture,
~ ? [W0] :
( ( aElementOf0(W0,xU)
& ( ( aElementOf0(W0,xU)
& ! [W1] :
( aElementOf0(W1,xP)
=> sdtlseqdt0(W0,W1) ) )
| aLowerBoundOfIn0(W0,xP,xU) )
& ! [W1] :
( ( aElementOf0(W1,xU)
& ! [W2] :
( aElementOf0(W2,xP)
=> sdtlseqdt0(W1,W2) )
& aLowerBoundOfIn0(W1,xP,xU) )
=> sdtlseqdt0(W1,W0) ) )
| aInfimumOfIn0(W0,xP,xU) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
tff(c_238,plain,
! [W0_238] :
( aElementOf0(W0_238,xU)
| ~ aElementOf0(W0_238,xP) ),
inference(cnfTransformation,[status(thm)],[f_386]) ).
tff(c_230,plain,
aSet0(xP),
inference(cnfTransformation,[status(thm)],[f_386]) ).
tff(c_2142,plain,
! [W0_421] :
( ~ aElementOf0('#skF_12'(W0_421),xU)
| ~ aSet0(W0_421)
| aInfimumOfIn0('#skF_13'(W0_421),W0_421,xU) ),
inference(cnfTransformation,[status(thm)],[f_328]) ).
tff(c_246,plain,
! [W0_242] : ~ aInfimumOfIn0(W0_242,xP,xU),
inference(cnfTransformation,[status(thm)],[f_412]) ).
tff(c_2146,plain,
( ~ aElementOf0('#skF_12'(xP),xU)
| ~ aSet0(xP) ),
inference(resolution,[status(thm)],[c_2142,c_246]) ).
tff(c_2149,plain,
~ aElementOf0('#skF_12'(xP),xU),
inference(demodulation,[status(thm),theory(equality)],[c_230,c_2146]) ).
tff(c_2156,plain,
~ aElementOf0('#skF_12'(xP),xP),
inference(resolution,[status(thm)],[c_238,c_2149]) ).
tff(c_2325,plain,
! [W0_442] :
( aElementOf0('#skF_12'(W0_442),W0_442)
| ~ aSet0(W0_442)
| aInfimumOfIn0('#skF_13'(W0_442),W0_442,xU) ),
inference(cnfTransformation,[status(thm)],[f_328]) ).
tff(c_2329,plain,
( aElementOf0('#skF_12'(xP),xP)
| ~ aSet0(xP) ),
inference(resolution,[status(thm)],[c_2325,c_246]) ).
tff(c_2332,plain,
aElementOf0('#skF_12'(xP),xP),
inference(demodulation,[status(thm),theory(equality)],[c_230,c_2329]) ).
tff(c_2334,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_2156,c_2332]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LAT385+4 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.13 % Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.14/0.35 % Computer : n010.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 3 12:28:28 EDT 2023
% 0.14/0.35 % CPUTime :
% 7.03/2.53 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 7.03/2.53
% 7.03/2.53 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 7.19/2.56
% 7.19/2.56 Inference rules
% 7.19/2.56 ----------------------
% 7.19/2.56 #Ref : 0
% 7.19/2.56 #Sup : 350
% 7.19/2.56 #Fact : 0
% 7.19/2.56 #Define : 0
% 7.19/2.56 #Split : 17
% 7.19/2.56 #Chain : 0
% 7.19/2.56 #Close : 0
% 7.19/2.56
% 7.19/2.56 Ordering : KBO
% 7.19/2.56
% 7.19/2.56 Simplification rules
% 7.19/2.56 ----------------------
% 7.19/2.56 #Subsume : 111
% 7.19/2.56 #Demod : 230
% 7.19/2.56 #Tautology : 73
% 7.19/2.56 #SimpNegUnit : 10
% 7.19/2.56 #BackRed : 2
% 7.19/2.56
% 7.19/2.56 #Partial instantiations: 0
% 7.19/2.56 #Strategies tried : 1
% 7.19/2.56
% 7.19/2.56 Timing (in seconds)
% 7.19/2.56 ----------------------
% 7.19/2.56 Preprocessing : 0.72
% 7.19/2.56 Parsing : 0.35
% 7.19/2.56 CNF conversion : 0.07
% 7.19/2.56 Main loop : 0.81
% 7.19/2.56 Inferencing : 0.29
% 7.19/2.56 Reduction : 0.24
% 7.19/2.56 Demodulation : 0.16
% 7.19/2.56 BG Simplification : 0.05
% 7.19/2.56 Subsumption : 0.16
% 7.19/2.56 Abstraction : 0.03
% 7.19/2.57 MUC search : 0.00
% 7.19/2.57 Cooper : 0.00
% 7.19/2.57 Total : 1.57
% 7.19/2.57 Index Insertion : 0.00
% 7.19/2.57 Index Deletion : 0.00
% 7.19/2.57 Index Matching : 0.00
% 7.19/2.57 BG Taut test : 0.00
%------------------------------------------------------------------------------