TSTP Solution File: NUM464+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : NUM464+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 : n022.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.15s 2.01s
% Output : CNFRefutation 4.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 15
% Syntax : Number of formulae : 27 ( 8 unt; 10 typ; 0 def)
% Number of atoms : 35 ( 14 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 30 ( 12 ~; 10 |; 5 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 1 ( 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 : 5 (; 5 !; 0 ?; 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_35,axiom,
( aNaturalNumber0(sz10)
& ( sz10 != sz00 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSortsC_01) ).
tff(f_212,axiom,
! [W0,W1] :
( ( aNaturalNumber0(W0)
& aNaturalNumber0(W1) )
=> ( sdtlseqdt0(W0,W1)
| ( ( W1 != W0 )
& sdtlseqdt0(W1,W0) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mLETotal) ).
tff(f_277,negated_conjecture,
~ ( ( xm != sz00 )
=> sdtlseqdt0(sz10,xm) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
tff(f_272,hypothesis,
( aNaturalNumber0(xm)
& aNaturalNumber0(xn) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__987) ).
tff(f_269,axiom,
! [W0] :
( aNaturalNumber0(W0)
=> ( ( W0 = sz00 )
| ( W0 = sz10 )
| ( ( sz10 != W0 )
& sdtlseqdt0(sz10,W0) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mLENTr) ).
tff(c_8,plain,
aNaturalNumber0(sz10),
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_72,plain,
! [W1_50] :
( sdtlseqdt0(W1_50,W1_50)
| ~ aNaturalNumber0(W1_50) ),
inference(cnfTransformation,[status(thm)],[f_212]) ).
tff(c_101,plain,
xm != sz00,
inference(cnfTransformation,[status(thm)],[f_277]) ).
tff(c_97,plain,
aNaturalNumber0(xm),
inference(cnfTransformation,[status(thm)],[f_272]) ).
tff(c_431,plain,
! [W0_70] :
( sdtlseqdt0(sz10,W0_70)
| ( sz10 = W0_70 )
| ( sz00 = W0_70 )
| ~ aNaturalNumber0(W0_70) ),
inference(cnfTransformation,[status(thm)],[f_269]) ).
tff(c_99,plain,
~ sdtlseqdt0(sz10,xm),
inference(cnfTransformation,[status(thm)],[f_277]) ).
tff(c_434,plain,
( ( xm = sz10 )
| ( xm = sz00 )
| ~ aNaturalNumber0(xm) ),
inference(resolution,[status(thm)],[c_431,c_99]) ).
tff(c_437,plain,
( ( xm = sz10 )
| ( xm = sz00 ) ),
inference(demodulation,[status(thm),theory(equality)],[c_97,c_434]) ).
tff(c_438,plain,
xm = sz10,
inference(negUnitSimplification,[status(thm)],[c_101,c_437]) ).
tff(c_445,plain,
~ sdtlseqdt0(sz10,sz10),
inference(demodulation,[status(thm),theory(equality)],[c_438,c_99]) ).
tff(c_464,plain,
~ aNaturalNumber0(sz10),
inference(resolution,[status(thm)],[c_72,c_445]) ).
tff(c_473,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_8,c_464]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : NUM464+1 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.13 % 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.13/0.34 % Computer : n022.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Thu Aug 3 14:28:33 EDT 2023
% 0.13/0.35 % CPUTime :
% 4.15/2.01 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.15/2.01
% 4.15/2.01 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.15/2.04
% 4.15/2.04 Inference rules
% 4.15/2.04 ----------------------
% 4.15/2.04 #Ref : 0
% 4.15/2.04 #Sup : 98
% 4.15/2.04 #Fact : 0
% 4.15/2.04 #Define : 0
% 4.15/2.04 #Split : 0
% 4.15/2.04 #Chain : 0
% 4.15/2.04 #Close : 0
% 4.15/2.04
% 4.15/2.04 Ordering : KBO
% 4.15/2.04
% 4.15/2.04 Simplification rules
% 4.15/2.04 ----------------------
% 4.15/2.04 #Subsume : 6
% 4.15/2.04 #Demod : 85
% 4.15/2.04 #Tautology : 74
% 4.15/2.04 #SimpNegUnit : 2
% 4.15/2.04 #BackRed : 9
% 4.15/2.04
% 4.15/2.04 #Partial instantiations: 0
% 4.15/2.04 #Strategies tried : 1
% 4.15/2.04
% 4.15/2.04 Timing (in seconds)
% 4.15/2.04 ----------------------
% 4.15/2.04 Preprocessing : 0.63
% 4.15/2.04 Parsing : 0.32
% 4.15/2.04 CNF conversion : 0.04
% 4.15/2.04 Main loop : 0.31
% 4.15/2.04 Inferencing : 0.10
% 4.15/2.04 Reduction : 0.10
% 4.15/2.04 Demodulation : 0.07
% 4.15/2.04 BG Simplification : 0.03
% 4.15/2.04 Subsumption : 0.07
% 4.15/2.04 Abstraction : 0.02
% 4.15/2.04 MUC search : 0.00
% 4.15/2.04 Cooper : 0.00
% 4.15/2.04 Total : 0.98
% 4.15/2.04 Index Insertion : 0.00
% 4.15/2.04 Index Deletion : 0.00
% 4.15/2.04 Index Matching : 0.00
% 4.15/2.04 BG Taut test : 0.00
%------------------------------------------------------------------------------