TSTP Solution File: NUM491+3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : NUM491+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/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% Computer : n016.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:52 EDT 2023
% Result : Theorem 5.62s 2.43s
% Output : CNFRefutation 5.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 28
% Syntax : Number of formulae : 31 ( 2 unt; 26 typ; 0 def)
% Number of atoms : 10 ( 2 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 8 ( 3 ~; 2 |; 3 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 2 ( 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 : 21 ( 21 usr; 9 con; 0-3 aty)
% Number of variables : 2 (; 1 !; 1 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ sdtlseqdt0 > iLess0 > doDivides0 > isPrime0 > aNaturalNumber0 > sdtsldt0 > sdtpldt0 > sdtmndt0 > sdtasdt0 > #nlpp > xr > xp > xn > xm > sz10 > sz00 > #skF_4 > #skF_11 > #skF_6 > #skF_10 > #skF_5 > #skF_9 > #skF_7 > #skF_3 > #skF_2 > #skF_8 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
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(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_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(f_423,hypothesis,
( aNaturalNumber0(xn)
& aNaturalNumber0(xm)
& aNaturalNumber0(xp) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1837) ).
tff(f_534,negated_conjecture,
~ ( ? [W0] :
( aNaturalNumber0(W0)
& ( sdtasdt0(xp,xm) = sdtasdt0(xp,W0) ) )
| doDivides0(xp,sdtasdt0(xp,xm)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
tff(c_145,plain,
aNaturalNumber0(xm),
inference(cnfTransformation,[status(thm)],[f_423]) ).
tff(c_454,plain,
! [W0_110] :
( ( sdtasdt0(xp,xm) != sdtasdt0(xp,W0_110) )
| ~ aNaturalNumber0(W0_110) ),
inference(cnfTransformation,[status(thm)],[f_534]) ).
tff(c_488,plain,
$false,
inference(resolution,[status(thm)],[c_145,c_454]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : NUM491+3 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.14 % Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.16/0.35 % Computer : n016.cluster.edu
% 0.16/0.35 % Model : x86_64 x86_64
% 0.16/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.35 % Memory : 8042.1875MB
% 0.16/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.35 % CPULimit : 300
% 0.16/0.35 % WCLimit : 300
% 0.16/0.35 % DateTime : Thu Aug 3 15:32:38 EDT 2023
% 0.16/0.35 % CPUTime :
% 5.62/2.43 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.62/2.43
% 5.62/2.43 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 5.62/2.46
% 5.62/2.46 Inference rules
% 5.62/2.46 ----------------------
% 5.62/2.46 #Ref : 0
% 5.62/2.46 #Sup : 9
% 5.62/2.46 #Fact : 0
% 5.62/2.46 #Define : 0
% 5.62/2.46 #Split : 0
% 5.62/2.46 #Chain : 0
% 5.62/2.46 #Close : 0
% 5.62/2.46
% 5.62/2.46 Ordering : KBO
% 5.62/2.46
% 5.62/2.46 Simplification rules
% 5.62/2.46 ----------------------
% 5.62/2.46 #Subsume : 5
% 5.62/2.46 #Demod : 4
% 5.62/2.46 #Tautology : 5
% 5.62/2.46 #SimpNegUnit : 0
% 5.62/2.46 #BackRed : 0
% 5.62/2.46
% 5.62/2.46 #Partial instantiations: 0
% 5.62/2.46 #Strategies tried : 1
% 5.62/2.46
% 5.62/2.46 Timing (in seconds)
% 5.62/2.46 ----------------------
% 5.62/2.46 Preprocessing : 0.84
% 5.62/2.46 Parsing : 0.39
% 5.62/2.46 CNF conversion : 0.07
% 5.62/2.46 Main loop : 0.59
% 5.62/2.46 Inferencing : 0.05
% 5.62/2.46 Reduction : 0.21
% 5.62/2.46 Demodulation : 0.14
% 5.62/2.46 BG Simplification : 0.08
% 5.62/2.46 Subsumption : 0.26
% 5.62/2.46 Abstraction : 0.03
% 5.62/2.46 MUC search : 0.00
% 5.62/2.46 Cooper : 0.00
% 5.62/2.46 Total : 1.47
% 5.62/2.46 Index Insertion : 0.00
% 5.62/2.46 Index Deletion : 0.00
% 5.62/2.46 Index Matching : 0.00
% 5.62/2.46 BG Taut test : 0.00
%------------------------------------------------------------------------------