TSTP Solution File: NUM489+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : NUM489+1 : 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:51:52 EDT 2023
% Result : Theorem 7.03s 2.64s
% Output : CNFRefutation 7.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 24
% Syntax : Number of formulae : 33 ( 10 unt; 19 typ; 1 def)
% Number of atoms : 27 ( 9 equ)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 21 ( 8 ~; 6 |; 4 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 22 ( 13 >; 9 *; 0 +; 0 <<)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 6 con; 0-2 aty)
% Number of variables : 5 (; 5 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ sdtlseqdt0 > iLess0 > doDivides0 > isPrime0 > aNaturalNumber0 > sdtsldt0 > sdtpldt0 > sdtmndt0 > sdtasdt0 > #nlpp > xr > xp > xn > xm > sz10 > sz00 > #skF_4 > #skF_3 > #skF_2 > #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(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(isPrime0,type,
isPrime0: $i > $o ).
tff(aNaturalNumber0,type,
aNaturalNumber0: $i > $o ).
tff(doDivides0,type,
doDivides0: ( $i * $i ) > $o ).
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_450,negated_conjecture,
xn != sdtpldt0(xp,xr),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
tff(f_423,hypothesis,
( aNaturalNumber0(xn)
& aNaturalNumber0(xm)
& aNaturalNumber0(xp) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1837) ).
tff(f_443,hypothesis,
sdtlseqdt0(xp,xn),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1870) ).
tff(f_444,hypothesis,
xr = sdtmndt0(xn,xp),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1883) ).
tff(f_175,definition,
! [W0,W1] :
( ( aNaturalNumber0(W0)
& aNaturalNumber0(W1) )
=> ( sdtlseqdt0(W0,W1)
=> ! [W2] :
( ( W2 = sdtmndt0(W1,W0) )
<=> ( aNaturalNumber0(W2)
& ( sdtpldt0(W0,W2) = W1 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefDiff) ).
tff(c_163,plain,
sdtpldt0(xp,xr) != xn,
inference(cnfTransformation,[status(thm)],[f_450]) ).
tff(c_143,plain,
aNaturalNumber0(xp),
inference(cnfTransformation,[status(thm)],[f_423]) ).
tff(c_147,plain,
aNaturalNumber0(xn),
inference(cnfTransformation,[status(thm)],[f_423]) ).
tff(c_155,plain,
sdtlseqdt0(xp,xn),
inference(cnfTransformation,[status(thm)],[f_443]) ).
tff(c_157,plain,
sdtmndt0(xn,xp) = xr,
inference(cnfTransformation,[status(thm)],[f_444]) ).
tff(c_3002,plain,
! [W0_172,W1_173] :
( ( sdtpldt0(W0_172,sdtmndt0(W1_173,W0_172)) = W1_173 )
| ~ sdtlseqdt0(W0_172,W1_173)
| ~ aNaturalNumber0(W1_173)
| ~ aNaturalNumber0(W0_172) ),
inference(cnfTransformation,[status(thm)],[f_175]) ).
tff(c_3021,plain,
( ( sdtpldt0(xp,xr) = xn )
| ~ sdtlseqdt0(xp,xn)
| ~ aNaturalNumber0(xn)
| ~ aNaturalNumber0(xp) ),
inference(superposition,[status(thm),theory(equality)],[c_157,c_3002]) ).
tff(c_3025,plain,
sdtpldt0(xp,xr) = xn,
inference(demodulation,[status(thm),theory(equality)],[c_143,c_147,c_155,c_3021]) ).
tff(c_3027,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_163,c_3025]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.14 % Problem : NUM489+1 : TPTP v8.1.2. Released v4.0.0.
% 0.13/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.37 % Computer : n015.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Thu Aug 3 15:31:44 EDT 2023
% 0.15/0.37 % CPUTime :
% 7.03/2.64 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 7.03/2.65
% 7.03/2.65 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 7.03/2.67
% 7.03/2.67 Inference rules
% 7.03/2.67 ----------------------
% 7.03/2.67 #Ref : 0
% 7.03/2.67 #Sup : 615
% 7.03/2.67 #Fact : 2
% 7.03/2.67 #Define : 0
% 7.03/2.67 #Split : 12
% 7.03/2.67 #Chain : 0
% 7.03/2.67 #Close : 0
% 7.03/2.67
% 7.03/2.67 Ordering : KBO
% 7.03/2.67
% 7.03/2.67 Simplification rules
% 7.03/2.67 ----------------------
% 7.03/2.67 #Subsume : 25
% 7.03/2.67 #Demod : 897
% 7.03/2.67 #Tautology : 327
% 7.03/2.67 #SimpNegUnit : 70
% 7.03/2.67 #BackRed : 107
% 7.03/2.67
% 7.03/2.67 #Partial instantiations: 0
% 7.03/2.67 #Strategies tried : 1
% 7.03/2.67
% 7.03/2.67 Timing (in seconds)
% 7.03/2.67 ----------------------
% 7.03/2.67 Preprocessing : 0.68
% 7.03/2.67 Parsing : 0.35
% 7.03/2.67 CNF conversion : 0.05
% 7.03/2.67 Main loop : 0.83
% 7.03/2.67 Inferencing : 0.27
% 7.03/2.67 Reduction : 0.29
% 7.03/2.67 Demodulation : 0.20
% 7.03/2.67 BG Simplification : 0.05
% 7.03/2.67 Subsumption : 0.17
% 7.03/2.67 Abstraction : 0.04
% 7.03/2.68 MUC search : 0.00
% 7.03/2.68 Cooper : 0.00
% 7.03/2.68 Total : 1.55
% 7.03/2.68 Index Insertion : 0.00
% 7.03/2.68 Index Deletion : 0.00
% 7.03/2.68 Index Matching : 0.00
% 7.03/2.68 BG Taut test : 0.00
%------------------------------------------------------------------------------