TSTP Solution File: NUM472+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : NUM472+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/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:47 EDT 2023
% Result : Theorem 6.62s 2.49s
% Output : CNFRefutation 6.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 22
% Syntax : Number of formulae : 34 ( 7 unt; 17 typ; 1 def)
% Number of atoms : 39 ( 5 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 37 ( 15 ~; 12 |; 6 &)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 2 ( 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 : 14 (; 13 !; 1 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ sdtlseqdt0 > iLess0 > doDivides0 > aNaturalNumber0 > sdtsldt0 > sdtpldt0 > sdtmndt0 > sdtasdt0 > #nlpp > xq > xp > xn > xm > xl > sz10 > sz00 > #skF_2 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(xq,type,
xq: $i ).
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(doDivides0,type,
doDivides0: ( $i * $i ) > $o ).
tff('#skF_2',type,
'#skF_2': ( $i * $i ) > $i ).
tff(xp,type,
xp: $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_352,hypothesis,
( aNaturalNumber0(xl)
& aNaturalNumber0(xm)
& aNaturalNumber0(xn) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1324) ).
tff(f_53,axiom,
! [W0,W1] :
( ( aNaturalNumber0(W0)
& aNaturalNumber0(W1) )
=> ( sdtpldt0(W0,W1) = sdtpldt0(W1,W0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mAddComm) ).
tff(f_41,axiom,
! [W0,W1] :
( ( aNaturalNumber0(W0)
& aNaturalNumber0(W1) )
=> aNaturalNumber0(sdtpldt0(W0,W1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSortsB) ).
tff(f_162,definition,
! [W0,W1] :
( ( aNaturalNumber0(W0)
& aNaturalNumber0(W1) )
=> ( sdtlseqdt0(W0,W1)
<=> ? [W2] :
( aNaturalNumber0(W2)
& ( sdtpldt0(W0,W2) = W1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefLE) ).
tff(f_361,negated_conjecture,
~ sdtlseqdt0(xm,sdtpldt0(xm,xn)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
tff(c_119,plain,
aNaturalNumber0(xm),
inference(cnfTransformation,[status(thm)],[f_352]) ).
tff(c_117,plain,
aNaturalNumber0(xn),
inference(cnfTransformation,[status(thm)],[f_352]) ).
tff(c_567,plain,
! [W1_94,W0_95] :
( ( sdtpldt0(W1_94,W0_95) = sdtpldt0(W0_95,W1_94) )
| ~ aNaturalNumber0(W1_94)
| ~ aNaturalNumber0(W0_95) ),
inference(cnfTransformation,[status(thm)],[f_53]) ).
tff(c_666,plain,
! [W0_99] :
( ( sdtpldt0(xm,W0_99) = sdtpldt0(W0_99,xm) )
| ~ aNaturalNumber0(W0_99) ),
inference(resolution,[status(thm)],[c_119,c_567]) ).
tff(c_694,plain,
sdtpldt0(xn,xm) = sdtpldt0(xm,xn),
inference(resolution,[status(thm)],[c_117,c_666]) ).
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_826,plain,
( aNaturalNumber0(sdtpldt0(xm,xn))
| ~ aNaturalNumber0(xm)
| ~ aNaturalNumber0(xn) ),
inference(superposition,[status(thm),theory(equality)],[c_694,c_10]) ).
tff(c_832,plain,
aNaturalNumber0(sdtpldt0(xm,xn)),
inference(demodulation,[status(thm),theory(equality)],[c_117,c_119,c_826]) ).
tff(c_2432,plain,
! [W0_138,W2_139] :
( sdtlseqdt0(W0_138,sdtpldt0(W0_138,W2_139))
| ~ aNaturalNumber0(W2_139)
| ~ aNaturalNumber0(sdtpldt0(W0_138,W2_139))
| ~ aNaturalNumber0(W0_138) ),
inference(cnfTransformation,[status(thm)],[f_162]) ).
tff(c_133,plain,
~ sdtlseqdt0(xm,sdtpldt0(xm,xn)),
inference(cnfTransformation,[status(thm)],[f_361]) ).
tff(c_2440,plain,
( ~ aNaturalNumber0(xn)
| ~ aNaturalNumber0(sdtpldt0(xm,xn))
| ~ aNaturalNumber0(xm) ),
inference(resolution,[status(thm)],[c_2432,c_133]) ).
tff(c_2482,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_119,c_832,c_117,c_2440]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : NUM472+1 : TPTP v8.1.2. Released v4.0.0.
% 0.12/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.13/0.34 % Computer : n009.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 15:05:53 EDT 2023
% 0.13/0.34 % CPUTime :
% 6.62/2.49 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.62/2.50
% 6.62/2.50 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 6.62/2.52
% 6.62/2.52 Inference rules
% 6.62/2.52 ----------------------
% 6.62/2.52 #Ref : 0
% 6.62/2.52 #Sup : 516
% 6.62/2.52 #Fact : 2
% 6.62/2.52 #Define : 0
% 6.62/2.52 #Split : 11
% 6.62/2.52 #Chain : 0
% 6.62/2.52 #Close : 0
% 6.62/2.52
% 6.62/2.52 Ordering : KBO
% 6.62/2.52
% 6.62/2.52 Simplification rules
% 6.62/2.52 ----------------------
% 6.62/2.52 #Subsume : 36
% 6.62/2.52 #Demod : 666
% 6.62/2.52 #Tautology : 290
% 6.62/2.52 #SimpNegUnit : 60
% 6.62/2.52 #BackRed : 97
% 6.62/2.52
% 6.62/2.52 #Partial instantiations: 0
% 6.62/2.52 #Strategies tried : 1
% 6.62/2.52
% 6.62/2.52 Timing (in seconds)
% 6.62/2.52 ----------------------
% 6.62/2.53 Preprocessing : 0.65
% 6.62/2.53 Parsing : 0.33
% 6.62/2.53 CNF conversion : 0.05
% 6.62/2.53 Main loop : 0.84
% 6.62/2.53 Inferencing : 0.27
% 6.62/2.53 Reduction : 0.28
% 6.62/2.53 Demodulation : 0.21
% 6.62/2.53 BG Simplification : 0.05
% 6.62/2.53 Subsumption : 0.17
% 6.62/2.53 Abstraction : 0.04
% 6.62/2.53 MUC search : 0.00
% 6.62/2.53 Cooper : 0.00
% 6.62/2.53 Total : 1.53
% 6.62/2.53 Index Insertion : 0.00
% 6.62/2.53 Index Deletion : 0.00
% 6.62/2.53 Index Matching : 0.00
% 6.62/2.53 BG Taut test : 0.00
%------------------------------------------------------------------------------