TSTP Solution File: RNG109+4 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : RNG109+4 : 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 : n009.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:54:59 EDT 2023
% Result : Theorem 7.09s 2.63s
% Output : CNFRefutation 7.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 65
% Syntax : Number of formulae : 91 ( 18 unt; 60 typ; 0 def)
% Number of atoms : 67 ( 30 equ)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 54 ( 18 ~; 13 |; 18 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 97 ( 48 >; 49 *; 0 +; 0 <<)
% Number of predicates : 13 ( 11 usr; 1 prp; 0-3 aty)
% Number of functors : 49 ( 49 usr; 12 con; 0-4 aty)
% Number of variables : 22 (; 13 !; 9 ?; 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_33 > #skF_35 > #skF_22 > #skF_24 > #skF_6 > #skF_31 > #skF_17 > #skF_25 > #skF_20 > #skF_4 > #skF_8 > #skF_14 > #skF_15 > #skF_29 > #skF_26 > #skF_18 > #skF_23 > #skF_28 > #skF_5 > #skF_19 > #skF_7 > #skF_36 > #skF_32 > #skF_9 > #skF_13 > #skF_11 > #skF_3 > #skF_2 > #skF_27 > #skF_12 > #skF_1 > #skF_16 > #skF_21 > #skF_30 > #skF_10 > #skF_34
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_33',type,
'#skF_33': $i ).
tff('#skF_35',type,
'#skF_35': ( $i * $i ) > $i ).
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('#skF_24',type,
'#skF_24': $i > $i ).
tff(xa,type,
xa: $i ).
tff('#skF_6',type,
'#skF_6': ( $i * $i * $i ) > $i ).
tff(sz10,type,
sz10: $i ).
tff('#skF_31',type,
'#skF_31': $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('#skF_29',type,
'#skF_29': $i > $i ).
tff('#skF_26',type,
'#skF_26': $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('#skF_28',type,
'#skF_28': $i > $i ).
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('#skF_36',type,
'#skF_36': ( $i * $i ) > $i ).
tff('#skF_32',type,
'#skF_32': $i ).
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_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(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_30',type,
'#skF_30': $i > $i ).
tff('#skF_10',type,
'#skF_10': ( $i * $i * $i ) > $i ).
tff('#skF_34',type,
'#skF_34': $i ).
tff(f_357,hypothesis,
( ( xa != sz00 )
| ( xb != sz00 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2110) ).
tff(f_479,hypothesis,
( ? [W0] :
( aElement0(W0)
& ( sdtasdt0(xa,W0) = sz00 ) )
& aElementOf0(sz00,slsdtgt0(xa))
& ? [W0] :
( aElement0(W0)
& ( sdtasdt0(xa,W0) = xa ) )
& aElementOf0(xa,slsdtgt0(xa))
& ? [W0] :
( aElement0(W0)
& ( sdtasdt0(xb,W0) = sz00 ) )
& aElementOf0(sz00,slsdtgt0(xb))
& ? [W0] :
( aElement0(W0)
& ( sdtasdt0(xb,W0) = xb ) )
& aElementOf0(xb,slsdtgt0(xb)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2203) ).
tff(f_508,negated_conjecture,
~ ? [W0] :
( ( ! [W1] :
( aElementOf0(W1,slsdtgt0(xa))
<=> ? [W2] :
( aElement0(W2)
& ( sdtasdt0(xa,W2) = W1 ) ) )
=> ( ! [W1] :
( aElementOf0(W1,slsdtgt0(xb))
<=> ? [W2] :
( aElement0(W2)
& ( sdtasdt0(xb,W2) = W1 ) ) )
=> ( ? [W1,W2] :
( aElementOf0(W1,slsdtgt0(xa))
& aElementOf0(W2,slsdtgt0(xb))
& ( sdtpldt0(W1,W2) = W0 ) )
| aElementOf0(W0,sdtpldt1(slsdtgt0(xa),slsdtgt0(xb))) ) ) )
& ( W0 != sz00 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
tff(f_352,hypothesis,
( aElement0(xa)
& aElement0(xb) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2091) ).
tff(f_67,axiom,
! [W0] :
( aElement0(W0)
=> ( ( sdtpldt0(W0,sz00) = W0 )
& ( W0 = sdtpldt0(sz00,W0) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mAddZero) ).
tff(c_212,plain,
( ( xb != sz00 )
| ( xa != sz00 ) ),
inference(cnfTransformation,[status(thm)],[f_357]) ).
tff(c_399,plain,
xa != sz00,
inference(splitLeft,[status(thm)],[c_212]) ).
tff(c_332,plain,
aElementOf0(xa,slsdtgt0(xa)),
inference(cnfTransformation,[status(thm)],[f_479]) ).
tff(c_326,plain,
aElementOf0(sz00,slsdtgt0(xb)),
inference(cnfTransformation,[status(thm)],[f_479]) ).
tff(c_412,plain,
! [W2_282,W1_283] :
( ~ aElementOf0(W2_282,slsdtgt0(xb))
| ~ aElementOf0(W1_283,slsdtgt0(xa))
| ( sdtpldt0(W1_283,W2_282) = sz00 ) ),
inference(cnfTransformation,[status(thm)],[f_508]) ).
tff(c_1158,plain,
! [W1_301] :
( ~ aElementOf0(W1_301,slsdtgt0(xa))
| ( sdtpldt0(W1_301,sz00) = sz00 ) ),
inference(resolution,[status(thm)],[c_326,c_412]) ).
tff(c_1167,plain,
sdtpldt0(xa,sz00) = sz00,
inference(resolution,[status(thm)],[c_332,c_1158]) ).
tff(c_210,plain,
aElement0(xa),
inference(cnfTransformation,[status(thm)],[f_352]) ).
tff(c_716,plain,
! [W0_291] :
( ( sdtpldt0(W0_291,sz00) = W0_291 )
| ~ aElement0(W0_291) ),
inference(cnfTransformation,[status(thm)],[f_67]) ).
tff(c_770,plain,
sdtpldt0(xa,sz00) = xa,
inference(resolution,[status(thm)],[c_210,c_716]) ).
tff(c_1241,plain,
xa = sz00,
inference(demodulation,[status(thm),theory(equality)],[c_1167,c_770]) ).
tff(c_1243,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_399,c_1241]) ).
tff(c_1244,plain,
xb != sz00,
inference(splitRight,[status(thm)],[c_212]) ).
tff(c_1245,plain,
xa = sz00,
inference(splitRight,[status(thm)],[c_212]) ).
tff(c_338,plain,
aElementOf0(sz00,slsdtgt0(xa)),
inference(cnfTransformation,[status(thm)],[f_479]) ).
tff(c_1246,plain,
aElementOf0(sz00,slsdtgt0(sz00)),
inference(demodulation,[status(thm),theory(equality)],[c_1245,c_338]) ).
tff(c_320,plain,
aElementOf0(xb,slsdtgt0(xb)),
inference(cnfTransformation,[status(thm)],[f_479]) ).
tff(c_346,plain,
! [W2_270,W1_269] :
( ~ aElementOf0(W2_270,slsdtgt0(xb))
| ~ aElementOf0(W1_269,slsdtgt0(xa))
| ( sdtpldt0(W1_269,W2_270) = sz00 ) ),
inference(cnfTransformation,[status(thm)],[f_508]) ).
tff(c_1337,plain,
! [W2_311,W1_312] :
( ~ aElementOf0(W2_311,slsdtgt0(xb))
| ~ aElementOf0(W1_312,slsdtgt0(sz00))
| ( sdtpldt0(W1_312,W2_311) = sz00 ) ),
inference(demodulation,[status(thm),theory(equality)],[c_1245,c_346]) ).
tff(c_2116,plain,
! [W1_336] :
( ~ aElementOf0(W1_336,slsdtgt0(sz00))
| ( sdtpldt0(W1_336,xb) = sz00 ) ),
inference(resolution,[status(thm)],[c_320,c_1337]) ).
tff(c_2120,plain,
sdtpldt0(sz00,xb) = sz00,
inference(resolution,[status(thm)],[c_1246,c_2116]) ).
tff(c_208,plain,
aElement0(xb),
inference(cnfTransformation,[status(thm)],[f_352]) ).
tff(c_1291,plain,
! [W0_310] :
( ( sdtpldt0(sz00,W0_310) = W0_310 )
| ~ aElement0(W0_310) ),
inference(cnfTransformation,[status(thm)],[f_67]) ).
tff(c_1332,plain,
sdtpldt0(sz00,xb) = xb,
inference(resolution,[status(thm)],[c_208,c_1291]) ).
tff(c_2121,plain,
xb = sz00,
inference(demodulation,[status(thm),theory(equality)],[c_2120,c_1332]) ).
tff(c_2123,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_1244,c_2121]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : RNG109+4 : 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.13/0.34 % Computer : n009.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Thu Aug 3 17:57:38 EDT 2023
% 0.13/0.34 % CPUTime :
% 7.09/2.63 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 7.09/2.63
% 7.09/2.63 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 7.21/2.66
% 7.21/2.66 Inference rules
% 7.21/2.66 ----------------------
% 7.21/2.66 #Ref : 0
% 7.21/2.66 #Sup : 557
% 7.21/2.66 #Fact : 0
% 7.21/2.66 #Define : 0
% 7.21/2.66 #Split : 1
% 7.21/2.66 #Chain : 0
% 7.21/2.66 #Close : 0
% 7.21/2.66
% 7.21/2.66 Ordering : KBO
% 7.21/2.66
% 7.21/2.66 Simplification rules
% 7.21/2.66 ----------------------
% 7.21/2.66 #Subsume : 6
% 7.21/2.66 #Demod : 93
% 7.21/2.66 #Tautology : 353
% 7.21/2.66 #SimpNegUnit : 2
% 7.21/2.66 #BackRed : 38
% 7.21/2.66
% 7.21/2.66 #Partial instantiations: 0
% 7.21/2.66 #Strategies tried : 1
% 7.21/2.66
% 7.21/2.66 Timing (in seconds)
% 7.21/2.66 ----------------------
% 7.21/2.67 Preprocessing : 0.78
% 7.21/2.67 Parsing : 0.37
% 7.21/2.67 CNF conversion : 0.08
% 7.21/2.67 Main loop : 0.83
% 7.21/2.67 Inferencing : 0.26
% 7.21/2.67 Reduction : 0.27
% 7.21/2.67 Demodulation : 0.19
% 7.21/2.67 BG Simplification : 0.07
% 7.21/2.67 Subsumption : 0.18
% 7.21/2.67 Abstraction : 0.03
% 7.21/2.67 MUC search : 0.00
% 7.21/2.67 Cooper : 0.00
% 7.21/2.67 Total : 1.66
% 7.21/2.67 Index Insertion : 0.00
% 7.21/2.67 Index Deletion : 0.00
% 7.21/2.67 Index Matching : 0.00
% 7.21/2.67 BG Taut test : 0.00
%------------------------------------------------------------------------------