TSTP Solution File: NUM561+2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : NUM561+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/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% Computer : n029.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.91s 2.24s
% Output : CNFRefutation 4.91s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 50
% Syntax : Number of formulae : 53 ( 3 unt; 48 typ; 0 def)
% Number of atoms : 8 ( 2 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 6 ( 3 ~; 2 |; 1 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 86 ( 43 >; 43 *; 0 +; 0 <<)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-2 aty)
% Number of functors : 39 ( 39 usr; 5 con; 0-4 aty)
% Number of variables : 2 (; 1 !; 1 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ sdtlseqdt0 > iLess0 > aSubsetOf0 > aElementOf0 > isFinite0 > isCountable0 > aSet0 > aFunction0 > aElement0 > slbdtsldtrb0 > sdtpldt0 > sdtmndt0 > sdtlpdtrp0 > sdtlcdtrc0 > sdtlbdtrb0 > #nlpp > szszuzczcdt0 > szmzizndt0 > szmzazxdt0 > szDzozmdt0 > slbdtrb0 > sbrdtbr0 > xx > xF > szNzAzT0 > sz00 > slcrc0 > #skF_7 > #skF_11 > #skF_17 > #skF_6 > #skF_1 > #skF_18 > #skF_4 > #skF_12 > #skF_5 > #skF_19 > #skF_10 > #skF_8 > #skF_20 > #skF_15 > #skF_13 > #skF_14 > #skF_3 > #skF_2 > #skF_21 > #skF_9 > #skF_22 > #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_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(slbdtsldtrb0,type,
slbdtsldtrb0: ( $i * $i ) > $i ).
tff(xx,type,
xx: $i ).
tff(aSubsetOf0,type,
aSubsetOf0: ( $i * $i ) > $o ).
tff('#skF_5',type,
'#skF_5': ( $i * $i * $i ) > $i ).
tff('#skF_19',type,
'#skF_19': ( $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_20',type,
'#skF_20': ( $i * $i * $i ) > $i ).
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(sdtlcdtrc0,type,
sdtlcdtrc0: ( $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_21',type,
'#skF_21': ( $i * $i * $i ) > $i ).
tff('#skF_9',type,
'#skF_9': ( $i * $i ) > $i ).
tff(slbdtrb0,type,
slbdtrb0: $i > $i ).
tff('#skF_22',type,
'#skF_22': ( $i * $i * $i * $i ) > $i ).
tff(xF,type,
xF: $i ).
tff('#skF_16',type,
'#skF_16': ( $i * $i * $i ) > $i ).
tff(f_608,hypothesis,
aElementOf0(xx,szDzozmdt0(xF)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2911_02) ).
tff(f_615,negated_conjecture,
~ ( ? [W0] :
( aElementOf0(W0,szDzozmdt0(xF))
& ( sdtlpdtrp0(xF,W0) = sdtlpdtrp0(xF,xx) ) )
| aElementOf0(sdtlpdtrp0(xF,xx),sdtlcdtrc0(xF,szDzozmdt0(xF))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
tff(c_310,plain,
aElementOf0(xx,szDzozmdt0(xF)),
inference(cnfTransformation,[status(thm)],[f_608]) ).
tff(c_342,plain,
! [W0_292] :
( ( sdtlpdtrp0(xF,xx) != sdtlpdtrp0(xF,W0_292) )
| ~ aElementOf0(W0_292,szDzozmdt0(xF)) ),
inference(cnfTransformation,[status(thm)],[f_615]) ).
tff(c_347,plain,
$false,
inference(resolution,[status(thm)],[c_310,c_342]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUM561+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/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.13/0.35 % Computer : n029.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 15:17:52 EDT 2023
% 0.13/0.35 % CPUTime :
% 4.91/2.24 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.91/2.24
% 4.91/2.24 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 4.91/2.26
% 4.91/2.26 Inference rules
% 4.91/2.26 ----------------------
% 4.91/2.26 #Ref : 0
% 4.91/2.26 #Sup : 7
% 4.91/2.26 #Fact : 0
% 4.91/2.26 #Define : 0
% 4.91/2.26 #Split : 0
% 4.91/2.26 #Chain : 0
% 4.91/2.26 #Close : 0
% 4.91/2.26
% 4.91/2.26 Ordering : KBO
% 4.91/2.26
% 4.91/2.26 Simplification rules
% 4.91/2.26 ----------------------
% 4.91/2.26 #Subsume : 0
% 4.91/2.26 #Demod : 3
% 4.91/2.26 #Tautology : 11
% 4.91/2.26 #SimpNegUnit : 0
% 4.91/2.26 #BackRed : 0
% 4.91/2.26
% 4.91/2.26 #Partial instantiations: 0
% 4.91/2.26 #Strategies tried : 1
% 4.91/2.26
% 4.91/2.26 Timing (in seconds)
% 4.91/2.26 ----------------------
% 4.91/2.27 Preprocessing : 0.81
% 4.91/2.27 Parsing : 0.40
% 4.91/2.27 CNF conversion : 0.08
% 4.91/2.27 Main loop : 0.31
% 4.91/2.27 Inferencing : 0.05
% 4.91/2.27 Reduction : 0.12
% 4.91/2.27 Demodulation : 0.08
% 4.91/2.27 BG Simplification : 0.06
% 4.91/2.27 Subsumption : 0.10
% 4.91/2.27 Abstraction : 0.02
% 4.91/2.27 MUC search : 0.00
% 4.91/2.27 Cooper : 0.00
% 4.91/2.27 Total : 1.17
% 4.91/2.27 Index Insertion : 0.00
% 4.91/2.27 Index Deletion : 0.00
% 4.91/2.27 Index Matching : 0.00
% 4.91/2.27 BG Taut test : 0.00
%------------------------------------------------------------------------------