TSTP Solution File: NUM540+2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : NUM540+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 : n002.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 3.59s 1.79s
% Output : CNFRefutation 3.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 32
% Syntax : Number of formulae : 35 ( 3 unt; 31 typ; 0 def)
% Number of atoms : 7 ( 1 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 7 ( 4 ~; 1 |; 1 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 2 ( 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 : 23 ( 23 usr; 4 con; 0-3 aty)
% Number of variables : 3 (; 2 !; 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_13 > #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_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(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_451,negated_conjecture,
~ ( ( aSet0(slbdtrb0(sz00))
& ! [W0] : ~ aElementOf0(W0,slbdtrb0(sz00)) )
=> ( ~ ? [W0] : aElementOf0(W0,slbdtrb0(sz00))
| ( slbdtrb0(sz00) = slcrc0 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
tff(c_212,plain,
! [W0_144] : ~ aElementOf0(W0_144,slbdtrb0(sz00)),
inference(cnfTransformation,[status(thm)],[f_451]) ).
tff(c_210,plain,
aElementOf0('#skF_13',slbdtrb0(sz00)),
inference(cnfTransformation,[status(thm)],[f_451]) ).
tff(c_215,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_212,c_210]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : NUM540+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.14/0.36 % Computer : n002.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Thu Aug 3 15:31:31 EDT 2023
% 0.14/0.36 % CPUTime :
% 3.59/1.79 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.59/1.80
% 3.59/1.80 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.59/1.82
% 3.59/1.82 Inference rules
% 3.59/1.82 ----------------------
% 3.59/1.82 #Ref : 0
% 3.59/1.82 #Sup : 0
% 3.59/1.82 #Fact : 0
% 3.59/1.82 #Define : 0
% 3.59/1.82 #Split : 0
% 3.59/1.82 #Chain : 0
% 3.59/1.82 #Close : 0
% 3.59/1.82
% 3.59/1.82 Ordering : KBO
% 3.59/1.82
% 3.59/1.82 Simplification rules
% 3.59/1.82 ----------------------
% 3.59/1.82 #Subsume : 100
% 3.59/1.82 #Demod : 0
% 3.59/1.82 #Tautology : 6
% 3.59/1.82 #SimpNegUnit : 1
% 3.59/1.82 #BackRed : 0
% 3.59/1.82
% 3.59/1.82 #Partial instantiations: 0
% 3.59/1.82 #Strategies tried : 1
% 3.59/1.82
% 3.59/1.82 Timing (in seconds)
% 3.59/1.82 ----------------------
% 3.80/1.82 Preprocessing : 0.71
% 3.80/1.82 Parsing : 0.34
% 3.80/1.82 CNF conversion : 0.07
% 3.80/1.82 Main loop : 0.06
% 3.80/1.82 Inferencing : 0.00
% 3.80/1.82 Reduction : 0.02
% 3.80/1.82 Demodulation : 0.02
% 3.80/1.82 BG Simplification : 0.05
% 3.80/1.82 Subsumption : 0.03
% 3.80/1.82 Abstraction : 0.02
% 3.80/1.82 MUC search : 0.00
% 3.80/1.82 Cooper : 0.00
% 3.80/1.82 Total : 0.81
% 3.80/1.82 Index Insertion : 0.00
% 3.80/1.82 Index Deletion : 0.00
% 3.80/1.82 Index Matching : 0.00
% 3.80/1.82 BG Taut test : 0.00
%------------------------------------------------------------------------------