TSTP Solution File: NUM530+3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : NUM530+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 : n015.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:52:00 EDT 2023
% Result : Theorem 3.95s 1.89s
% Output : CNFRefutation 3.95s
% Verified :
% SZS Type : Refutation
% Derivation depth : 1
% Number of leaves : 25
% Syntax : Number of formulae : 26 ( 2 unt; 24 typ; 0 def)
% Number of atoms : 2 ( 0 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 1 ( 1 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 2 ( 2 avg)
% Maximal term depth : 0 ( 0 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 28 ( 15 >; 13 *; 0 +; 0 <<)
% Number of predicates : 7 ( 5 usr; 2 prp; 0-2 aty)
% Number of functors : 19 ( 19 usr; 9 con; 0-3 aty)
% Number of variables : 0 (; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ sdtlseqdt0 > iLess0 > doDivides0 > isPrime0 > aNaturalNumber0 > sdtsldt0 > sdtpldt0 > sdtmndt0 > sdtasdt0 > #nlpp > xq > xp > xn > xm > sz10 > sz00 > #skF_4 > #skF_6 > #skF_7 > #skF_5 > #skF_9 > #skF_8 > #skF_3 > #skF_2 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(xq,type,
xq: $i ).
tff(sdtasdt0,type,
sdtasdt0: ( $i * $i ) > $i ).
tff('#skF_4',type,
'#skF_4': $i > $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_7',type,
'#skF_7': $i ).
tff(sdtpldt0,type,
sdtpldt0: ( $i * $i ) > $i ).
tff(isPrime0,type,
isPrime0: $i > $o ).
tff(aNaturalNumber0,type,
aNaturalNumber0: $i > $o ).
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_8',type,
'#skF_8': $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(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_533,hypothesis,
~ $true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__3161) ).
tff(c_209,plain,
$false,
inference(cnfTransformation,[status(thm)],[f_533]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : NUM530+3 : TPTP v8.1.2. Released v4.0.0.
% 0.12/0.14 % 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.15/0.35 % Computer : n015.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Thu Aug 3 14:41:13 EDT 2023
% 0.15/0.36 % CPUTime :
% 3.95/1.89 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.95/1.89
% 3.95/1.89 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.95/1.91
% 3.95/1.91 Inference rules
% 3.95/1.91 ----------------------
% 3.95/1.91 #Ref : 0
% 3.95/1.91 #Sup : 0
% 3.95/1.91 #Fact : 0
% 3.95/1.91 #Define : 0
% 3.95/1.91 #Split : 0
% 3.95/1.91 #Chain : 0
% 3.95/1.91 #Close : 0
% 3.95/1.91
% 3.95/1.91 Ordering : KBO
% 3.95/1.91
% 3.95/1.91 Simplification rules
% 3.95/1.91 ----------------------
% 3.95/1.91 #Subsume : 100
% 3.95/1.91 #Demod : 0
% 3.95/1.91 #Tautology : 4
% 3.95/1.91 #SimpNegUnit : 0
% 3.95/1.91 #BackRed : 0
% 3.95/1.91
% 3.95/1.91 #Partial instantiations: 0
% 3.95/1.91 #Strategies tried : 1
% 3.95/1.91
% 3.95/1.91 Timing (in seconds)
% 3.95/1.91 ----------------------
% 3.95/1.92 Preprocessing : 0.74
% 3.95/1.92 Parsing : 0.38
% 3.95/1.92 CNF conversion : 0.05
% 3.95/1.92 Main loop : 0.05
% 3.95/1.92 Inferencing : 0.00
% 3.95/1.92 Reduction : 0.01
% 3.95/1.92 Demodulation : 0.01
% 3.95/1.92 BG Simplification : 0.04
% 3.95/1.92 Subsumption : 0.03
% 3.95/1.92 Abstraction : 0.01
% 3.95/1.92 MUC search : 0.00
% 3.95/1.92 Cooper : 0.00
% 3.95/1.92 Total : 0.82
% 3.95/1.92 Index Insertion : 0.00
% 3.95/1.92 Index Deletion : 0.00
% 3.95/1.92 Index Matching : 0.00
% 3.95/1.92 BG Taut test : 0.00
%------------------------------------------------------------------------------