%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : RNG116+4 : 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 : n021.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:37 PM UTC 2025
% Result : Theorem 6.02s 2.42s
% Output : CNFRefutation 6.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 2
% Syntax : Number of formulae : 12 ( 6 unt; 0 typ; 0 def)
% Number of atoms : 26 ( 11 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 25 ( 11 ~; 6 |; 8 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 3 ( 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 : 59 ( 59 usr; 22 con; 0-4 aty)
% Number of variables : 8 ( 4 !; 4 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ sdteqdtlpzmzozddtrp0 > aGcdOfAnd0 > misRelativelyPrime0 > iLess0 > doDivides0 > aElementOf0 > aDivisorOf0 > aSet0 > aNaturalNumber0 > aIdeal0 > aElement0 > sdtpldt1 > sdtpldt0 > sdtasdt0 > sdtasasdt0 > #nlpp > smndt0 > slsdtgt0 > sbrdtbr0 > xu > xl > xk > xc > xb > xa > xI > sz10 > sz00 > #skF_33 > #skF_41 > #skF_22 > #skF_24 > #skF_6 > #skF_31 > #skF_17 > #skF_25 > #skF_20 > #skF_36 > #skF_43 > #skF_40 > #skF_4 > #skF_37 > #skF_8 > #skF_14 > #skF_15 > #skF_29 > #skF_26 > #skF_18 > #skF_23 > #skF_28 > #skF_5 > #skF_19 > #skF_38 > #skF_7 > #skF_32 > #skF_39 > #skF_9 > #skF_13 > #skF_42 > #skF_11 > #skF_3 > #skF_2 > #skF_35 > #skF_27 > #skF_12 > #skF_1 > #skF_16 > #skF_21 > #skF_30 > #skF_10 > #skF_34
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(xk,type,
xk: $i ).
tff('#skF_33',type,
'#skF_33': $i ).
tff('#skF_41',type,
'#skF_41': $i ).
tff(xl,type,
xl: $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('#skF_36',type,
'#skF_36': $i ).
tff(sz00,type,
sz00: $i ).
tff('#skF_43',type,
'#skF_43': $i ).
tff(misRelativelyPrime0,type,
misRelativelyPrime0: ( $i * $i ) > $o ).
tff(xu,type,
xu: $i ).
tff('#skF_40',type,
'#skF_40': $i ).
tff('#skF_4',type,
'#skF_4': ( $i * $i * $i ) > $i ).
tff('#skF_37',type,
'#skF_37': $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_38',type,
'#skF_38': $i > $i ).
tff('#skF_7',type,
'#skF_7': ( $i * $i * $i * $i ) > $i ).
tff(doDivides0,type,
doDivides0: ( $i * $i ) > $o ).
tff('#skF_32',type,
'#skF_32': $i ).
tff(aGcdOfAnd0,type,
aGcdOfAnd0: ( $i * $i * $i ) > $o ).
tff(aElementOf0,type,
aElementOf0: ( $i * $i ) > $o ).
tff('#skF_39',type,
'#skF_39': $i > $i ).
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_42',type,
'#skF_42': $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_35',type,
'#skF_35': $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_567,hypothesis,
( ? [W0] :
( aElement0(W0)
& ( sdtasdt0(xa,W0) = xk ) )
& aElementOf0(xk,slsdtgt0(xa))
& ? [W0] :
( aElement0(W0)
& ( sdtasdt0(xb,W0) = xl ) )
& aElementOf0(xl,slsdtgt0(xb))
& ( xu = sdtpldt0(xk,xl) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2456) ).
tff(f_574,negated_conjecture,
~ ? [W0,W1] :
( aElement0(W0)
& aElement0(W1)
& ( xu = sdtpldt0(sdtasdt0(xa,W0),sdtasdt0(xb,W1)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
tff(c_404,plain,
aElement0('#skF_42'),
inference(cnfTransformation,[status(thm)],[f_567]) ).
tff(c_398,plain,
sdtpldt0(xk,xl) = xu,
inference(cnfTransformation,[status(thm)],[f_567]) ).
tff(c_402,plain,
sdtasdt0(xb,'#skF_42') = xl,
inference(cnfTransformation,[status(thm)],[f_567]) ).
tff(c_410,plain,
aElement0('#skF_43'),
inference(cnfTransformation,[status(thm)],[f_567]) ).
tff(c_408,plain,
sdtasdt0(xa,'#skF_43') = xk,
inference(cnfTransformation,[status(thm)],[f_567]) ).
tff(c_412,plain,
! [W0_275,W1_276] :
( ( sdtpldt0(sdtasdt0(xa,W0_275),sdtasdt0(xb,W1_276)) != xu )
| ~ aElement0(W1_276)
| ~ aElement0(W0_275) ),
inference(cnfTransformation,[status(thm)],[f_574]) ).
tff(c_423,plain,
! [W1_276] :
( ( sdtpldt0(xk,sdtasdt0(xb,W1_276)) != xu )
| ~ aElement0(W1_276)
| ~ aElement0('#skF_43') ),
inference(superposition,[status(thm),theory(equality)],[c_408,c_412]) ).
tff(c_427,plain,
! [W1_276] :
( ( sdtpldt0(xk,sdtasdt0(xb,W1_276)) != xu )
| ~ aElement0(W1_276) ),
inference(demodulation,[status(thm),theory(equality)],[c_410,c_423]) ).
tff(c_447,plain,
( ( sdtpldt0(xk,xl) != xu )
| ~ aElement0('#skF_42') ),
inference(superposition,[status(thm),theory(equality)],[c_402,c_427]) ).
tff(c_455,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_404,c_398,c_447]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : RNG116+4 : TPTP v9.0.0. Released v4.0.0.
% 0.06/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.12/0.34 % Computer : n021.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Tue Apr 8 18:54:43 EDT 2025
% 0.12/0.34 % CPUTime :
% 6.02/2.42 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 6.12/2.43
% 6.12/2.43 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------