TSTP Solution File: NUM568+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : NUM568+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/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 : n024.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:09 EDT 2023
% Result : Theorem 6.59s 2.55s
% Output : CNFRefutation 6.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 61
% Syntax : Number of formulae : 71 ( 6 unt; 57 typ; 0 def)
% Number of atoms : 30 ( 16 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 29 ( 13 ~; 13 |; 2 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 102 ( 50 >; 52 *; 0 +; 0 <<)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-2 aty)
% Number of functors : 48 ( 48 usr; 7 con; 0-4 aty)
% Number of variables : 8 (; 6 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ sdtlseqdt0 > iLess0 > aSubsetOf0 > aElementOf0 > isFinite0 > isCountable0 > aSet0 > aFunction0 > aElement0 > slbdtsldtrb0 > sdtpldt0 > sdtmndt0 > sdtlpdtrp0 > sdtlcdtrc0 > sdtlbdtrb0 > sdtexdt0 > #nlpp > szszuzczcdt0 > szmzizndt0 > szmzazxdt0 > szDzozmdt0 > szDzizrdt0 > slbdtrb0 > sbrdtbr0 > xc > xT > xS > xK > szNzAzT0 > sz00 > slcrc0 > #skF_26 > #skF_7 > #skF_11 > #skF_17 > #skF_6 > #skF_27 > #skF_1 > #skF_18 > #skF_4 > #skF_12 > #skF_23 > #skF_5 > #skF_19 > #skF_10 > #skF_8 > #skF_20 > #skF_24 > #skF_15 > #skF_13 > #skF_14 > #skF_25 > #skF_3 > #skF_2 > #skF_21 > #skF_9 > #skF_22 > #skF_16
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_26',type,
'#skF_26': ( $i * $i * $i ) > $i ).
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('#skF_27',type,
'#skF_27': ( $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(sdtexdt0,type,
sdtexdt0: ( $i * $i ) > $i ).
tff(szNzAzT0,type,
szNzAzT0: $i ).
tff(sdtlseqdt0,type,
sdtlseqdt0: ( $i * $i ) > $o ).
tff(xS,type,
xS: $i ).
tff(sz00,type,
sz00: $i ).
tff(sdtlpdtrp0,type,
sdtlpdtrp0: ( $i * $i ) > $i ).
tff('#skF_4',type,
'#skF_4': ( $i * $i * $i ) > $i ).
tff(xc,type,
xc: $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('#skF_23',type,
'#skF_23': ( $i * $i * $i ) > $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(xT,type,
xT: $i ).
tff(aElementOf0,type,
aElementOf0: ( $i * $i ) > $o ).
tff('#skF_20',type,
'#skF_20': ( $i * $i * $i ) > $i ).
tff(szDzizrdt0,type,
szDzizrdt0: $i > $i ).
tff('#skF_24',type,
'#skF_24': ( $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_25',type,
'#skF_25': ( $i * $i ) > $i ).
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(xK,type,
xK: $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('#skF_16',type,
'#skF_16': ( $i * $i * $i ) > $i ).
tff(f_705,hypothesis,
xK != sz00,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__3520) ).
tff(f_664,hypothesis,
aElementOf0(xK,szNzAzT0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__3418) ).
tff(f_236,axiom,
! [W0] :
( aElementOf0(W0,szNzAzT0)
=> ( ( W0 = sz00 )
| ? [W1] :
( aElementOf0(W1,szNzAzT0)
& ( W0 = szszuzczcdt0(W1) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mNatExtra) ).
tff(f_710,negated_conjecture,
~ ? [W0] :
( aElementOf0(W0,szNzAzT0)
& ( szszuzczcdt0(W0) = xK ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
tff(c_358,plain,
xK != sz00,
inference(cnfTransformation,[status(thm)],[f_705]) ).
tff(c_336,plain,
aElementOf0(xK,szNzAzT0),
inference(cnfTransformation,[status(thm)],[f_664]) ).
tff(c_118,plain,
! [W0_75] :
( ( szszuzczcdt0('#skF_7'(W0_75)) = W0_75 )
| ( sz00 = W0_75 )
| ~ aElementOf0(W0_75,szNzAzT0) ),
inference(cnfTransformation,[status(thm)],[f_236]) ).
tff(c_913,plain,
! [W0_436] :
( aElementOf0('#skF_7'(W0_436),szNzAzT0)
| ( sz00 = W0_436 )
| ~ aElementOf0(W0_436,szNzAzT0) ),
inference(cnfTransformation,[status(thm)],[f_236]) ).
tff(c_360,plain,
! [W0_381] :
( ( szszuzczcdt0(W0_381) != xK )
| ~ aElementOf0(W0_381,szNzAzT0) ),
inference(cnfTransformation,[status(thm)],[f_710]) ).
tff(c_938,plain,
! [W0_440] :
( ( szszuzczcdt0('#skF_7'(W0_440)) != xK )
| ( sz00 = W0_440 )
| ~ aElementOf0(W0_440,szNzAzT0) ),
inference(resolution,[status(thm)],[c_913,c_360]) ).
tff(c_948,plain,
! [W0_443] :
( ( xK != W0_443 )
| ( sz00 = W0_443 )
| ~ aElementOf0(W0_443,szNzAzT0)
| ( sz00 = W0_443 )
| ~ aElementOf0(W0_443,szNzAzT0) ),
inference(superposition,[status(thm),theory(equality)],[c_118,c_938]) ).
tff(c_966,plain,
( ( xK = sz00 )
| ~ aElementOf0(xK,szNzAzT0) ),
inference(resolution,[status(thm)],[c_336,c_948]) ).
tff(c_984,plain,
xK = sz00,
inference(demodulation,[status(thm),theory(equality)],[c_336,c_966]) ).
tff(c_986,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_358,c_984]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : NUM568+1 : TPTP v8.1.2. Released v4.0.0.
% 0.08/0.14 % 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.14/0.36 % Computer : n024.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 14:49:15 EDT 2023
% 0.14/0.36 % CPUTime :
% 6.59/2.55 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.59/2.55
% 6.59/2.55 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 6.59/2.57
% 6.59/2.57 Inference rules
% 6.59/2.57 ----------------------
% 6.59/2.57 #Ref : 0
% 6.59/2.57 #Sup : 115
% 6.59/2.57 #Fact : 0
% 6.59/2.57 #Define : 0
% 6.59/2.57 #Split : 10
% 6.59/2.57 #Chain : 0
% 6.59/2.57 #Close : 0
% 6.59/2.57
% 6.59/2.57 Ordering : KBO
% 6.59/2.57
% 6.59/2.57 Simplification rules
% 6.59/2.57 ----------------------
% 6.59/2.57 #Subsume : 24
% 6.59/2.57 #Demod : 89
% 6.59/2.57 #Tautology : 38
% 6.59/2.57 #SimpNegUnit : 8
% 6.59/2.57 #BackRed : 28
% 6.59/2.57
% 6.59/2.57 #Partial instantiations: 0
% 6.59/2.57 #Strategies tried : 1
% 6.59/2.57
% 6.59/2.57 Timing (in seconds)
% 6.59/2.57 ----------------------
% 6.59/2.58 Preprocessing : 0.83
% 6.59/2.58 Parsing : 0.40
% 6.59/2.58 CNF conversion : 0.08
% 6.59/2.58 Main loop : 0.56
% 6.59/2.58 Inferencing : 0.16
% 6.59/2.58 Reduction : 0.19
% 6.59/2.58 Demodulation : 0.13
% 6.59/2.58 BG Simplification : 0.07
% 6.59/2.58 Subsumption : 0.14
% 6.59/2.58 Abstraction : 0.02
% 6.59/2.58 MUC search : 0.00
% 6.59/2.58 Cooper : 0.00
% 6.59/2.58 Total : 1.43
% 6.59/2.58 Index Insertion : 0.00
% 6.59/2.58 Index Deletion : 0.00
% 6.59/2.58 Index Matching : 0.00
% 6.59/2.58 BG Taut test : 0.00
%------------------------------------------------------------------------------