TSTP Solution File: NUM560+2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : NUM560+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 : n022.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:07 EDT 2023
% Result : Theorem 4.70s 2.24s
% Output : CNFRefutation 4.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 45
% Syntax : Number of formulae : 50 ( 4 unt; 44 typ; 0 def)
% Number of atoms : 13 ( 1 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 10 ( 3 ~; 2 |; 2 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 71 ( 38 >; 33 *; 0 +; 0 <<)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-2 aty)
% Number of functors : 35 ( 35 usr; 6 con; 0-3 aty)
% Number of variables : 3 (; 3 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ sdtlseqdt0 > iLess0 > aSubsetOf0 > aElementOf0 > isFinite0 > isCountable0 > aSet0 > aFunction0 > aElement0 > slbdtsldtrb0 > sdtpldt0 > sdtmndt0 > sdtlpdtrp0 > sdtlbdtrb0 > #nlpp > szszuzczcdt0 > szmzizndt0 > szmzazxdt0 > szDzozmdt0 > slbdtrb0 > sbrdtbr0 > xy > xF > szNzAzT0 > sz00 > slcrc0 > #skF_7 > #skF_11 > #skF_17 > #skF_6 > #skF_1 > #skF_18 > #skF_19 > #skF_4 > #skF_12 > #skF_5 > #skF_10 > #skF_8 > #skF_15 > #skF_13 > #skF_14 > #skF_3 > #skF_2 > #skF_9 > #skF_16
%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('#skF_17',type,
'#skF_17': ( $i * $i * $i ) > $i ).
tff(aSet0,type,
aSet0: $i > $o ).
tff(szszuzczcdt0,type,
szszuzczcdt0: $i > $i ).
tff(sdtlbdtrb0,type,
sdtlbdtrb0: ( $i * $i ) > $i ).
tff(szDzozmdt0,type,
szDzozmdt0: $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('#skF_18',type,
'#skF_18': ( $i * $i * $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(sdtlpdtrp0,type,
sdtlpdtrp0: ( $i * $i ) > $i ).
tff('#skF_19',type,
'#skF_19': $i ).
tff('#skF_4',type,
'#skF_4': ( $i * $i * $i ) > $i ).
tff(xy,type,
xy: $i ).
tff('#skF_12',type,
'#skF_12': ( $i * $i ) > $i ).
tff(sdtpldt0,type,
sdtpldt0: ( $i * $i ) > $i ).
tff(slbdtsldtrb0,type,
slbdtsldtrb0: ( $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('#skF_15',type,
'#skF_15': ( $i * $i * $i ) > $i ).
tff('#skF_13',type,
'#skF_13': $i > $i ).
tff('#skF_14',type,
'#skF_14': ( $i * $i * $i ) > $i ).
tff(slcrc0,type,
slcrc0: $i ).
tff(aFunction0,type,
aFunction0: $i > $o ).
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(xF,type,
xF: $i ).
tff('#skF_16',type,
'#skF_16': ( $i * $i * $i ) > $i ).
tff(f_601,negated_conjecture,
~ ( ( aSet0(sdtlbdtrb0(xF,xy))
& ! [W0] :
( aElementOf0(W0,sdtlbdtrb0(xF,xy))
<=> ( aElementOf0(W0,szDzozmdt0(xF))
& ( sdtlpdtrp0(xF,W0) = xy ) ) ) )
=> ( ! [W0] :
( aElementOf0(W0,sdtlbdtrb0(xF,xy))
=> aElementOf0(W0,szDzozmdt0(xF)) )
| aSubsetOf0(sdtlbdtrb0(xF,xy),szDzozmdt0(xF)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
tff(c_292,plain,
~ aElementOf0('#skF_19',szDzozmdt0(xF)),
inference(cnfTransformation,[status(thm)],[f_601]) ).
tff(c_294,plain,
aElementOf0('#skF_19',sdtlbdtrb0(xF,xy)),
inference(cnfTransformation,[status(thm)],[f_601]) ).
tff(c_446,plain,
! [W0_222] :
( aElementOf0(W0_222,szDzozmdt0(xF))
| ~ aElementOf0(W0_222,sdtlbdtrb0(xF,xy)) ),
inference(cnfTransformation,[status(thm)],[f_601]) ).
tff(c_449,plain,
aElementOf0('#skF_19',szDzozmdt0(xF)),
inference(resolution,[status(thm)],[c_294,c_446]) ).
tff(c_453,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_292,c_449]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUM560+2 : 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 : n022.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 14:29:33 EDT 2023
% 0.14/0.35 % CPUTime :
% 4.70/2.24 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.70/2.24
% 4.70/2.24 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.70/2.27
% 4.70/2.27 Inference rules
% 4.70/2.27 ----------------------
% 4.70/2.27 #Ref : 0
% 4.70/2.27 #Sup : 30
% 4.70/2.27 #Fact : 0
% 4.70/2.27 #Define : 0
% 4.70/2.27 #Split : 1
% 4.70/2.27 #Chain : 0
% 4.70/2.27 #Close : 0
% 4.70/2.27
% 4.70/2.27 Ordering : KBO
% 4.70/2.27
% 4.70/2.27 Simplification rules
% 4.70/2.27 ----------------------
% 4.70/2.27 #Subsume : 2
% 4.70/2.27 #Demod : 15
% 4.70/2.27 #Tautology : 21
% 4.70/2.27 #SimpNegUnit : 1
% 4.70/2.27 #BackRed : 0
% 4.70/2.27
% 4.70/2.27 #Partial instantiations: 0
% 4.70/2.27 #Strategies tried : 1
% 4.70/2.27
% 4.70/2.27 Timing (in seconds)
% 4.70/2.27 ----------------------
% 4.70/2.27 Preprocessing : 0.78
% 4.70/2.27 Parsing : 0.38
% 4.70/2.27 CNF conversion : 0.07
% 4.70/2.27 Main loop : 0.36
% 4.70/2.27 Inferencing : 0.08
% 4.70/2.27 Reduction : 0.13
% 4.70/2.27 Demodulation : 0.09
% 4.70/2.27 BG Simplification : 0.06
% 4.70/2.27 Subsumption : 0.11
% 4.70/2.27 Abstraction : 0.02
% 4.70/2.27 MUC search : 0.00
% 4.70/2.27 Cooper : 0.00
% 4.70/2.27 Total : 1.19
% 4.70/2.27 Index Insertion : 0.00
% 4.70/2.27 Index Deletion : 0.00
% 4.70/2.27 Index Matching : 0.00
% 4.70/2.28 BG Taut test : 0.00
%------------------------------------------------------------------------------