TSTP Solution File: NUM465+2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : NUM465+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 : n029.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:46 EDT 2023
% Result : Theorem 152.52s 131.65s
% Output : CNFRefutation 152.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 19
% Syntax : Number of formulae : 46 ( 13 unt; 11 typ; 0 def)
% Number of atoms : 74 ( 30 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 66 ( 27 ~; 22 |; 11 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 3 ( 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 : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 24 (; 22 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ sdtlseqdt0 > aNaturalNumber0 > sdtpldt0 > sdtmndt0 > sdtasdt0 > #nlpp > xn > xm > sz10 > sz00 > #skF_2 > #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('#skF_2',type,
'#skF_2': $i ).
tff(xm,type,
xm: $i ).
tff(xn,type,
xn: $i ).
tff('#skF_1',type,
'#skF_1': ( $i * $i ) > $i ).
tff(f_272,hypothesis,
( aNaturalNumber0(xm)
& aNaturalNumber0(xn) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__987) ).
tff(f_291,negated_conjecture,
~ ( ( xm != sz00 )
=> ( ? [W0] :
( aNaturalNumber0(W0)
& ( sdtpldt0(xn,W0) = sdtasdt0(xn,xm) ) )
| sdtlseqdt0(xn,sdtasdt0(xn,xm)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
tff(f_281,hypothesis,
( ( xm != sz00 )
=> ( ? [W0] :
( aNaturalNumber0(W0)
& ( sdtpldt0(sz10,W0) = xm ) )
& sdtlseqdt0(sz10,xm) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1007) ).
tff(f_73,axiom,
! [W0,W1] :
( ( aNaturalNumber0(W0)
& aNaturalNumber0(W1) )
=> ( sdtasdt0(W0,W1) = sdtasdt0(W1,W0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mMulComm) ).
tff(f_47,axiom,
! [W0,W1] :
( ( aNaturalNumber0(W0)
& aNaturalNumber0(W1) )
=> aNaturalNumber0(sdtasdt0(W0,W1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSortsB_02) ).
tff(f_35,axiom,
( aNaturalNumber0(sz10)
& ( sz10 != sz00 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSortsC_01) ).
tff(f_87,axiom,
! [W0] :
( aNaturalNumber0(W0)
=> ( ( sdtasdt0(W0,sz10) = W0 )
& ( W0 = sdtasdt0(sz10,W0) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m_MulUnit) ).
tff(f_103,axiom,
! [W0,W1,W2] :
( ( aNaturalNumber0(W0)
& aNaturalNumber0(W1)
& aNaturalNumber0(W2) )
=> ( ( sdtasdt0(W0,sdtpldt0(W1,W2)) = sdtpldt0(sdtasdt0(W0,W1),sdtasdt0(W0,W2)) )
& ( sdtasdt0(sdtpldt0(W1,W2),W0) = sdtpldt0(sdtasdt0(W1,W0),sdtasdt0(W2,W0)) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mAMDistr) ).
tff(c_95,plain,
aNaturalNumber0(xn),
inference(cnfTransformation,[status(thm)],[f_272]) ).
tff(c_109,plain,
xm != sz00,
inference(cnfTransformation,[status(thm)],[f_291]) ).
tff(c_103,plain,
( aNaturalNumber0('#skF_2')
| ( xm = sz00 ) ),
inference(cnfTransformation,[status(thm)],[f_281]) ).
tff(c_110,plain,
aNaturalNumber0('#skF_2'),
inference(negUnitSimplification,[status(thm)],[c_109,c_103]) ).
tff(c_655,plain,
! [W1_77,W0_78] :
( ( sdtasdt0(W1_77,W0_78) = sdtasdt0(W0_78,W1_77) )
| ~ aNaturalNumber0(W1_77)
| ~ aNaturalNumber0(W0_78) ),
inference(cnfTransformation,[status(thm)],[f_73]) ).
tff(c_2079,plain,
! [W0_103] :
( ( sdtasdt0(W0_103,'#skF_2') = sdtasdt0('#skF_2',W0_103) )
| ~ aNaturalNumber0(W0_103) ),
inference(resolution,[status(thm)],[c_110,c_655]) ).
tff(c_2141,plain,
sdtasdt0(xn,'#skF_2') = sdtasdt0('#skF_2',xn),
inference(resolution,[status(thm)],[c_95,c_2079]) ).
tff(c_12,plain,
! [W0_4,W1_5] :
( aNaturalNumber0(sdtasdt0(W0_4,W1_5))
| ~ aNaturalNumber0(W1_5)
| ~ aNaturalNumber0(W0_4) ),
inference(cnfTransformation,[status(thm)],[f_47]) ).
tff(c_2223,plain,
( aNaturalNumber0(sdtasdt0('#skF_2',xn))
| ~ aNaturalNumber0('#skF_2')
| ~ aNaturalNumber0(xn) ),
inference(superposition,[status(thm),theory(equality)],[c_2141,c_12]) ).
tff(c_2231,plain,
aNaturalNumber0(sdtasdt0('#skF_2',xn)),
inference(demodulation,[status(thm),theory(equality)],[c_95,c_110,c_2223]) ).
tff(c_97,plain,
aNaturalNumber0(xm),
inference(cnfTransformation,[status(thm)],[f_272]) ).
tff(c_694,plain,
! [W0_81] :
( ( sdtasdt0(xm,W0_81) = sdtasdt0(W0_81,xm) )
| ~ aNaturalNumber0(W0_81) ),
inference(resolution,[status(thm)],[c_97,c_655]) ).
tff(c_724,plain,
sdtasdt0(xn,xm) = sdtasdt0(xm,xn),
inference(resolution,[status(thm)],[c_95,c_694]) ).
tff(c_107,plain,
! [W0_59] :
( ( sdtpldt0(xn,W0_59) != sdtasdt0(xn,xm) )
| ~ aNaturalNumber0(W0_59) ),
inference(cnfTransformation,[status(thm)],[f_291]) ).
tff(c_731,plain,
! [W0_59] :
( ( sdtpldt0(xn,W0_59) != sdtasdt0(xm,xn) )
| ~ aNaturalNumber0(W0_59) ),
inference(demodulation,[status(thm),theory(equality)],[c_724,c_107]) ).
tff(c_2273,plain,
sdtpldt0(xn,sdtasdt0('#skF_2',xn)) != sdtasdt0(xm,xn),
inference(resolution,[status(thm)],[c_2231,c_731]) ).
tff(c_101,plain,
( ( sdtpldt0(sz10,'#skF_2') = xm )
| ( xm = sz00 ) ),
inference(cnfTransformation,[status(thm)],[f_281]) ).
tff(c_111,plain,
sdtpldt0(sz10,'#skF_2') = xm,
inference(negUnitSimplification,[status(thm)],[c_109,c_101]) ).
tff(c_8,plain,
aNaturalNumber0(sz10),
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_151,plain,
! [W0_62] :
( ( sdtasdt0(W0_62,sz10) = W0_62 )
| ~ aNaturalNumber0(W0_62) ),
inference(cnfTransformation,[status(thm)],[f_87]) ).
tff(c_170,plain,
sdtasdt0(xn,sz10) = xn,
inference(resolution,[status(thm)],[c_95,c_151]) ).
tff(c_5938,plain,
! [W0_152,W1_153,W2_154] :
( ( sdtpldt0(sdtasdt0(W0_152,W1_153),sdtasdt0(W0_152,W2_154)) = sdtasdt0(W0_152,sdtpldt0(W1_153,W2_154)) )
| ~ aNaturalNumber0(W2_154)
| ~ aNaturalNumber0(W1_153)
| ~ aNaturalNumber0(W0_152) ),
inference(cnfTransformation,[status(thm)],[f_103]) ).
tff(c_6159,plain,
! [W2_154] :
( ( sdtpldt0(xn,sdtasdt0(xn,W2_154)) = sdtasdt0(xn,sdtpldt0(sz10,W2_154)) )
| ~ aNaturalNumber0(W2_154)
| ~ aNaturalNumber0(sz10)
| ~ aNaturalNumber0(xn) ),
inference(superposition,[status(thm),theory(equality)],[c_170,c_5938]) ).
tff(c_318346,plain,
! [W2_1195] :
( ( sdtpldt0(xn,sdtasdt0(xn,W2_1195)) = sdtasdt0(xn,sdtpldt0(sz10,W2_1195)) )
| ~ aNaturalNumber0(W2_1195) ),
inference(demodulation,[status(thm),theory(equality)],[c_95,c_8,c_6159]) ).
tff(c_318671,plain,
( ( sdtpldt0(xn,sdtasdt0('#skF_2',xn)) = sdtasdt0(xn,sdtpldt0(sz10,'#skF_2')) )
| ~ aNaturalNumber0('#skF_2') ),
inference(superposition,[status(thm),theory(equality)],[c_2141,c_318346]) ).
tff(c_318870,plain,
sdtpldt0(xn,sdtasdt0('#skF_2',xn)) = sdtasdt0(xm,xn),
inference(demodulation,[status(thm),theory(equality)],[c_110,c_724,c_111,c_318671]) ).
tff(c_318872,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_2273,c_318870]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUM465+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.18/0.35 % Computer : n029.cluster.edu
% 0.18/0.35 % Model : x86_64 x86_64
% 0.18/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.35 % Memory : 8042.1875MB
% 0.18/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.18/0.35 % CPULimit : 300
% 0.18/0.35 % WCLimit : 300
% 0.18/0.35 % DateTime : Thu Aug 3 14:58:52 EDT 2023
% 0.18/0.35 % CPUTime :
% 152.52/131.65 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 152.52/131.66
% 152.52/131.66 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 152.52/131.69
% 152.52/131.69 Inference rules
% 152.52/131.69 ----------------------
% 152.52/131.69 #Ref : 11
% 152.52/131.69 #Sup : 66329
% 152.52/131.69 #Fact : 12
% 152.52/131.69 #Define : 0
% 152.52/131.69 #Split : 61
% 152.52/131.69 #Chain : 0
% 152.52/131.69 #Close : 0
% 152.52/131.69
% 152.52/131.69 Ordering : KBO
% 152.52/131.69
% 152.52/131.69 Simplification rules
% 152.52/131.69 ----------------------
% 152.52/131.69 #Subsume : 13119
% 152.52/131.69 #Demod : 133057
% 152.52/131.69 #Tautology : 12184
% 152.52/131.69 #SimpNegUnit : 7047
% 152.52/131.69 #BackRed : 799
% 152.52/131.69
% 152.52/131.69 #Partial instantiations: 0
% 152.52/131.69 #Strategies tried : 1
% 152.52/131.69
% 152.52/131.69 Timing (in seconds)
% 152.52/131.69 ----------------------
% 152.52/131.69 Preprocessing : 0.65
% 152.52/131.69 Parsing : 0.33
% 152.52/131.69 CNF conversion : 0.04
% 152.52/131.69 Main loop : 129.96
% 152.52/131.69 Inferencing : 8.58
% 152.52/131.69 Reduction : 78.32
% 152.52/131.69 Demodulation : 63.38
% 152.52/131.69 BG Simplification : 0.59
% 152.52/131.69 Subsumption : 35.54
% 152.52/131.69 Abstraction : 1.02
% 152.52/131.69 MUC search : 0.00
% 152.52/131.69 Cooper : 0.00
% 152.52/131.69 Total : 130.67
% 152.52/131.69 Index Insertion : 0.00
% 152.52/131.70 Index Deletion : 0.00
% 152.52/131.70 Index Matching : 0.00
% 152.52/131.70 BG Taut test : 0.00
%------------------------------------------------------------------------------