TSTP Solution File: NUM460+2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : NUM460+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 : n032.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:44 EDT 2023
% Result : Theorem 12.22s 3.94s
% Output : CNFRefutation 12.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 18
% Syntax : Number of formulae : 37 ( 9 unt; 13 typ; 0 def)
% Number of atoms : 59 ( 19 equ)
% Maximal formula atoms : 9 ( 2 avg)
% Number of connectives : 58 ( 23 ~; 19 |; 12 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 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 : 11 ( 11 usr; 7 con; 0-2 aty)
% Number of variables : 23 (; 20 !; 3 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ sdtlseqdt0 > aNaturalNumber0 > sdtpldt0 > sdtmndt0 > sdtasdt0 > #nlpp > xn > xm > xl > sz10 > sz00 > #skF_2 > #skF_3 > #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_2',type,
'#skF_2': $i ).
tff('#skF_3',type,
'#skF_3': $i ).
tff(xm,type,
xm: $i ).
tff(xn,type,
xn: $i ).
tff('#skF_1',type,
'#skF_1': ( $i * $i ) > $i ).
tff(f_215,negated_conjecture,
~ ( ( ? [W0] :
( aNaturalNumber0(W0)
& ( sdtpldt0(xm,W0) = xn ) )
& sdtlseqdt0(xm,xn)
& ? [W0] :
( aNaturalNumber0(W0)
& ( sdtpldt0(xn,W0) = xl ) )
& sdtlseqdt0(xn,xl) )
=> ( ? [W0] :
( aNaturalNumber0(W0)
& ( sdtpldt0(xm,W0) = xl ) )
| sdtlseqdt0(xm,xl) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
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_194,hypothesis,
( aNaturalNumber0(xm)
& aNaturalNumber0(xn)
& aNaturalNumber0(xl) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__773) ).
tff(f_61,axiom,
! [W0,W1,W2] :
( ( aNaturalNumber0(W0)
& aNaturalNumber0(W1)
& aNaturalNumber0(W2) )
=> ( sdtpldt0(sdtpldt0(W0,W1),W2) = sdtpldt0(W0,sdtpldt0(W1,W2)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mAddAsso) ).
tff(c_88,plain,
aNaturalNumber0('#skF_2'),
inference(cnfTransformation,[status(thm)],[f_215]) ).
tff(c_82,plain,
aNaturalNumber0('#skF_3'),
inference(cnfTransformation,[status(thm)],[f_215]) ).
tff(c_1065,plain,
! [W1_66,W0_67] :
( ( sdtpldt0(W1_66,W0_67) = sdtpldt0(W0_67,W1_66) )
| ~ aNaturalNumber0(W1_66)
| ~ aNaturalNumber0(W0_67) ),
inference(cnfTransformation,[status(thm)],[f_53]) ).
tff(c_1272,plain,
! [W0_70] :
( ( sdtpldt0(W0_70,'#skF_3') = sdtpldt0('#skF_3',W0_70) )
| ~ aNaturalNumber0(W0_70) ),
inference(resolution,[status(thm)],[c_82,c_1065]) ).
tff(c_1327,plain,
sdtpldt0('#skF_2','#skF_3') = sdtpldt0('#skF_3','#skF_2'),
inference(resolution,[status(thm)],[c_88,c_1272]) ).
tff(c_447,plain,
! [W0_55,W1_56] :
( aNaturalNumber0(sdtpldt0(W0_55,W1_56))
| ~ aNaturalNumber0(W1_56)
| ~ aNaturalNumber0(W0_55) ),
inference(cnfTransformation,[status(thm)],[f_41]) ).
tff(c_76,plain,
! [W0_46] :
( ( sdtpldt0(xm,W0_46) != xl )
| ~ aNaturalNumber0(W0_46) ),
inference(cnfTransformation,[status(thm)],[f_215]) ).
tff(c_518,plain,
! [W0_55,W1_56] :
( ( sdtpldt0(xm,sdtpldt0(W0_55,W1_56)) != xl )
| ~ aNaturalNumber0(W1_56)
| ~ aNaturalNumber0(W0_55) ),
inference(resolution,[status(thm)],[c_447,c_76]) ).
tff(c_1554,plain,
( ( sdtpldt0(xm,sdtpldt0('#skF_3','#skF_2')) != xl )
| ~ aNaturalNumber0('#skF_3')
| ~ aNaturalNumber0('#skF_2') ),
inference(superposition,[status(thm),theory(equality)],[c_1327,c_518]) ).
tff(c_1565,plain,
sdtpldt0(xm,sdtpldt0('#skF_3','#skF_2')) != xl,
inference(demodulation,[status(thm),theory(equality)],[c_88,c_82,c_1554]) ).
tff(c_80,plain,
sdtpldt0(xn,'#skF_3') = xl,
inference(cnfTransformation,[status(thm)],[f_215]) ).
tff(c_72,plain,
aNaturalNumber0(xm),
inference(cnfTransformation,[status(thm)],[f_194]) ).
tff(c_86,plain,
sdtpldt0(xm,'#skF_2') = xn,
inference(cnfTransformation,[status(thm)],[f_215]) ).
tff(c_2904,plain,
! [W0_92,W1_93,W2_94] :
( ( sdtpldt0(sdtpldt0(W0_92,W1_93),W2_94) = sdtpldt0(W0_92,sdtpldt0(W1_93,W2_94)) )
| ~ aNaturalNumber0(W2_94)
| ~ aNaturalNumber0(W1_93)
| ~ aNaturalNumber0(W0_92) ),
inference(cnfTransformation,[status(thm)],[f_61]) ).
tff(c_3019,plain,
! [W2_94] :
( ( sdtpldt0(xm,sdtpldt0('#skF_2',W2_94)) = sdtpldt0(xn,W2_94) )
| ~ aNaturalNumber0(W2_94)
| ~ aNaturalNumber0('#skF_2')
| ~ aNaturalNumber0(xm) ),
inference(superposition,[status(thm),theory(equality)],[c_86,c_2904]) ).
tff(c_12069,plain,
! [W2_137] :
( ( sdtpldt0(xm,sdtpldt0('#skF_2',W2_137)) = sdtpldt0(xn,W2_137) )
| ~ aNaturalNumber0(W2_137) ),
inference(demodulation,[status(thm),theory(equality)],[c_72,c_88,c_3019]) ).
tff(c_12128,plain,
( ( sdtpldt0(xm,sdtpldt0('#skF_3','#skF_2')) = sdtpldt0(xn,'#skF_3') )
| ~ aNaturalNumber0('#skF_3') ),
inference(superposition,[status(thm),theory(equality)],[c_1327,c_12069]) ).
tff(c_12171,plain,
sdtpldt0(xm,sdtpldt0('#skF_3','#skF_2')) = xl,
inference(demodulation,[status(thm),theory(equality)],[c_82,c_80,c_12128]) ).
tff(c_12173,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_1565,c_12171]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : NUM460+2 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.12 % 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.12/0.32 % Computer : n032.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 300
% 0.12/0.32 % DateTime : Thu Aug 3 15:12:51 EDT 2023
% 0.12/0.32 % CPUTime :
% 12.22/3.94 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 12.22/3.95
% 12.22/3.95 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 12.48/3.97
% 12.48/3.97 Inference rules
% 12.48/3.97 ----------------------
% 12.48/3.97 #Ref : 4
% 12.48/3.97 #Sup : 2782
% 12.48/3.97 #Fact : 0
% 12.48/3.97 #Define : 0
% 12.48/3.97 #Split : 36
% 12.48/3.97 #Chain : 0
% 12.48/3.97 #Close : 0
% 12.48/3.97
% 12.48/3.97 Ordering : KBO
% 12.48/3.97
% 12.48/3.97 Simplification rules
% 12.48/3.97 ----------------------
% 12.48/3.97 #Subsume : 184
% 12.48/3.97 #Demod : 3524
% 12.48/3.97 #Tautology : 757
% 12.48/3.97 #SimpNegUnit : 254
% 12.48/3.97 #BackRed : 9
% 12.48/3.97
% 12.48/3.97 #Partial instantiations: 0
% 12.48/3.97 #Strategies tried : 1
% 12.48/3.98
% 12.48/3.98 Timing (in seconds)
% 12.48/3.98 ----------------------
% 12.48/3.98 Preprocessing : 0.57
% 12.48/3.98 Parsing : 0.30
% 12.48/3.98 CNF conversion : 0.04
% 12.48/3.98 Main loop : 2.39
% 12.48/3.98 Inferencing : 0.58
% 12.48/3.98 Reduction : 1.07
% 12.48/3.98 Demodulation : 0.80
% 12.48/3.98 BG Simplification : 0.07
% 12.48/3.98 Subsumption : 0.50
% 12.48/3.98 Abstraction : 0.10
% 12.48/3.98 MUC search : 0.00
% 12.48/3.98 Cooper : 0.00
% 12.48/3.98 Total : 3.01
% 12.48/3.98 Index Insertion : 0.00
% 12.48/3.98 Index Deletion : 0.00
% 12.48/3.98 Index Matching : 0.00
% 12.48/3.98 BG Taut test : 0.00
%------------------------------------------------------------------------------