TSTP Solution File: NUM539+2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : NUM539+2 : 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 : n012.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:52:02 EDT 2023
% Result : Theorem 7.92s 2.85s
% Output : CNFRefutation 7.92s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 36
% Syntax : Number of formulae : 51 ( 8 unt; 32 typ; 0 def)
% Number of atoms : 63 ( 10 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 67 ( 23 ~; 20 |; 15 &)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 42 ( 24 >; 18 *; 0 +; 0 <<)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 24 ( 24 usr; 8 con; 0-3 aty)
% Number of variables : 17 (; 15 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ sdtlseqdt0 > iLess0 > aSubsetOf0 > aElementOf0 > isFinite0 > isCountable0 > aSet0 > aElement0 > sdtpldt0 > sdtmndt0 > #nlpp > szszuzczcdt0 > szmzizndt0 > szmzazxdt0 > sbrdtbr0 > xT > xS > szNzAzT0 > sz00 > slcrc0 > #skF_7 > #skF_11 > #skF_6 > #skF_1 > #skF_4 > #skF_13 > #skF_5 > #skF_10 > #skF_8 > #skF_3 > #skF_2 > #skF_9 > #skF_12
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_7',type,
'#skF_7': $i > $i ).
tff(sbrdtbr0,type,
sbrdtbr0: $i > $i ).
tff(aSet0,type,
aSet0: $i > $o ).
tff(szszuzczcdt0,type,
szszuzczcdt0: $i > $i ).
tff('#skF_11',type,
'#skF_11': $i ).
tff('#skF_6',type,
'#skF_6': ( $i * $i * $i ) > $i ).
tff(sdtmndt0,type,
sdtmndt0: ( $i * $i ) > $i ).
tff('#skF_1',type,
'#skF_1': $i > $i ).
tff(aElement0,type,
aElement0: $i > $o ).
tff(szNzAzT0,type,
szNzAzT0: $i ).
tff(sdtlseqdt0,type,
sdtlseqdt0: ( $i * $i ) > $o ).
tff(xS,type,
xS: $i ).
tff(sz00,type,
sz00: $i ).
tff('#skF_4',type,
'#skF_4': ( $i * $i * $i ) > $i ).
tff(sdtpldt0,type,
sdtpldt0: ( $i * $i ) > $i ).
tff(aSubsetOf0,type,
aSubsetOf0: ( $i * $i ) > $o ).
tff('#skF_13',type,
'#skF_13': $i ).
tff('#skF_5',type,
'#skF_5': ( $i * $i * $i ) > $i ).
tff(isCountable0,type,
isCountable0: $i > $o ).
tff('#skF_10',type,
'#skF_10': ( $i * $i ) > $i ).
tff('#skF_8',type,
'#skF_8': ( $i * $i ) > $i ).
tff(xT,type,
xT: $i ).
tff(aElementOf0,type,
aElementOf0: ( $i * $i ) > $o ).
tff(slcrc0,type,
slcrc0: $i ).
tff(isFinite0,type,
isFinite0: $i > $o ).
tff('#skF_3',type,
'#skF_3': ( $i * $i * $i ) > $i ).
tff('#skF_2',type,
'#skF_2': ( $i * $i ) > $i ).
tff(iLess0,type,
iLess0: ( $i * $i ) > $o ).
tff(szmzizndt0,type,
szmzizndt0: $i > $i ).
tff(szmzazxdt0,type,
szmzazxdt0: $i > $i ).
tff('#skF_9',type,
'#skF_9': ( $i * $i ) > $i ).
tff('#skF_12',type,
'#skF_12': $i ).
tff(f_467,negated_conjecture,
~ ( ( aElementOf0(szmzizndt0(xS),xS)
& ! [W0] :
( aElementOf0(W0,xS)
=> sdtlseqdt0(szmzizndt0(xS),W0) ) )
=> ( ! [W0] :
( aElementOf0(W0,xT)
=> sdtlseqdt0(szmzizndt0(xS),W0) )
| ( szmzizndt0(xS) = szmzizndt0(xT) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
tff(f_453,hypothesis,
( aElementOf0(szmzizndt0(xS),xS)
& ! [W0] :
( aElementOf0(W0,xS)
=> sdtlseqdt0(szmzizndt0(xS),W0) )
& aElementOf0(szmzizndt0(xS),xT)
& aElementOf0(szmzizndt0(xT),xT)
& ! [W0] :
( aElementOf0(W0,xT)
=> sdtlseqdt0(szmzizndt0(xT),W0) )
& aElementOf0(szmzizndt0(xT),xS) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1802) ).
tff(f_436,hypothesis,
( aSet0(xS)
& ! [W0] :
( aElementOf0(W0,xS)
=> aElementOf0(W0,szNzAzT0) )
& aSubsetOf0(xS,szNzAzT0)
& aSet0(xT)
& ! [W0] :
( aElementOf0(W0,xT)
=> aElementOf0(W0,szNzAzT0) )
& aSubsetOf0(xT,szNzAzT0)
& ~ ( ~ ? [W0] : aElementOf0(W0,xS)
| ( xS = slcrc0 ) )
& ~ ( ~ ? [W0] : aElementOf0(W0,xT)
| ( xT = slcrc0 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1779) ).
tff(f_283,axiom,
! [W0,W1] :
( ( aElementOf0(W0,szNzAzT0)
& aElementOf0(W1,szNzAzT0) )
=> ( ( sdtlseqdt0(W0,W1)
& sdtlseqdt0(W1,W0) )
=> ( W0 = W1 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mLessASymm) ).
tff(c_216,plain,
szmzizndt0(xT) != szmzizndt0(xS),
inference(cnfTransformation,[status(thm)],[f_467]) ).
tff(c_210,plain,
aElementOf0(szmzizndt0(xS),xT),
inference(cnfTransformation,[status(thm)],[f_453]) ).
tff(c_204,plain,
aElementOf0(szmzizndt0(xT),xS),
inference(cnfTransformation,[status(thm)],[f_453]) ).
tff(c_208,plain,
aElementOf0(szmzizndt0(xT),xT),
inference(cnfTransformation,[status(thm)],[f_453]) ).
tff(c_242,plain,
! [W0_139] :
( aElementOf0(W0_139,szNzAzT0)
| ~ aElementOf0(W0_139,xT) ),
inference(cnfTransformation,[status(thm)],[f_436]) ).
tff(c_256,plain,
aElementOf0(szmzizndt0(xT),szNzAzT0),
inference(resolution,[status(thm)],[c_208,c_242]) ).
tff(c_206,plain,
! [W0_133] :
( sdtlseqdt0(szmzizndt0(xT),W0_133)
| ~ aElementOf0(W0_133,xT) ),
inference(cnfTransformation,[status(thm)],[f_453]) ).
tff(c_255,plain,
aElementOf0(szmzizndt0(xS),szNzAzT0),
inference(resolution,[status(thm)],[c_210,c_242]) ).
tff(c_222,plain,
! [W0_135] :
( sdtlseqdt0(szmzizndt0(xS),W0_135)
| ~ aElementOf0(W0_135,xS) ),
inference(cnfTransformation,[status(thm)],[f_467]) ).
tff(c_3124,plain,
! [W1_311,W0_312] :
( ( W1_311 = W0_312 )
| ~ sdtlseqdt0(W1_311,W0_312)
| ~ sdtlseqdt0(W0_312,W1_311)
| ~ aElementOf0(W1_311,szNzAzT0)
| ~ aElementOf0(W0_312,szNzAzT0) ),
inference(cnfTransformation,[status(thm)],[f_283]) ).
tff(c_3152,plain,
! [W0_135] :
( ( szmzizndt0(xS) = W0_135 )
| ~ sdtlseqdt0(W0_135,szmzizndt0(xS))
| ~ aElementOf0(szmzizndt0(xS),szNzAzT0)
| ~ aElementOf0(W0_135,szNzAzT0)
| ~ aElementOf0(W0_135,xS) ),
inference(resolution,[status(thm)],[c_222,c_3124]) ).
tff(c_3182,plain,
! [W0_313] :
( ( szmzizndt0(xS) = W0_313 )
| ~ sdtlseqdt0(W0_313,szmzizndt0(xS))
| ~ aElementOf0(W0_313,szNzAzT0)
| ~ aElementOf0(W0_313,xS) ),
inference(demodulation,[status(thm),theory(equality)],[c_255,c_3152]) ).
tff(c_3198,plain,
( ( szmzizndt0(xT) = szmzizndt0(xS) )
| ~ aElementOf0(szmzizndt0(xT),szNzAzT0)
| ~ aElementOf0(szmzizndt0(xT),xS)
| ~ aElementOf0(szmzizndt0(xS),xT) ),
inference(resolution,[status(thm)],[c_206,c_3182]) ).
tff(c_3221,plain,
szmzizndt0(xT) = szmzizndt0(xS),
inference(demodulation,[status(thm),theory(equality)],[c_210,c_204,c_256,c_3198]) ).
tff(c_3223,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_216,c_3221]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : NUM539+2 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.14 % 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.13/0.35 % Computer : n012.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 : Thu Aug 3 14:51:07 EDT 2023
% 0.13/0.35 % CPUTime :
% 7.92/2.85 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 7.92/2.86
% 7.92/2.86 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 7.92/2.89
% 7.92/2.89 Inference rules
% 7.92/2.89 ----------------------
% 7.92/2.89 #Ref : 1
% 7.92/2.89 #Sup : 543
% 7.92/2.89 #Fact : 0
% 7.92/2.89 #Define : 0
% 7.92/2.89 #Split : 26
% 7.92/2.89 #Chain : 0
% 7.92/2.89 #Close : 0
% 7.92/2.89
% 7.92/2.89 Ordering : KBO
% 7.92/2.89
% 7.92/2.89 Simplification rules
% 7.92/2.89 ----------------------
% 7.92/2.89 #Subsume : 125
% 7.92/2.89 #Demod : 495
% 7.92/2.89 #Tautology : 162
% 7.92/2.89 #SimpNegUnit : 30
% 7.92/2.89 #BackRed : 54
% 7.92/2.89
% 7.92/2.89 #Partial instantiations: 0
% 7.92/2.89 #Strategies tried : 1
% 7.92/2.89
% 7.92/2.89 Timing (in seconds)
% 7.92/2.89 ----------------------
% 7.92/2.89 Preprocessing : 0.73
% 7.92/2.89 Parsing : 0.36
% 7.92/2.89 CNF conversion : 0.06
% 7.92/2.89 Main loop : 1.10
% 7.92/2.89 Inferencing : 0.37
% 7.92/2.89 Reduction : 0.35
% 7.92/2.89 Demodulation : 0.23
% 7.92/2.89 BG Simplification : 0.06
% 7.92/2.89 Subsumption : 0.24
% 7.92/2.89 Abstraction : 0.04
% 7.92/2.89 MUC search : 0.00
% 7.92/2.89 Cooper : 0.00
% 7.92/2.89 Total : 1.88
% 7.92/2.90 Index Insertion : 0.00
% 7.92/2.90 Index Deletion : 0.00
% 7.92/2.90 Index Matching : 0.00
% 7.92/2.90 BG Taut test : 0.00
%------------------------------------------------------------------------------