TSTP Solution File: NUM467+2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : NUM467+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 : n023.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 27.58s 15.53s
% Output : CNFRefutation 27.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 23
% Syntax : Number of formulae : 42 ( 10 unt; 17 typ; 0 def)
% Number of atoms : 58 ( 18 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 52 ( 19 ~; 17 |; 13 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 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 : 13 ( 13 usr; 7 con; 0-2 aty)
% Number of variables : 21 (; 18 !; 3 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ sdtlseqdt0 > iLess0 > doDivides0 > aNaturalNumber0 > sdtsldt0 > sdtpldt0 > sdtmndt0 > sdtasdt0 > #nlpp > xn > xm > xl > sz10 > sz00 > #skF_3 > #skF_4 > #skF_2 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
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(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_353,hypothesis,
( ? [W0] :
( aNaturalNumber0(W0)
& ( xm = sdtasdt0(xl,W0) ) )
& doDivides0(xl,xm)
& ? [W0] :
( aNaturalNumber0(W0)
& ( xn = sdtasdt0(xl,W0) ) )
& doDivides0(xl,xn) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1240_04) ).
tff(f_53,axiom,
! [W0,W1] :
( ( aNaturalNumber0(W0)
& aNaturalNumber0(W1) )
=> ( sdtpldt0(W0,W1) = sdtpldt0(W1,W0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mAddComm) ).
tff(f_41,axiom,
! [W0,W1] :
( ( aNaturalNumber0(W0)
& aNaturalNumber0(W1) )
=> aNaturalNumber0(sdtpldt0(W0,W1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSortsB) ).
tff(f_360,negated_conjecture,
~ ( ? [W0] :
( aNaturalNumber0(W0)
& ( sdtpldt0(xm,xn) = sdtasdt0(xl,W0) ) )
| doDivides0(xl,sdtpldt0(xm,xn)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
tff(f_340,hypothesis,
( aNaturalNumber0(xl)
& aNaturalNumber0(xm)
& aNaturalNumber0(xn) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1240) ).
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/sandbox/benchmark/theBenchmark.p',mAMDistr) ).
tff(c_125,plain,
aNaturalNumber0('#skF_3'),
inference(cnfTransformation,[status(thm)],[f_353]) ).
tff(c_131,plain,
aNaturalNumber0('#skF_4'),
inference(cnfTransformation,[status(thm)],[f_353]) ).
tff(c_890,plain,
! [W1_93,W0_94] :
( ( sdtpldt0(W1_93,W0_94) = sdtpldt0(W0_94,W1_93) )
| ~ aNaturalNumber0(W1_93)
| ~ aNaturalNumber0(W0_94) ),
inference(cnfTransformation,[status(thm)],[f_53]) ).
tff(c_94840,plain,
! [W0_1056] :
( ( sdtpldt0(W0_1056,'#skF_4') = sdtpldt0('#skF_4',W0_1056) )
| ~ aNaturalNumber0(W0_1056) ),
inference(resolution,[status(thm)],[c_131,c_890]) ).
tff(c_94958,plain,
sdtpldt0('#skF_3','#skF_4') = sdtpldt0('#skF_4','#skF_3'),
inference(resolution,[status(thm)],[c_125,c_94840]) ).
tff(c_10,plain,
! [W0_2,W1_3] :
( aNaturalNumber0(sdtpldt0(W0_2,W1_3))
| ~ aNaturalNumber0(W1_3)
| ~ aNaturalNumber0(W0_2) ),
inference(cnfTransformation,[status(thm)],[f_41]) ).
tff(c_95013,plain,
( aNaturalNumber0(sdtpldt0('#skF_4','#skF_3'))
| ~ aNaturalNumber0('#skF_4')
| ~ aNaturalNumber0('#skF_3') ),
inference(superposition,[status(thm),theory(equality)],[c_94958,c_10]) ).
tff(c_95053,plain,
aNaturalNumber0(sdtpldt0('#skF_4','#skF_3')),
inference(demodulation,[status(thm),theory(equality)],[c_125,c_131,c_95013]) ).
tff(c_135,plain,
! [W0_77] :
( ( sdtpldt0(xm,xn) != sdtasdt0(xl,W0_77) )
| ~ aNaturalNumber0(W0_77) ),
inference(cnfTransformation,[status(thm)],[f_360]) ).
tff(c_95138,plain,
sdtasdt0(xl,sdtpldt0('#skF_4','#skF_3')) != sdtpldt0(xm,xn),
inference(resolution,[status(thm)],[c_95053,c_135]) ).
tff(c_123,plain,
sdtasdt0(xl,'#skF_3') = xn,
inference(cnfTransformation,[status(thm)],[f_353]) ).
tff(c_119,plain,
aNaturalNumber0(xl),
inference(cnfTransformation,[status(thm)],[f_340]) ).
tff(c_129,plain,
sdtasdt0(xl,'#skF_4') = xm,
inference(cnfTransformation,[status(thm)],[f_353]) ).
tff(c_87214,plain,
! [W0_1018,W1_1019,W2_1020] :
( ( sdtpldt0(sdtasdt0(W0_1018,W1_1019),sdtasdt0(W0_1018,W2_1020)) = sdtasdt0(W0_1018,sdtpldt0(W1_1019,W2_1020)) )
| ~ aNaturalNumber0(W2_1020)
| ~ aNaturalNumber0(W1_1019)
| ~ aNaturalNumber0(W0_1018) ),
inference(cnfTransformation,[status(thm)],[f_103]) ).
tff(c_87603,plain,
! [W2_1020] :
( ( sdtpldt0(xm,sdtasdt0(xl,W2_1020)) = sdtasdt0(xl,sdtpldt0('#skF_4',W2_1020)) )
| ~ aNaturalNumber0(W2_1020)
| ~ aNaturalNumber0('#skF_4')
| ~ aNaturalNumber0(xl) ),
inference(superposition,[status(thm),theory(equality)],[c_129,c_87214]) ).
tff(c_101874,plain,
! [W2_1078] :
( ( sdtpldt0(xm,sdtasdt0(xl,W2_1078)) = sdtasdt0(xl,sdtpldt0('#skF_4',W2_1078)) )
| ~ aNaturalNumber0(W2_1078) ),
inference(demodulation,[status(thm),theory(equality)],[c_119,c_131,c_87603]) ).
tff(c_101957,plain,
( ( sdtasdt0(xl,sdtpldt0('#skF_4','#skF_3')) = sdtpldt0(xm,xn) )
| ~ aNaturalNumber0('#skF_3') ),
inference(superposition,[status(thm),theory(equality)],[c_123,c_101874]) ).
tff(c_102014,plain,
sdtasdt0(xl,sdtpldt0('#skF_4','#skF_3')) = sdtpldt0(xm,xn),
inference(demodulation,[status(thm),theory(equality)],[c_125,c_101957]) ).
tff(c_102016,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_95138,c_102014]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : NUM467+2 : TPTP v8.1.2. Released v4.0.0.
% 0.13/0.14 % 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 : n023.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:27:22 EDT 2023
% 0.15/0.36 % CPUTime :
% 27.58/15.53 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 27.58/15.54
% 27.58/15.54 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 27.58/15.56
% 27.58/15.56 Inference rules
% 27.58/15.56 ----------------------
% 27.58/15.56 #Ref : 35
% 27.58/15.56 #Sup : 21133
% 27.58/15.56 #Fact : 2
% 27.58/15.56 #Define : 0
% 27.58/15.56 #Split : 67
% 27.58/15.56 #Chain : 0
% 27.58/15.56 #Close : 0
% 27.58/15.56
% 27.58/15.56 Ordering : KBO
% 27.58/15.56
% 27.58/15.56 Simplification rules
% 27.58/15.56 ----------------------
% 27.58/15.56 #Subsume : 1957
% 27.58/15.56 #Demod : 36982
% 27.58/15.56 #Tautology : 6745
% 27.58/15.56 #SimpNegUnit : 4156
% 27.58/15.56 #BackRed : 1606
% 27.58/15.56
% 27.58/15.56 #Partial instantiations: 0
% 27.58/15.56 #Strategies tried : 1
% 27.58/15.56
% 27.58/15.57 Timing (in seconds)
% 27.58/15.57 ----------------------
% 27.58/15.57 Preprocessing : 0.66
% 27.58/15.57 Parsing : 0.33
% 27.58/15.57 CNF conversion : 0.05
% 27.58/15.57 Main loop : 13.82
% 27.58/15.57 Inferencing : 2.43
% 27.58/15.57 Reduction : 7.53
% 27.58/15.57 Demodulation : 6.11
% 27.58/15.57 BG Simplification : 0.18
% 27.58/15.57 Subsumption : 3.03
% 27.58/15.57 Abstraction : 0.27
% 27.58/15.57 MUC search : 0.00
% 27.58/15.57 Cooper : 0.00
% 27.58/15.57 Total : 14.53
% 27.58/15.57 Index Insertion : 0.00
% 27.58/15.57 Index Deletion : 0.00
% 27.58/15.57 Index Matching : 0.00
% 27.58/15.57 BG Taut test : 0.00
%------------------------------------------------------------------------------