%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : RNG101+1 : TPTP v9.0.0. 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 : n020.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 : Wed Apr 9 08:31:33 PM UTC 2025
% Result : Theorem 8.96s 3.06s
% Output : CNFRefutation 8.96s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of formulae : 13 ( 5 unt; 0 typ; 1 def)
% Number of atoms : 32 ( 7 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 35 ( 16 ~; 11 |; 5 &)
% ( 2 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 13 ( 11 usr; 1 prp; 0-3 aty)
% Number of functors : 36 ( 36 usr; 6 con; 0-4 aty)
% Number of variables : 13 ( 11 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ sdteqdtlpzmzozddtrp0 > aGcdOfAnd0 > misRelativelyPrime0 > iLess0 > doDivides0 > aElementOf0 > aDivisorOf0 > aSet0 > aNaturalNumber0 > aIdeal0 > aElement0 > sdtpldt1 > sdtpldt0 > sdtasdt0 > sdtasasdt0 > #nlpp > smndt0 > slsdtgt0 > sbrdtbr0 > xz > xy > xx > 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('#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('#skF_10',type,
'#skF_10': ( $i * $i * $i ) > $i ).
tff(f_346,hypothesis,
aElement0(xc),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1905) ).
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/sandbox/benchmark/theBenchmark.p',mDefPrIdeal) ).
tff(f_356,negated_conjecture,
~ ? [W0] :
( aElement0(W0)
& ( sdtasdt0(xc,W0) = xx ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
tff(f_351,hypothesis,
( aElementOf0(xx,slsdtgt0(xc))
& aElementOf0(xy,slsdtgt0(xc))
& aElement0(xz) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1933) ).
tff(c_206,plain,
aElement0(xc),
inference(cnfTransformation,[status(thm)],[f_346]) ).
tff(c_5263,plain,
! [W0_333,W2_334] :
( ( sdtasdt0(W0_333,'#skF_23'(W0_333,slsdtgt0(W0_333),W2_334)) = W2_334 )
| ~ aElementOf0(W2_334,slsdtgt0(W0_333))
| ~ aElement0(W0_333) ),
inference(cnfTransformation,[status(thm)],[f_345]) ).
tff(c_3726,plain,
! [W0_313,W2_314] :
( aElement0('#skF_23'(W0_313,slsdtgt0(W0_313),W2_314))
| ~ aElementOf0(W2_314,slsdtgt0(W0_313))
| ~ aElement0(W0_313) ),
inference(cnfTransformation,[status(thm)],[f_345]) ).
tff(c_214,plain,
! [W0_221] :
( ( sdtasdt0(xc,W0_221) != xx )
| ~ aElement0(W0_221) ),
inference(cnfTransformation,[status(thm)],[f_356]) ).
tff(c_3780,plain,
! [W0_313,W2_314] :
( ( sdtasdt0(xc,'#skF_23'(W0_313,slsdtgt0(W0_313),W2_314)) != xx )
| ~ aElementOf0(W2_314,slsdtgt0(W0_313))
| ~ aElement0(W0_313) ),
inference(resolution,[status(thm)],[c_3726,c_214]) ).
tff(c_5270,plain,
! [W2_334] :
( ( xx != W2_334 )
| ~ aElementOf0(W2_334,slsdtgt0(xc))
| ~ aElement0(xc)
| ~ aElementOf0(W2_334,slsdtgt0(xc))
| ~ aElement0(xc) ),
inference(superposition,[status(thm),theory(equality)],[c_5263,c_3780]) ).
tff(c_5388,plain,
~ aElementOf0(xx,slsdtgt0(xc)),
inference(demodulation,[status(thm),theory(equality)],[c_206,c_206,c_5270]) ).
tff(c_212,plain,
aElementOf0(xx,slsdtgt0(xc)),
inference(cnfTransformation,[status(thm)],[f_351]) ).
tff(c_5390,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_5388,c_212]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : RNG101+1 : TPTP v9.0.0. Released v4.0.0.
% 0.07/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 : n020.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 : Tue Apr 8 18:49:49 EDT 2025
% 0.13/0.34 % CPUTime :
% 8.96/3.06 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 8.96/3.07
% 8.96/3.07 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------