TSTP Solution File: NUM540+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : NUM540+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/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 : n001.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 6.38s 2.59s
% Output : CNFRefutation 6.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 35
% Syntax : Number of formulae : 55 ( 11 unt; 30 typ; 2 def)
% Number of atoms : 52 ( 9 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 55 ( 28 ~; 19 |; 3 &)
% ( 3 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 47 ( 27 >; 20 *; 0 +; 0 <<)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 22 ( 22 usr; 3 con; 0-3 aty)
% Number of variables : 16 (; 15 !; 1 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ sdtlseqdt0 > iLess0 > aSubsetOf0 > aElementOf0 > isFinite0 > isCountable0 > aSet0 > aElement0 > sdtpldt0 > sdtmndt0 > #nlpp > szszuzczcdt0 > szmzizndt0 > szmzazxdt0 > slbdtrb0 > sbrdtbr0 > szNzAzT0 > sz00 > slcrc0 > #skF_7 > #skF_11 > #skF_6 > #skF_1 > #skF_4 > #skF_12 > #skF_5 > #skF_10 > #skF_8 > #skF_3 > #skF_2 > #skF_9
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_7',type,
'#skF_7': $i > $i ).
tff('#skF_11',type,
'#skF_11': ( $i * $i ) > $i ).
tff(sbrdtbr0,type,
sbrdtbr0: $i > $i ).
tff(aSet0,type,
aSet0: $i > $o ).
tff(szszuzczcdt0,type,
szszuzczcdt0: $i > $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(sz00,type,
sz00: $i ).
tff('#skF_4',type,
'#skF_4': ( $i * $i * $i ) > $i ).
tff('#skF_12',type,
'#skF_12': ( $i * $i ) > $i ).
tff(sdtpldt0,type,
sdtpldt0: ( $i * $i ) > $i ).
tff(aSubsetOf0,type,
aSubsetOf0: ( $i * $i ) > $o ).
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(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(slbdtrb0,type,
slbdtrb0: $i > $i ).
tff(f_441,negated_conjecture,
slbdtrb0(sz00) != slcrc0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
tff(f_212,axiom,
aElementOf0(sz00,szNzAzT0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mZeroNum) ).
tff(f_435,definition,
! [W0] :
( aElementOf0(W0,szNzAzT0)
=> ! [W1] :
( ( W1 = slbdtrb0(W0) )
<=> ( aSet0(W1)
& ! [W2] :
( aElementOf0(W2,W1)
<=> ( aElementOf0(W2,szNzAzT0)
& sdtlseqdt0(szszuzczcdt0(W2),W0) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefSeg) ).
tff(f_52,definition,
! [W0] :
( ( W0 = slcrc0 )
<=> ( aSet0(W0)
& ~ ? [W1] : aElementOf0(W1,W0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefEmp) ).
tff(f_257,axiom,
! [W0] :
( aElementOf0(W0,szNzAzT0)
=> ~ sdtlseqdt0(szszuzczcdt0(W0),sz00) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mNoScLessZr) ).
tff(c_208,plain,
slbdtrb0(sz00) != slcrc0,
inference(cnfTransformation,[status(thm)],[f_441]) ).
tff(c_110,plain,
aElementOf0(sz00,szNzAzT0),
inference(cnfTransformation,[status(thm)],[f_212]) ).
tff(c_188,plain,
! [W0_133] :
( aSet0(slbdtrb0(W0_133))
| ~ aElementOf0(W0_133,szNzAzT0) ),
inference(cnfTransformation,[status(thm)],[f_435]) ).
tff(c_10,plain,
! [W0_7] :
( ( slcrc0 = W0_7 )
| aElementOf0('#skF_1'(W0_7),W0_7)
| ~ aSet0(W0_7) ),
inference(cnfTransformation,[status(thm)],[f_52]) ).
tff(c_591,plain,
! [W2_207,W0_208] :
( sdtlseqdt0(szszuzczcdt0(W2_207),W0_208)
| ~ aElementOf0(W2_207,slbdtrb0(W0_208))
| ~ aElementOf0(W0_208,szNzAzT0) ),
inference(cnfTransformation,[status(thm)],[f_435]) ).
tff(c_128,plain,
! [W0_81] :
( ~ sdtlseqdt0(szszuzczcdt0(W0_81),sz00)
| ~ aElementOf0(W0_81,szNzAzT0) ),
inference(cnfTransformation,[status(thm)],[f_257]) ).
tff(c_595,plain,
! [W2_207] :
( ~ aElementOf0(W2_207,szNzAzT0)
| ~ aElementOf0(W2_207,slbdtrb0(sz00))
| ~ aElementOf0(sz00,szNzAzT0) ),
inference(resolution,[status(thm)],[c_591,c_128]) ).
tff(c_627,plain,
! [W2_212] :
( ~ aElementOf0(W2_212,szNzAzT0)
| ~ aElementOf0(W2_212,slbdtrb0(sz00)) ),
inference(demodulation,[status(thm),theory(equality)],[c_110,c_595]) ).
tff(c_639,plain,
( ~ aElementOf0('#skF_1'(slbdtrb0(sz00)),szNzAzT0)
| ( slbdtrb0(sz00) = slcrc0 )
| ~ aSet0(slbdtrb0(sz00)) ),
inference(resolution,[status(thm)],[c_10,c_627]) ).
tff(c_648,plain,
( ~ aElementOf0('#skF_1'(slbdtrb0(sz00)),szNzAzT0)
| ~ aSet0(slbdtrb0(sz00)) ),
inference(negUnitSimplification,[status(thm)],[c_208,c_639]) ).
tff(c_663,plain,
~ aSet0(slbdtrb0(sz00)),
inference(splitLeft,[status(thm)],[c_648]) ).
tff(c_667,plain,
~ aElementOf0(sz00,szNzAzT0),
inference(resolution,[status(thm)],[c_188,c_663]) ).
tff(c_671,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_110,c_667]) ).
tff(c_673,plain,
aSet0(slbdtrb0(sz00)),
inference(splitRight,[status(thm)],[c_648]) ).
tff(c_490,plain,
! [W2_191,W0_192] :
( aElementOf0(W2_191,szNzAzT0)
| ~ aElementOf0(W2_191,slbdtrb0(W0_192))
| ~ aElementOf0(W0_192,szNzAzT0) ),
inference(cnfTransformation,[status(thm)],[f_435]) ).
tff(c_2294,plain,
! [W0_313] :
( aElementOf0('#skF_1'(slbdtrb0(W0_313)),szNzAzT0)
| ~ aElementOf0(W0_313,szNzAzT0)
| ( slbdtrb0(W0_313) = slcrc0 )
| ~ aSet0(slbdtrb0(W0_313)) ),
inference(resolution,[status(thm)],[c_10,c_490]) ).
tff(c_672,plain,
~ aElementOf0('#skF_1'(slbdtrb0(sz00)),szNzAzT0),
inference(splitRight,[status(thm)],[c_648]) ).
tff(c_2302,plain,
( ~ aElementOf0(sz00,szNzAzT0)
| ( slbdtrb0(sz00) = slcrc0 )
| ~ aSet0(slbdtrb0(sz00)) ),
inference(resolution,[status(thm)],[c_2294,c_672]) ).
tff(c_2318,plain,
slbdtrb0(sz00) = slcrc0,
inference(demodulation,[status(thm),theory(equality)],[c_673,c_110,c_2302]) ).
tff(c_2320,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_208,c_2318]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : NUM540+1 : TPTP v8.1.2. Released v4.0.0.
% 0.12/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.15/0.35 % Computer : n001.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Thu Aug 3 15:12:40 EDT 2023
% 0.15/0.35 % CPUTime :
% 6.38/2.59 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 6.68/2.60
% 6.68/2.60 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 6.68/2.62
% 6.68/2.62 Inference rules
% 6.68/2.62 ----------------------
% 6.68/2.62 #Ref : 1
% 6.68/2.62 #Sup : 396
% 6.68/2.62 #Fact : 0
% 6.68/2.62 #Define : 0
% 6.68/2.62 #Split : 18
% 6.68/2.62 #Chain : 0
% 6.68/2.62 #Close : 0
% 6.68/2.62
% 6.68/2.62 Ordering : KBO
% 6.68/2.62
% 6.68/2.62 Simplification rules
% 6.68/2.62 ----------------------
% 6.68/2.62 #Subsume : 113
% 6.68/2.62 #Demod : 270
% 6.68/2.62 #Tautology : 92
% 6.68/2.62 #SimpNegUnit : 25
% 6.68/2.62 #BackRed : 44
% 6.68/2.62
% 6.68/2.62 #Partial instantiations: 0
% 6.68/2.62 #Strategies tried : 1
% 6.68/2.62
% 6.68/2.62 Timing (in seconds)
% 6.68/2.62 ----------------------
% 6.68/2.63 Preprocessing : 0.69
% 6.68/2.63 Parsing : 0.35
% 6.68/2.63 CNF conversion : 0.06
% 6.68/2.63 Main loop : 0.76
% 6.68/2.63 Inferencing : 0.27
% 6.68/2.63 Reduction : 0.21
% 6.68/2.63 Demodulation : 0.14
% 6.68/2.63 BG Simplification : 0.05
% 6.68/2.63 Subsumption : 0.19
% 6.68/2.63 Abstraction : 0.03
% 6.68/2.63 MUC search : 0.00
% 6.68/2.63 Cooper : 0.00
% 6.68/2.63 Total : 1.50
% 6.68/2.63 Index Insertion : 0.00
% 6.68/2.63 Index Deletion : 0.00
% 6.68/2.63 Index Matching : 0.00
% 6.68/2.63 BG Taut test : 0.00
%------------------------------------------------------------------------------