TSTP Solution File: NUM464+2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : NUM464+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/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 : n009.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:45 EDT 2023
% Result : Theorem 4.39s 1.96s
% Output : CNFRefutation 4.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 16
% Syntax : Number of formulae : 30 ( 10 unt; 10 typ; 0 def)
% Number of atoms : 39 ( 20 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 32 ( 13 ~; 11 |; 5 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 11 ( 6 >; 5 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 6 (; 5 !; 1 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ sdtlseqdt0 > aNaturalNumber0 > sdtpldt0 > sdtmndt0 > sdtasdt0 > #nlpp > xn > xm > sz10 > sz00 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
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(xm,type,
xm: $i ).
tff(xn,type,
xn: $i ).
tff('#skF_1',type,
'#skF_1': ( $i * $i ) > $i ).
tff(f_282,negated_conjecture,
~ ( ( xm != sz00 )
=> ( ? [W0] :
( aNaturalNumber0(W0)
& ( sdtpldt0(sz10,W0) = xm ) )
| sdtlseqdt0(sz10,xm) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
tff(f_35,axiom,
( aNaturalNumber0(sz10)
& ( sz10 != sz00 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSortsC_01) ).
tff(f_67,axiom,
! [W0] :
( aNaturalNumber0(W0)
=> ( ( sdtpldt0(W0,sz00) = W0 )
& ( W0 = sdtpldt0(sz00,W0) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m_AddZero) ).
tff(f_31,axiom,
aNaturalNumber0(sz00),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSortsC) ).
tff(f_272,hypothesis,
( aNaturalNumber0(xm)
& aNaturalNumber0(xn) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__987) ).
tff(f_269,axiom,
! [W0] :
( aNaturalNumber0(W0)
=> ( ( W0 = sz00 )
| ( W0 = sz10 )
| ( ( sz10 != W0 )
& sdtlseqdt0(sz10,W0) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mLENTr) ).
tff(c_103,plain,
xm != sz00,
inference(cnfTransformation,[status(thm)],[f_282]) ).
tff(c_8,plain,
aNaturalNumber0(sz10),
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_155,plain,
! [W0_63] :
( ( sdtpldt0(W0_63,sz00) = W0_63 )
| ~ aNaturalNumber0(W0_63) ),
inference(cnfTransformation,[status(thm)],[f_67]) ).
tff(c_170,plain,
sdtpldt0(sz10,sz00) = sz10,
inference(resolution,[status(thm)],[c_8,c_155]) ).
tff(c_4,plain,
aNaturalNumber0(sz00),
inference(cnfTransformation,[status(thm)],[f_31]) ).
tff(c_122,plain,
! [W0_62] :
( ( sdtpldt0(sz10,W0_62) != xm )
| ~ aNaturalNumber0(W0_62) ),
inference(cnfTransformation,[status(thm)],[f_282]) ).
tff(c_135,plain,
sdtpldt0(sz10,sz00) != xm,
inference(resolution,[status(thm)],[c_4,c_122]) ).
tff(c_181,plain,
xm != sz10,
inference(demodulation,[status(thm),theory(equality)],[c_170,c_135]) ).
tff(c_97,plain,
aNaturalNumber0(xm),
inference(cnfTransformation,[status(thm)],[f_272]) ).
tff(c_459,plain,
! [W0_72] :
( sdtlseqdt0(sz10,W0_72)
| ( sz10 = W0_72 )
| ( sz00 = W0_72 )
| ~ aNaturalNumber0(W0_72) ),
inference(cnfTransformation,[status(thm)],[f_269]) ).
tff(c_99,plain,
~ sdtlseqdt0(sz10,xm),
inference(cnfTransformation,[status(thm)],[f_282]) ).
tff(c_462,plain,
( ( xm = sz10 )
| ( xm = sz00 )
| ~ aNaturalNumber0(xm) ),
inference(resolution,[status(thm)],[c_459,c_99]) ).
tff(c_465,plain,
( ( xm = sz10 )
| ( xm = sz00 ) ),
inference(demodulation,[status(thm),theory(equality)],[c_97,c_462]) ).
tff(c_467,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_103,c_181,c_465]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUM464+2 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.13 % 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.14/0.35 % Computer : n009.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu Aug 3 15:06:08 EDT 2023
% 0.14/0.35 % CPUTime :
% 4.39/1.96 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.39/1.96
% 4.39/1.96 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 4.39/1.98
% 4.39/1.98 Inference rules
% 4.39/1.98 ----------------------
% 4.39/1.98 #Ref : 0
% 4.39/1.98 #Sup : 100
% 4.39/1.98 #Fact : 0
% 4.39/1.98 #Define : 0
% 4.39/1.98 #Split : 0
% 4.39/1.98 #Chain : 0
% 4.39/1.98 #Close : 0
% 4.39/1.98
% 4.39/1.98 Ordering : KBO
% 4.39/1.98
% 4.39/1.98 Simplification rules
% 4.39/1.98 ----------------------
% 4.39/1.98 #Subsume : 5
% 4.39/1.98 #Demod : 64
% 4.39/1.98 #Tautology : 64
% 4.39/1.98 #SimpNegUnit : 1
% 4.39/1.98 #BackRed : 1
% 4.39/1.98
% 4.39/1.98 #Partial instantiations: 0
% 4.39/1.98 #Strategies tried : 1
% 4.39/1.98
% 4.39/1.98 Timing (in seconds)
% 4.39/1.98 ----------------------
% 4.39/1.99 Preprocessing : 0.60
% 4.39/1.99 Parsing : 0.31
% 4.39/1.99 CNF conversion : 0.04
% 4.39/1.99 Main loop : 0.33
% 4.39/1.99 Inferencing : 0.11
% 4.39/1.99 Reduction : 0.10
% 4.39/1.99 Demodulation : 0.07
% 4.39/1.99 BG Simplification : 0.03
% 4.39/1.99 Subsumption : 0.08
% 4.39/1.99 Abstraction : 0.02
% 4.39/1.99 MUC search : 0.00
% 4.39/1.99 Cooper : 0.00
% 4.39/1.99 Total : 0.98
% 4.39/1.99 Index Insertion : 0.00
% 4.39/1.99 Index Deletion : 0.00
% 4.39/1.99 Index Matching : 0.00
% 4.39/1.99 BG Taut test : 0.00
%------------------------------------------------------------------------------