TSTP Solution File: NUM505+3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : NUM505+3 : 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 : n029.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:51:55 EDT 2023
% Result : Theorem 10.16s 3.36s
% Output : CNFRefutation 10.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 34
% Syntax : Number of formulae : 48 ( 11 unt; 30 typ; 0 def)
% Number of atoms : 38 ( 8 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 32 ( 12 ~; 9 |; 9 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 34 ( 17 >; 17 *; 0 +; 0 <<)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 25 ( 25 usr; 13 con; 0-3 aty)
% Number of variables : 6 (; 4 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ sdtlseqdt0 > iLess0 > doDivides0 > isPrime0 > aNaturalNumber0 > sdtsldt0 > sdtpldt0 > sdtmndt0 > sdtasdt0 > #nlpp > xr > xp > xn > xm > xk > sz10 > sz00 > #skF_4 > #skF_11 > #skF_6 > #skF_10 > #skF_14 > #skF_13 > #skF_5 > #skF_9 > #skF_7 > #skF_3 > #skF_2 > #skF_8 > #skF_1 > #skF_12
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(xk,type,
xk: $i ).
tff(xr,type,
xr: $i ).
tff(sdtasdt0,type,
sdtasdt0: ( $i * $i ) > $i ).
tff('#skF_4',type,
'#skF_4': $i > $i ).
tff('#skF_11',type,
'#skF_11': $i ).
tff('#skF_6',type,
'#skF_6': ( $i * $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('#skF_10',type,
'#skF_10': $i ).
tff(sdtpldt0,type,
sdtpldt0: ( $i * $i ) > $i ).
tff(isPrime0,type,
isPrime0: $i > $o ).
tff('#skF_14',type,
'#skF_14': $i ).
tff(aNaturalNumber0,type,
aNaturalNumber0: $i > $o ).
tff('#skF_13',type,
'#skF_13': $i ).
tff('#skF_5',type,
'#skF_5': ( $i * $i * $i ) > $i ).
tff(doDivides0,type,
doDivides0: ( $i * $i ) > $o ).
tff('#skF_9',type,
'#skF_9': $i ).
tff('#skF_7',type,
'#skF_7': ( $i * $i * $i ) > $i ).
tff('#skF_3',type,
'#skF_3': $i > $i ).
tff('#skF_2',type,
'#skF_2': ( $i * $i ) > $i ).
tff(xp,type,
xp: $i ).
tff(iLess0,type,
iLess0: ( $i * $i ) > $o ).
tff('#skF_8',type,
'#skF_8': ( $i * $i * $i ) > $i ).
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('#skF_12',type,
'#skF_12': $i ).
tff(f_608,negated_conjecture,
~ ( ~ ( ? [W0] :
( aNaturalNumber0(W0)
& ( sdtpldt0(xp,W0) = xk ) )
| sdtlseqdt0(xp,xk) )
=> ( ( xk != xp )
& ( ? [W0] :
( aNaturalNumber0(W0)
& ( sdtpldt0(xk,W0) = xp ) )
| sdtlseqdt0(xk,xp) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
tff(f_540,hypothesis,
( aNaturalNumber0(xk)
& ( sdtasdt0(xn,xm) = sdtasdt0(xp,xk) )
& ( xk = sdtsldt0(sdtasdt0(xn,xm),xp) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2306) ).
tff(f_423,hypothesis,
( aNaturalNumber0(xn)
& aNaturalNumber0(xm)
& aNaturalNumber0(xp) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1837) ).
tff(f_212,axiom,
! [W0,W1] :
( ( aNaturalNumber0(W0)
& aNaturalNumber0(W1) )
=> ( sdtlseqdt0(W0,W1)
| ( ( W1 != W0 )
& sdtlseqdt0(W1,W0) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mLETotal) ).
tff(c_487,plain,
( ~ sdtlseqdt0(xk,xp)
| ( xp = xk ) ),
inference(cnfTransformation,[status(thm)],[f_608]) ).
tff(c_494,plain,
~ sdtlseqdt0(xk,xp),
inference(splitLeft,[status(thm)],[c_487]) ).
tff(c_445,plain,
aNaturalNumber0(xk),
inference(cnfTransformation,[status(thm)],[f_540]) ).
tff(c_143,plain,
aNaturalNumber0(xp),
inference(cnfTransformation,[status(thm)],[f_423]) ).
tff(c_3867,plain,
! [W1_153,W0_154] :
( sdtlseqdt0(W1_153,W0_154)
| sdtlseqdt0(W0_154,W1_153)
| ~ aNaturalNumber0(W1_153)
| ~ aNaturalNumber0(W0_154) ),
inference(cnfTransformation,[status(thm)],[f_212]) ).
tff(c_483,plain,
~ sdtlseqdt0(xp,xk),
inference(cnfTransformation,[status(thm)],[f_608]) ).
tff(c_3877,plain,
( sdtlseqdt0(xk,xp)
| ~ aNaturalNumber0(xp)
| ~ aNaturalNumber0(xk) ),
inference(resolution,[status(thm)],[c_3867,c_483]) ).
tff(c_3896,plain,
sdtlseqdt0(xk,xp),
inference(demodulation,[status(thm),theory(equality)],[c_445,c_143,c_3877]) ).
tff(c_3898,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_494,c_3896]) ).
tff(c_3899,plain,
xp = xk,
inference(splitRight,[status(thm)],[c_487]) ).
tff(c_3904,plain,
~ sdtlseqdt0(xk,xk),
inference(demodulation,[status(thm),theory(equality)],[c_3899,c_483]) ).
tff(c_3900,plain,
sdtlseqdt0(xk,xp),
inference(splitRight,[status(thm)],[c_487]) ).
tff(c_3964,plain,
sdtlseqdt0(xk,xk),
inference(demodulation,[status(thm),theory(equality)],[c_3899,c_3900]) ).
tff(c_3965,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_3904,c_3964]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUM505+3 : 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.14/0.34 % Computer : n029.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Thu Aug 3 15:30:22 EDT 2023
% 0.21/0.35 % CPUTime :
% 10.16/3.36 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 10.16/3.37
% 10.16/3.37 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 10.16/3.39
% 10.16/3.39 Inference rules
% 10.16/3.39 ----------------------
% 10.16/3.39 #Ref : 0
% 10.16/3.39 #Sup : 885
% 10.16/3.39 #Fact : 2
% 10.16/3.39 #Define : 0
% 10.16/3.40 #Split : 2
% 10.16/3.40 #Chain : 0
% 10.16/3.40 #Close : 0
% 10.16/3.40
% 10.16/3.40 Ordering : KBO
% 10.16/3.40
% 10.16/3.40 Simplification rules
% 10.16/3.40 ----------------------
% 10.16/3.40 #Subsume : 183
% 10.16/3.40 #Demod : 787
% 10.16/3.40 #Tautology : 333
% 10.16/3.40 #SimpNegUnit : 13
% 10.16/3.40 #BackRed : 9
% 10.16/3.40
% 10.16/3.40 #Partial instantiations: 0
% 10.16/3.40 #Strategies tried : 1
% 10.16/3.40
% 10.16/3.40 Timing (in seconds)
% 10.16/3.40 ----------------------
% 10.16/3.40 Preprocessing : 0.82
% 10.16/3.40 Parsing : 0.37
% 10.16/3.40 CNF conversion : 0.07
% 10.16/3.40 Main loop : 1.52
% 10.16/3.40 Inferencing : 0.37
% 10.16/3.40 Reduction : 0.54
% 10.16/3.40 Demodulation : 0.37
% 10.16/3.40 BG Simplification : 0.09
% 10.16/3.40 Subsumption : 0.45
% 10.16/3.40 Abstraction : 0.04
% 10.16/3.40 MUC search : 0.00
% 10.16/3.40 Cooper : 0.00
% 10.16/3.40 Total : 2.39
% 10.16/3.40 Index Insertion : 0.00
% 10.16/3.40 Index Deletion : 0.00
% 10.16/3.40 Index Matching : 0.00
% 10.16/3.40 BG Taut test : 0.00
%------------------------------------------------------------------------------