TSTP Solution File: NUM472+2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : NUM472+2 : 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 : n028.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:48 EDT 2023
% Result : Theorem 4.58s 2.20s
% Output : CNFRefutation 4.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 23
% Syntax : Number of formulae : 32 ( 6 unt; 19 typ; 0 def)
% Number of atoms : 27 ( 12 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 22 ( 8 ~; 4 |; 10 &)
% ( 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 : 19 ( 10 >; 9 *; 0 +; 0 <<)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 15 ( 15 usr; 9 con; 0-2 aty)
% Number of variables : 6 (; 3 !; 3 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ sdtlseqdt0 > iLess0 > doDivides0 > aNaturalNumber0 > sdtsldt0 > sdtpldt0 > sdtmndt0 > sdtasdt0 > #nlpp > xq > xp > xn > xm > xl > sz10 > sz00 > #skF_3 > #skF_4 > #skF_2 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(xq,type,
xq: $i ).
tff(xl,type,
xl: $i ).
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_4',type,
'#skF_4': $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_365,hypothesis,
( ? [W0] :
( aNaturalNumber0(W0)
& ( xm = sdtasdt0(xl,W0) ) )
& doDivides0(xl,xm)
& ? [W0] :
( aNaturalNumber0(W0)
& ( sdtpldt0(xm,xn) = sdtasdt0(xl,W0) ) )
& doDivides0(xl,sdtpldt0(xm,xn)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1324_04) ).
tff(f_352,hypothesis,
( aNaturalNumber0(xl)
& aNaturalNumber0(xm)
& aNaturalNumber0(xn) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1324) ).
tff(f_377,hypothesis,
( aNaturalNumber0(xq)
& ( sdtpldt0(xm,xn) = sdtasdt0(xl,xq) )
& ( xq = sdtsldt0(sdtpldt0(xm,xn),xl) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1379) ).
tff(f_384,negated_conjecture,
~ ( ? [W0] :
( aNaturalNumber0(W0)
& ( sdtpldt0(xm,W0) = sdtpldt0(xm,xn) ) )
| sdtlseqdt0(xm,sdtpldt0(xm,xn)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
tff(c_125,plain,
sdtpldt0(xm,xn) = sdtasdt0(xl,'#skF_3'),
inference(cnfTransformation,[status(thm)],[f_365]) ).
tff(c_117,plain,
aNaturalNumber0(xn),
inference(cnfTransformation,[status(thm)],[f_352]) ).
tff(c_145,plain,
sdtpldt0(xm,xn) = sdtasdt0(xl,xq),
inference(cnfTransformation,[status(thm)],[f_377]) ).
tff(c_155,plain,
sdtasdt0(xl,xq) = sdtasdt0(xl,'#skF_3'),
inference(demodulation,[status(thm),theory(equality)],[c_125,c_145]) ).
tff(c_151,plain,
! [W0_80] :
( ( sdtpldt0(xm,xn) != sdtpldt0(xm,W0_80) )
| ~ aNaturalNumber0(W0_80) ),
inference(cnfTransformation,[status(thm)],[f_384]) ).
tff(c_152,plain,
! [W0_80] :
( ( sdtpldt0(xm,W0_80) != sdtasdt0(xl,xq) )
| ~ aNaturalNumber0(W0_80) ),
inference(demodulation,[status(thm),theory(equality)],[c_145,c_151]) ).
tff(c_210,plain,
! [W0_83] :
( ( sdtpldt0(xm,W0_83) != sdtasdt0(xl,'#skF_3') )
| ~ aNaturalNumber0(W0_83) ),
inference(demodulation,[status(thm),theory(equality)],[c_155,c_152]) ).
tff(c_238,plain,
sdtpldt0(xm,xn) != sdtasdt0(xl,'#skF_3'),
inference(resolution,[status(thm)],[c_117,c_210]) ).
tff(c_631,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_125,c_238]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : NUM472+2 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.15 % 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.36 % Computer : n028.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Thu Aug 3 15:31:24 EDT 2023
% 0.15/0.36 % CPUTime :
% 4.58/2.20 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.58/2.20
% 4.58/2.20 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.58/2.22
% 4.58/2.22 Inference rules
% 4.58/2.22 ----------------------
% 4.58/2.22 #Ref : 0
% 4.58/2.22 #Sup : 165
% 4.58/2.22 #Fact : 0
% 4.58/2.22 #Define : 0
% 4.58/2.22 #Split : 0
% 4.58/2.22 #Chain : 0
% 4.58/2.22 #Close : 0
% 4.58/2.22
% 4.58/2.22 Ordering : KBO
% 4.58/2.22
% 4.58/2.22 Simplification rules
% 4.58/2.22 ----------------------
% 4.58/2.22 #Subsume : 5
% 4.58/2.22 #Demod : 15
% 4.58/2.22 #Tautology : 110
% 4.58/2.22 #SimpNegUnit : 0
% 4.58/2.22 #BackRed : 1
% 4.58/2.22
% 4.58/2.22 #Partial instantiations: 0
% 4.58/2.22 #Strategies tried : 1
% 4.58/2.22
% 4.58/2.22 Timing (in seconds)
% 4.58/2.22 ----------------------
% 4.58/2.23 Preprocessing : 0.68
% 4.58/2.23 Parsing : 0.35
% 4.58/2.23 CNF conversion : 0.05
% 4.58/2.23 Main loop : 0.40
% 4.58/2.23 Inferencing : 0.12
% 4.58/2.23 Reduction : 0.14
% 4.58/2.23 Demodulation : 0.10
% 4.58/2.23 BG Simplification : 0.04
% 4.58/2.23 Subsumption : 0.09
% 4.58/2.23 Abstraction : 0.02
% 4.58/2.23 MUC search : 0.00
% 4.58/2.23 Cooper : 0.00
% 4.58/2.23 Total : 1.13
% 4.58/2.23 Index Insertion : 0.00
% 4.58/2.23 Index Deletion : 0.00
% 4.58/2.23 Index Matching : 0.00
% 4.58/2.23 BG Taut test : 0.00
%------------------------------------------------------------------------------