TSTP Solution File: RNG111+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : RNG111+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 : n012.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:55:00 EDT 2023
% Result : Theorem 5.87s 2.49s
% Output : CNFRefutation 5.87s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 52
% Syntax : Number of formulae : 85 ( 13 unt; 51 typ; 0 def)
% Number of atoms : 104 ( 51 equ)
% Maximal formula atoms : 15 ( 3 avg)
% Number of connectives : 124 ( 54 ~; 56 |; 8 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 90 ( 43 >; 47 *; 0 +; 0 <<)
% Number of predicates : 13 ( 11 usr; 1 prp; 0-3 aty)
% Number of functors : 40 ( 40 usr; 8 con; 0-4 aty)
% Number of variables : 15 (; 13 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ sdteqdtlpzmzozddtrp0 > aGcdOfAnd0 > misRelativelyPrime0 > iLess0 > doDivides0 > aElementOf0 > aDivisorOf0 > aSet0 > aNaturalNumber0 > aIdeal0 > aElement0 > sdtpldt1 > sdtpldt0 > sdtasdt0 > sdtasasdt0 > #nlpp > smndt0 > slsdtgt0 > sbrdtbr0 > xc > xb > xa > xI > sz10 > sz00 > #skF_22 > #skF_6 > #skF_17 > #skF_25 > #skF_20 > #skF_4 > #skF_8 > #skF_14 > #skF_15 > #skF_18 > #skF_23 > #skF_5 > #skF_19 > #skF_7 > #skF_9 > #skF_26 > #skF_13 > #skF_11 > #skF_3 > #skF_2 > #skF_24 > #skF_27 > #skF_12 > #skF_1 > #skF_16 > #skF_21 > #skF_10
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_22',type,
'#skF_22': ( $i * $i ) > $i ).
tff(sbrdtbr0,type,
sbrdtbr0: $i > $i ).
tff(sdtasdt0,type,
sdtasdt0: ( $i * $i ) > $i ).
tff(aSet0,type,
aSet0: $i > $o ).
tff(xa,type,
xa: $i ).
tff('#skF_6',type,
'#skF_6': ( $i * $i * $i ) > $i ).
tff(sz10,type,
sz10: $i ).
tff(sdtpldt1,type,
sdtpldt1: ( $i * $i ) > $i ).
tff('#skF_17',type,
'#skF_17': ( $i * $i ) > $i ).
tff('#skF_25',type,
'#skF_25': $i ).
tff('#skF_20',type,
'#skF_20': ( $i * $i ) > $i ).
tff(aElement0,type,
aElement0: $i > $o ).
tff(sz00,type,
sz00: $i ).
tff(misRelativelyPrime0,type,
misRelativelyPrime0: ( $i * $i ) > $o ).
tff('#skF_4',type,
'#skF_4': ( $i * $i * $i ) > $i ).
tff(aIdeal0,type,
aIdeal0: $i > $o ).
tff(xI,type,
xI: $i ).
tff(xc,type,
xc: $i ).
tff('#skF_8',type,
'#skF_8': ( $i * $i * $i * $i ) > $i ).
tff('#skF_14',type,
'#skF_14': ( $i * $i ) > $i ).
tff('#skF_15',type,
'#skF_15': ( $i * $i * $i * $i ) > $i ).
tff(sdtpldt0,type,
sdtpldt0: ( $i * $i ) > $i ).
tff('#skF_18',type,
'#skF_18': ( $i * $i ) > $i ).
tff('#skF_23',type,
'#skF_23': ( $i * $i * $i ) > $i ).
tff(aNaturalNumber0,type,
aNaturalNumber0: $i > $o ).
tff(slsdtgt0,type,
slsdtgt0: $i > $i ).
tff(smndt0,type,
smndt0: $i > $i ).
tff('#skF_5',type,
'#skF_5': ( $i * $i * $i ) > $i ).
tff('#skF_19',type,
'#skF_19': ( $i * $i * $i ) > $i ).
tff('#skF_7',type,
'#skF_7': ( $i * $i * $i * $i ) > $i ).
tff(doDivides0,type,
doDivides0: ( $i * $i ) > $o ).
tff(aGcdOfAnd0,type,
aGcdOfAnd0: ( $i * $i * $i ) > $o ).
tff(aElementOf0,type,
aElementOf0: ( $i * $i ) > $o ).
tff(xb,type,
xb: $i ).
tff('#skF_9',type,
'#skF_9': ( $i * $i * $i ) > $i ).
tff('#skF_26',type,
'#skF_26': $i > $i ).
tff('#skF_13',type,
'#skF_13': $i > $i ).
tff('#skF_11',type,
'#skF_11': $i > $i ).
tff('#skF_3',type,
'#skF_3': ( $i * $i * $i ) > $i ).
tff(aDivisorOf0,type,
aDivisorOf0: ( $i * $i ) > $o ).
tff('#skF_2',type,
'#skF_2': ( $i * $i ) > $i ).
tff('#skF_24',type,
'#skF_24': $i ).
tff(sdtasasdt0,type,
sdtasasdt0: ( $i * $i ) > $i ).
tff(iLess0,type,
iLess0: ( $i * $i ) > $o ).
tff('#skF_27',type,
'#skF_27': $i > $i ).
tff('#skF_12',type,
'#skF_12': $i > $i ).
tff(sdteqdtlpzmzozddtrp0,type,
sdteqdtlpzmzozddtrp0: ( $i * $i * $i ) > $o ).
tff('#skF_1',type,
'#skF_1': ( $i * $i ) > $i ).
tff('#skF_16',type,
'#skF_16': ( $i * $i ) > $i ).
tff('#skF_21',type,
'#skF_21': ( $i * $i ) > $i ).
tff('#skF_10',type,
'#skF_10': ( $i * $i * $i ) > $i ).
tff(f_417,negated_conjecture,
~ ! [W0] :
( ( aElementOf0(W0,xI)
& ( W0 != sz00 ) )
=> ( ! [W1] :
( ( aElementOf0(W1,xI)
& ( W1 != sz00 ) )
=> ( iLess0(sbrdtbr0(W1),sbrdtbr0(W0))
=> ? [W2] :
( aElementOf0(W2,xI)
& ( W2 != sz00 )
& ! [W3] :
( ( aElementOf0(W3,xI)
& ( W3 != sz00 ) )
=> ~ iLess0(sbrdtbr0(W3),sbrdtbr0(W2)) ) ) ) )
=> ? [W1] :
( aElementOf0(W1,xI)
& ( W1 != sz00 )
& ! [W2] :
( ( aElementOf0(W2,xI)
& ( W2 != sz00 ) )
=> ~ iLess0(sbrdtbr0(W2),sbrdtbr0(W1)) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
tff(c_232,plain,
sz00 != '#skF_25',
inference(cnfTransformation,[status(thm)],[f_417]) ).
tff(c_234,plain,
aElementOf0('#skF_25',xI),
inference(cnfTransformation,[status(thm)],[f_417]) ).
tff(c_240,plain,
! [W1_238] :
( aElementOf0('#skF_27'(W1_238),xI)
| ( sz00 = W1_238 )
| ~ aElementOf0(W1_238,xI) ),
inference(cnfTransformation,[status(thm)],[f_417]) ).
tff(c_248,plain,
! [W1_240] :
( ( '#skF_27'(W1_240) != sz00 )
| ( sz00 = W1_240 )
| ~ aElementOf0(W1_240,xI) ),
inference(cnfTransformation,[status(thm)],[f_417]) ).
tff(c_251,plain,
( ( '#skF_27'('#skF_25') != sz00 )
| ( sz00 = '#skF_25' ) ),
inference(resolution,[status(thm)],[c_234,c_248]) ).
tff(c_254,plain,
'#skF_27'('#skF_25') != sz00,
inference(negUnitSimplification,[status(thm)],[c_232,c_251]) ).
tff(c_236,plain,
! [W1_238] :
( iLess0(sbrdtbr0('#skF_27'(W1_238)),sbrdtbr0(W1_238))
| ( sz00 = W1_238 )
| ~ aElementOf0(W1_238,xI) ),
inference(cnfTransformation,[status(thm)],[f_417]) ).
tff(c_376,plain,
! [W1_250] :
( ( '#skF_26'(W1_250) != sz00 )
| ~ iLess0(sbrdtbr0(W1_250),sbrdtbr0('#skF_25'))
| ( sz00 = W1_250 )
| ~ aElementOf0(W1_250,xI) ),
inference(cnfTransformation,[status(thm)],[f_417]) ).
tff(c_380,plain,
( ( '#skF_26'('#skF_27'('#skF_25')) != sz00 )
| ( '#skF_27'('#skF_25') = sz00 )
| ~ aElementOf0('#skF_27'('#skF_25'),xI)
| ( sz00 = '#skF_25' )
| ~ aElementOf0('#skF_25',xI) ),
inference(resolution,[status(thm)],[c_236,c_376]) ).
tff(c_383,plain,
( ( '#skF_26'('#skF_27'('#skF_25')) != sz00 )
| ( '#skF_27'('#skF_25') = sz00 )
| ~ aElementOf0('#skF_27'('#skF_25'),xI)
| ( sz00 = '#skF_25' ) ),
inference(demodulation,[status(thm),theory(equality)],[c_234,c_380]) ).
tff(c_384,plain,
( ( '#skF_26'('#skF_27'('#skF_25')) != sz00 )
| ~ aElementOf0('#skF_27'('#skF_25'),xI) ),
inference(negUnitSimplification,[status(thm)],[c_232,c_254,c_383]) ).
tff(c_634,plain,
~ aElementOf0('#skF_27'('#skF_25'),xI),
inference(splitLeft,[status(thm)],[c_384]) ).
tff(c_637,plain,
( ( sz00 = '#skF_25' )
| ~ aElementOf0('#skF_25',xI) ),
inference(resolution,[status(thm)],[c_240,c_634]) ).
tff(c_640,plain,
sz00 = '#skF_25',
inference(demodulation,[status(thm),theory(equality)],[c_234,c_637]) ).
tff(c_642,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_232,c_640]) ).
tff(c_643,plain,
'#skF_26'('#skF_27'('#skF_25')) != sz00,
inference(splitRight,[status(thm)],[c_384]) ).
tff(c_644,plain,
aElementOf0('#skF_27'('#skF_25'),xI),
inference(splitRight,[status(thm)],[c_384]) ).
tff(c_457,plain,
! [W1_253] :
( aElementOf0('#skF_26'(W1_253),xI)
| ~ iLess0(sbrdtbr0(W1_253),sbrdtbr0('#skF_25'))
| ( sz00 = W1_253 )
| ~ aElementOf0(W1_253,xI) ),
inference(cnfTransformation,[status(thm)],[f_417]) ).
tff(c_461,plain,
( aElementOf0('#skF_26'('#skF_27'('#skF_25')),xI)
| ( '#skF_27'('#skF_25') = sz00 )
| ~ aElementOf0('#skF_27'('#skF_25'),xI)
| ( sz00 = '#skF_25' )
| ~ aElementOf0('#skF_25',xI) ),
inference(resolution,[status(thm)],[c_236,c_457]) ).
tff(c_464,plain,
( aElementOf0('#skF_26'('#skF_27'('#skF_25')),xI)
| ( '#skF_27'('#skF_25') = sz00 )
| ~ aElementOf0('#skF_27'('#skF_25'),xI)
| ( sz00 = '#skF_25' ) ),
inference(demodulation,[status(thm),theory(equality)],[c_234,c_461]) ).
tff(c_465,plain,
( aElementOf0('#skF_26'('#skF_27'('#skF_25')),xI)
| ~ aElementOf0('#skF_27'('#skF_25'),xI) ),
inference(negUnitSimplification,[status(thm)],[c_232,c_254,c_464]) ).
tff(c_695,plain,
aElementOf0('#skF_26'('#skF_27'('#skF_25')),xI),
inference(demodulation,[status(thm),theory(equality)],[c_644,c_465]) ).
tff(c_238,plain,
! [W1_238] :
( ( '#skF_27'(W1_238) != sz00 )
| ( sz00 = W1_238 )
| ~ aElementOf0(W1_238,xI) ),
inference(cnfTransformation,[status(thm)],[f_417]) ).
tff(c_701,plain,
( ( '#skF_27'('#skF_26'('#skF_27'('#skF_25'))) != sz00 )
| ( '#skF_26'('#skF_27'('#skF_25')) = sz00 ) ),
inference(resolution,[status(thm)],[c_695,c_238]) ).
tff(c_707,plain,
'#skF_27'('#skF_26'('#skF_27'('#skF_25'))) != sz00,
inference(negUnitSimplification,[status(thm)],[c_643,c_701]) ).
tff(c_569,plain,
! [W3_259,W1_260] :
( ~ iLess0(sbrdtbr0(W3_259),sbrdtbr0('#skF_26'(W1_260)))
| ( sz00 = W3_259 )
| ~ aElementOf0(W3_259,xI)
| ~ iLess0(sbrdtbr0(W1_260),sbrdtbr0('#skF_25'))
| ( sz00 = W1_260 )
| ~ aElementOf0(W1_260,xI) ),
inference(cnfTransformation,[status(thm)],[f_417]) ).
tff(c_1230,plain,
! [W1_282] :
( ( '#skF_27'('#skF_26'(W1_282)) = sz00 )
| ~ aElementOf0('#skF_27'('#skF_26'(W1_282)),xI)
| ~ iLess0(sbrdtbr0(W1_282),sbrdtbr0('#skF_25'))
| ( sz00 = W1_282 )
| ~ aElementOf0(W1_282,xI)
| ( '#skF_26'(W1_282) = sz00 )
| ~ aElementOf0('#skF_26'(W1_282),xI) ),
inference(resolution,[status(thm)],[c_236,c_569]) ).
tff(c_1234,plain,
( ( '#skF_27'('#skF_26'('#skF_27'('#skF_25'))) = sz00 )
| ~ aElementOf0('#skF_27'('#skF_26'('#skF_27'('#skF_25'))),xI)
| ( '#skF_27'('#skF_25') = sz00 )
| ~ aElementOf0('#skF_27'('#skF_25'),xI)
| ( '#skF_26'('#skF_27'('#skF_25')) = sz00 )
| ~ aElementOf0('#skF_26'('#skF_27'('#skF_25')),xI)
| ( sz00 = '#skF_25' )
| ~ aElementOf0('#skF_25',xI) ),
inference(resolution,[status(thm)],[c_236,c_1230]) ).
tff(c_1237,plain,
( ( '#skF_27'('#skF_26'('#skF_27'('#skF_25'))) = sz00 )
| ~ aElementOf0('#skF_27'('#skF_26'('#skF_27'('#skF_25'))),xI)
| ( '#skF_27'('#skF_25') = sz00 )
| ( '#skF_26'('#skF_27'('#skF_25')) = sz00 )
| ( sz00 = '#skF_25' ) ),
inference(demodulation,[status(thm),theory(equality)],[c_234,c_695,c_644,c_1234]) ).
tff(c_1238,plain,
~ aElementOf0('#skF_27'('#skF_26'('#skF_27'('#skF_25'))),xI),
inference(negUnitSimplification,[status(thm)],[c_232,c_643,c_254,c_707,c_1237]) ).
tff(c_1241,plain,
( ( '#skF_26'('#skF_27'('#skF_25')) = sz00 )
| ~ aElementOf0('#skF_26'('#skF_27'('#skF_25')),xI) ),
inference(resolution,[status(thm)],[c_240,c_1238]) ).
tff(c_1244,plain,
'#skF_26'('#skF_27'('#skF_25')) = sz00,
inference(demodulation,[status(thm),theory(equality)],[c_695,c_1241]) ).
tff(c_1246,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_643,c_1244]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : RNG111+1 : 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.13/0.35 % Computer : n012.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 18:00:07 EDT 2023
% 0.20/0.35 % CPUTime :
% 5.87/2.49 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.87/2.50
% 5.87/2.50 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 5.87/2.52
% 5.87/2.52 Inference rules
% 5.87/2.52 ----------------------
% 5.87/2.52 #Ref : 0
% 5.87/2.52 #Sup : 253
% 5.87/2.52 #Fact : 0
% 5.87/2.52 #Define : 0
% 5.87/2.52 #Split : 3
% 5.87/2.52 #Chain : 0
% 5.87/2.52 #Close : 0
% 5.87/2.52
% 5.87/2.52 Ordering : KBO
% 5.87/2.52
% 5.87/2.52 Simplification rules
% 5.87/2.52 ----------------------
% 5.87/2.52 #Subsume : 2
% 5.87/2.52 #Demod : 171
% 5.87/2.52 #Tautology : 163
% 5.87/2.52 #SimpNegUnit : 9
% 5.87/2.52 #BackRed : 0
% 5.87/2.52
% 5.87/2.52 #Partial instantiations: 0
% 5.87/2.52 #Strategies tried : 1
% 5.87/2.52
% 5.87/2.52 Timing (in seconds)
% 5.87/2.52 ----------------------
% 5.87/2.53 Preprocessing : 0.75
% 5.87/2.53 Parsing : 0.38
% 5.87/2.53 CNF conversion : 0.07
% 5.87/2.53 Main loop : 0.56
% 5.87/2.53 Inferencing : 0.17
% 5.87/2.53 Reduction : 0.18
% 5.87/2.53 Demodulation : 0.13
% 5.87/2.53 BG Simplification : 0.05
% 5.87/2.53 Subsumption : 0.12
% 5.87/2.53 Abstraction : 0.02
% 5.87/2.53 MUC search : 0.00
% 5.87/2.53 Cooper : 0.00
% 5.87/2.53 Total : 1.36
% 5.87/2.53 Index Insertion : 0.00
% 5.87/2.53 Index Deletion : 0.00
% 5.87/2.53 Index Matching : 0.00
% 5.87/2.53 BG Taut test : 0.00
%------------------------------------------------------------------------------