TSTP Solution File: RNG104+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : RNG104+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:54:58 EDT 2023
% Result : Theorem 15.58s 5.87s
% Output : CNFRefutation 15.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 57
% Syntax : Number of formulae : 82 ( 18 unt; 49 typ; 1 def)
% Number of atoms : 63 ( 15 equ)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 51 ( 21 ~; 15 |; 8 &)
% ( 2 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 88 ( 41 >; 47 *; 0 +; 0 <<)
% Number of predicates : 13 ( 11 usr; 1 prp; 0-3 aty)
% Number of functors : 38 ( 38 usr; 8 con; 0-4 aty)
% Number of variables : 22 (; 21 !; 1 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ sdteqdtlpzmzozddtrp0 > aGcdOfAnd0 > misRelativelyPrime0 > iLess0 > doDivides0 > aElementOf0 > aDivisorOf0 > aSet0 > aNaturalNumber0 > aIdeal0 > aElement0 > sdtpldt1 > sdtpldt0 > sdtasdt0 > sdtasasdt0 > #nlpp > smndt0 > slsdtgt0 > sbrdtbr0 > xz > xy > xx > xv > xu > xc > sz10 > sz00 > #skF_22 > #skF_6 > #skF_17 > #skF_20 > #skF_4 > #skF_8 > #skF_14 > #skF_15 > #skF_18 > #skF_23 > #skF_5 > #skF_19 > #skF_7 > #skF_9 > #skF_13 > #skF_11 > #skF_3 > #skF_2 > #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('#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_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(xu,type,
xu: $i ).
tff('#skF_4',type,
'#skF_4': ( $i * $i * $i ) > $i ).
tff(aIdeal0,type,
aIdeal0: $i > $o ).
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(xy,type,
xy: $i ).
tff(sdtpldt0,type,
sdtpldt0: ( $i * $i ) > $i ).
tff('#skF_18',type,
'#skF_18': ( $i * $i ) > $i ).
tff(xx,type,
xx: $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(xz,type,
xz: $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_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(xv,type,
xv: $i ).
tff('#skF_10',type,
'#skF_10': ( $i * $i * $i ) > $i ).
tff(f_351,hypothesis,
( aElementOf0(xx,slsdtgt0(xc))
& aElementOf0(xy,slsdtgt0(xc))
& aElement0(xz) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1933) ).
tff(f_346,hypothesis,
aElement0(xc),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1905) ).
tff(f_354,hypothesis,
( aElement0(xu)
& ( sdtasdt0(xc,xu) = xx ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1956) ).
tff(f_87,axiom,
! [W0,W1,W2] :
( ( aElement0(W0)
& aElement0(W1)
& aElement0(W2) )
=> ( sdtasdt0(sdtasdt0(W0,W1),W2) = sdtasdt0(W0,sdtasdt0(W1,W2)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mMulAsso) ).
tff(f_345,definition,
! [W0] :
( aElement0(W0)
=> ! [W1] :
( ( W1 = slsdtgt0(W0) )
<=> ( aSet0(W1)
& ! [W2] :
( aElementOf0(W2,W1)
<=> ? [W3] :
( aElement0(W3)
& ( sdtasdt0(W0,W3) = W2 ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefPrIdeal) ).
tff(f_137,axiom,
! [W0] :
( aSet0(W0)
=> ! [W1] :
( aElementOf0(W1,W0)
=> aElement0(W1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mEOfElem) ).
tff(f_79,axiom,
! [W0,W1] :
( ( aElement0(W0)
& aElement0(W1) )
=> ( sdtasdt0(W0,W1) = sdtasdt0(W1,W0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mMulComm) ).
tff(f_360,negated_conjecture,
sdtasdt0(xz,xx) != sdtasdt0(xc,sdtasdt0(xu,xz)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
tff(c_208,plain,
aElement0(xz),
inference(cnfTransformation,[status(thm)],[f_351]) ).
tff(c_206,plain,
aElement0(xc),
inference(cnfTransformation,[status(thm)],[f_346]) ).
tff(c_216,plain,
aElement0(xu),
inference(cnfTransformation,[status(thm)],[f_354]) ).
tff(c_214,plain,
sdtasdt0(xc,xu) = xx,
inference(cnfTransformation,[status(thm)],[f_354]) ).
tff(c_3631,plain,
! [W0_316,W1_317,W2_318] :
( ( sdtasdt0(sdtasdt0(W0_316,W1_317),W2_318) = sdtasdt0(W0_316,sdtasdt0(W1_317,W2_318)) )
| ~ aElement0(W2_318)
| ~ aElement0(W1_317)
| ~ aElement0(W0_316) ),
inference(cnfTransformation,[status(thm)],[f_87]) ).
tff(c_3846,plain,
! [W2_318] :
( ( sdtasdt0(xc,sdtasdt0(xu,W2_318)) = sdtasdt0(xx,W2_318) )
| ~ aElement0(W2_318)
| ~ aElement0(xu)
| ~ aElement0(xc) ),
inference(superposition,[status(thm),theory(equality)],[c_214,c_3631]) ).
tff(c_16337,plain,
! [W2_480] :
( ( sdtasdt0(xc,sdtasdt0(xu,W2_480)) = sdtasdt0(xx,W2_480) )
| ~ aElement0(W2_480) ),
inference(demodulation,[status(thm),theory(equality)],[c_206,c_216,c_3846]) ).
tff(c_188,plain,
! [W0_181] :
( aSet0(slsdtgt0(W0_181))
| ~ aElement0(W0_181) ),
inference(cnfTransformation,[status(thm)],[f_345]) ).
tff(c_210,plain,
aElementOf0(xy,slsdtgt0(xc)),
inference(cnfTransformation,[status(thm)],[f_351]) ).
tff(c_540,plain,
! [W1_233,W0_234] :
( aElement0(W1_233)
| ~ aElementOf0(W1_233,W0_234)
| ~ aSet0(W0_234) ),
inference(cnfTransformation,[status(thm)],[f_137]) ).
tff(c_547,plain,
( aElement0(xy)
| ~ aSet0(slsdtgt0(xc)) ),
inference(resolution,[status(thm)],[c_210,c_540]) ).
tff(c_550,plain,
~ aSet0(slsdtgt0(xc)),
inference(splitLeft,[status(thm)],[c_547]) ).
tff(c_553,plain,
~ aElement0(xc),
inference(resolution,[status(thm)],[c_188,c_550]) ).
tff(c_560,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_206,c_553]) ).
tff(c_562,plain,
aSet0(slsdtgt0(xc)),
inference(splitRight,[status(thm)],[c_547]) ).
tff(c_212,plain,
aElementOf0(xx,slsdtgt0(xc)),
inference(cnfTransformation,[status(thm)],[f_351]) ).
tff(c_548,plain,
( aElement0(xx)
| ~ aSet0(slsdtgt0(xc)) ),
inference(resolution,[status(thm)],[c_212,c_540]) ).
tff(c_631,plain,
aElement0(xx),
inference(demodulation,[status(thm),theory(equality)],[c_562,c_548]) ).
tff(c_1492,plain,
! [W1_268,W0_269] :
( ( sdtasdt0(W1_268,W0_269) = sdtasdt0(W0_269,W1_268) )
| ~ aElement0(W1_268)
| ~ aElement0(W0_269) ),
inference(cnfTransformation,[status(thm)],[f_79]) ).
tff(c_8409,plain,
! [W0_405] :
( ( sdtasdt0(xz,W0_405) = sdtasdt0(W0_405,xz) )
| ~ aElement0(W0_405) ),
inference(resolution,[status(thm)],[c_208,c_1492]) ).
tff(c_8537,plain,
sdtasdt0(xz,xx) = sdtasdt0(xx,xz),
inference(resolution,[status(thm)],[c_631,c_8409]) ).
tff(c_224,plain,
sdtasdt0(xc,sdtasdt0(xu,xz)) != sdtasdt0(xz,xx),
inference(cnfTransformation,[status(thm)],[f_360]) ).
tff(c_8549,plain,
sdtasdt0(xc,sdtasdt0(xu,xz)) != sdtasdt0(xx,xz),
inference(demodulation,[status(thm),theory(equality)],[c_8537,c_224]) ).
tff(c_16345,plain,
~ aElement0(xz),
inference(superposition,[status(thm),theory(equality)],[c_16337,c_8549]) ).
tff(c_16409,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_208,c_16345]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : RNG104+1 : TPTP v8.1.2. Released v4.0.0.
% 0.07/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 17:59:45 EDT 2023
% 0.14/0.36 % CPUTime :
% 15.58/5.87 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 15.58/5.87
% 15.58/5.87 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 15.74/5.90
% 15.74/5.90 Inference rules
% 15.74/5.90 ----------------------
% 15.74/5.90 #Ref : 0
% 15.74/5.90 #Sup : 3802
% 15.74/5.90 #Fact : 0
% 15.74/5.90 #Define : 0
% 15.74/5.90 #Split : 13
% 15.74/5.90 #Chain : 0
% 15.74/5.90 #Close : 0
% 15.74/5.90
% 15.74/5.90 Ordering : KBO
% 15.74/5.90
% 15.74/5.90 Simplification rules
% 15.74/5.90 ----------------------
% 15.74/5.90 #Subsume : 33
% 15.74/5.90 #Demod : 4048
% 15.74/5.90 #Tautology : 1036
% 15.74/5.90 #SimpNegUnit : 46
% 15.74/5.90 #BackRed : 1
% 15.74/5.90
% 15.74/5.90 #Partial instantiations: 0
% 15.74/5.90 #Strategies tried : 1
% 15.74/5.90
% 15.74/5.90 Timing (in seconds)
% 15.74/5.90 ----------------------
% 15.74/5.90 Preprocessing : 0.67
% 15.74/5.90 Parsing : 0.33
% 15.74/5.90 CNF conversion : 0.06
% 15.74/5.90 Main loop : 4.08
% 15.74/5.90 Inferencing : 0.96
% 15.74/5.90 Reduction : 2.06
% 15.74/5.90 Demodulation : 1.75
% 15.74/5.90 BG Simplification : 0.09
% 15.74/5.90 Subsumption : 0.77
% 15.74/5.90 Abstraction : 0.10
% 15.74/5.90 MUC search : 0.00
% 15.74/5.90 Cooper : 0.00
% 15.74/5.90 Total : 4.81
% 15.74/5.90 Index Insertion : 0.00
% 15.74/5.90 Index Deletion : 0.00
% 15.74/5.91 Index Matching : 0.00
% 15.74/5.91 BG Taut test : 0.00
%------------------------------------------------------------------------------