%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : NUM477+2 : 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 : n006.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 07:56:04 PM UTC 2025
% Result : Theorem 5.89s 2.28s
% Output : CNFRefutation 6.02s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 20 ( 11 unt; 0 typ; 0 def)
% Number of atoms : 39 ( 17 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 30 ( 11 ~; 9 |; 7 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 5 con; 0-2 aty)
% Number of variables : 8 ( 6 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ sdtlseqdt0 > iLess0 > doDivides0 > aNaturalNumber0 > sdtsldt0 > sdtpldt0 > sdtmndt0 > sdtasdt0 > #nlpp > xn > xm > sz10 > sz00 > #skF_3 > #skF_2 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(sdtasdt0,type,
sdtasdt0: ( $i * $i ) > $i ).
tff(sz10,type,
sz10: $i ).
tff(sdtmndt0,type,
sdtmndt0: ( $i * $i ) > $i ).
tff(sdtlseqdt0,type,
sdtlseqdt0: ( $i * $i ) > $o ).
tff(sz00,type,
sz00: $i ).
tff(sdtpldt0,type,
sdtpldt0: ( $i * $i ) > $i ).
tff(aNaturalNumber0,type,
aNaturalNumber0: $i > $o ).
tff('#skF_3',type,
'#skF_3': $i ).
tff(doDivides0,type,
doDivides0: ( $i * $i ) > $o ).
tff('#skF_2',type,
'#skF_2': ( $i * $i ) > $i ).
tff(iLess0,type,
iLess0: ( $i * $i ) > $o ).
tff(xm,type,
xm: $i ).
tff(sdtsldt0,type,
sdtsldt0: ( $i * $i ) > $i ).
tff(xn,type,
xn: $i ).
tff('#skF_1',type,
'#skF_1': ( $i * $i ) > $i ).
tff(f_378,negated_conjecture,
~ ( ? [W0] :
( aNaturalNumber0(W0)
& ( sdtpldt0(xm,W0) = xn ) )
| sdtlseqdt0(xm,xn) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
tff(f_371,hypothesis,
( ? [W0] :
( aNaturalNumber0(W0)
& ( xn = sdtasdt0(xm,W0) ) )
& doDivides0(xm,xn)
& ( xn != sz00 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1494_04) ).
tff(f_362,hypothesis,
( aNaturalNumber0(xm)
& aNaturalNumber0(xn) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1494) ).
tff(f_278,axiom,
! [W0,W1] :
( ( aNaturalNumber0(W0)
& aNaturalNumber0(W1) )
=> ( ( W0 != sz00 )
=> sdtlseqdt0(W1,sdtasdt0(W1,W0)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mMonMul2) ).
tff(f_93,axiom,
! [W0] :
( aNaturalNumber0(W0)
=> ( ( sdtasdt0(W0,sz00) = sz00 )
& ( sz00 = sdtasdt0(sz00,W0) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m_MulZero) ).
tff(c_131,plain,
~ sdtlseqdt0(xm,xn),
inference(cnfTransformation,[status(thm)],[f_378]) ).
tff(c_129,plain,
aNaturalNumber0('#skF_3'),
inference(cnfTransformation,[status(thm)],[f_371]) ).
tff(c_121,plain,
aNaturalNumber0(xm),
inference(cnfTransformation,[status(thm)],[f_362]) ).
tff(c_127,plain,
sdtasdt0(xm,'#skF_3') = xn,
inference(cnfTransformation,[status(thm)],[f_371]) ).
tff(c_1465,plain,
! [W1_116,W0_117] :
( sdtlseqdt0(W1_116,sdtasdt0(W1_116,W0_117))
| ( sz00 = W0_117 )
| ~ aNaturalNumber0(W1_116)
| ~ aNaturalNumber0(W0_117) ),
inference(cnfTransformation,[status(thm)],[f_278]) ).
tff(c_1540,plain,
( sdtlseqdt0(xm,xn)
| ( sz00 = '#skF_3' )
| ~ aNaturalNumber0(xm)
| ~ aNaturalNumber0('#skF_3') ),
inference(superposition,[status(thm),theory(equality)],[c_127,c_1465]) ).
tff(c_1610,plain,
( sdtlseqdt0(xm,xn)
| ( sz00 = '#skF_3' ) ),
inference(demodulation,[status(thm),theory(equality)],[c_129,c_121,c_1540]) ).
tff(c_1611,plain,
sz00 = '#skF_3',
inference(negUnitSimplification,[status(thm)],[c_131,c_1610]) ).
tff(c_123,plain,
xn != sz00,
inference(cnfTransformation,[status(thm)],[f_371]) ).
tff(c_1654,plain,
xn != '#skF_3',
inference(demodulation,[status(thm),theory(equality)],[c_1611,c_123]) ).
tff(c_298,plain,
! [W0_90] :
( ( sdtasdt0(W0_90,sz00) = sz00 )
| ~ aNaturalNumber0(W0_90) ),
inference(cnfTransformation,[status(thm)],[f_93]) ).
tff(c_316,plain,
sdtasdt0(xm,sz00) = sz00,
inference(resolution,[status(thm)],[c_121,c_298]) ).
tff(c_1631,plain,
sdtasdt0(xm,'#skF_3') = '#skF_3',
inference(demodulation,[status(thm),theory(equality)],[c_1611,c_1611,c_316]) ).
tff(c_1754,plain,
xn = '#skF_3',
inference(demodulation,[status(thm),theory(equality)],[c_1631,c_127]) ).
tff(c_1756,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_1654,c_1754]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM477+2 : 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 : n006.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 12:49:07 EDT 2025
% 0.13/0.34 % CPUTime :
% 5.89/2.28 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.89/2.29
% 5.89/2.29 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------