TSTP Solution File: NUM514+3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : NUM514+3 : 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 : n001.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:57 EDT 2023
% Result : Theorem 6.97s 2.61s
% Output : CNFRefutation 6.97s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 37
% Syntax : Number of formulae : 43 ( 4 unt; 35 typ; 0 def)
% Number of atoms : 18 ( 8 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 16 ( 6 ~; 3 |; 6 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 34 ( 17 >; 17 *; 0 +; 0 <<)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 30 ( 30 usr; 18 con; 0-3 aty)
% Number of variables : 3 (; 2 !; 1 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ sdtlseqdt0 > iLess0 > doDivides0 > isPrime0 > aNaturalNumber0 > sdtsldt0 > sdtpldt0 > sdtmndt0 > sdtasdt0 > #nlpp > xr > xp > xn > xm > xk > sz10 > sz00 > #skF_4 > #skF_18 > #skF_17 > #skF_11 > #skF_6 > #skF_15 > #skF_19 > #skF_10 > #skF_16 > #skF_14 > #skF_13 > #skF_5 > #skF_9 > #skF_7 > #skF_3 > #skF_2 > #skF_8 > #skF_1 > #skF_12
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(xk,type,
xk: $i ).
tff(xr,type,
xr: $i ).
tff(sdtasdt0,type,
sdtasdt0: ( $i * $i ) > $i ).
tff('#skF_4',type,
'#skF_4': $i > $i ).
tff('#skF_18',type,
'#skF_18': $i ).
tff('#skF_17',type,
'#skF_17': $i ).
tff('#skF_11',type,
'#skF_11': $i ).
tff('#skF_6',type,
'#skF_6': ( $i * $i * $i ) > $i ).
tff(sz10,type,
sz10: $i ).
tff('#skF_15',type,
'#skF_15': $i ).
tff(sdtmndt0,type,
sdtmndt0: ( $i * $i ) > $i ).
tff(sdtlseqdt0,type,
sdtlseqdt0: ( $i * $i ) > $o ).
tff(sz00,type,
sz00: $i ).
tff('#skF_19',type,
'#skF_19': $i ).
tff('#skF_10',type,
'#skF_10': $i ).
tff('#skF_16',type,
'#skF_16': $i ).
tff(sdtpldt0,type,
sdtpldt0: ( $i * $i ) > $i ).
tff(isPrime0,type,
isPrime0: $i > $o ).
tff('#skF_14',type,
'#skF_14': $i ).
tff(aNaturalNumber0,type,
aNaturalNumber0: $i > $o ).
tff('#skF_13',type,
'#skF_13': $i ).
tff('#skF_5',type,
'#skF_5': ( $i * $i * $i ) > $i ).
tff(doDivides0,type,
doDivides0: ( $i * $i ) > $o ).
tff('#skF_9',type,
'#skF_9': $i ).
tff('#skF_7',type,
'#skF_7': ( $i * $i * $i ) > $i ).
tff('#skF_3',type,
'#skF_3': $i > $i ).
tff('#skF_2',type,
'#skF_2': ( $i * $i ) > $i ).
tff(xp,type,
xp: $i ).
tff(iLess0,type,
iLess0: ( $i * $i ) > $o ).
tff('#skF_8',type,
'#skF_8': ( $i * $i * $i ) > $i ).
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('#skF_12',type,
'#skF_12': $i ).
tff(f_655,hypothesis,
( aNaturalNumber0(sdtsldt0(xk,xr))
& ( xk = sdtasdt0(xr,sdtsldt0(xk,xr)) )
& aNaturalNumber0(sdtsldt0(xn,xr))
& ( xn = sdtasdt0(xr,sdtsldt0(xn,xr)) )
& ( sdtasdt0(xp,sdtsldt0(xk,xr)) = sdtasdt0(sdtsldt0(xn,xr),xm) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2613) ).
tff(f_666,negated_conjecture,
~ ( ( aNaturalNumber0(sdtsldt0(xn,xr))
& ( xn = sdtasdt0(xr,sdtsldt0(xn,xr)) ) )
=> ( ? [W0] :
( aNaturalNumber0(W0)
& ( sdtasdt0(sdtsldt0(xn,xr),xm) = sdtasdt0(xp,W0) ) )
| doDivides0(xp,sdtasdt0(sdtsldt0(xn,xr),xm)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
tff(c_551,plain,
aNaturalNumber0(sdtsldt0(xk,xr)),
inference(cnfTransformation,[status(thm)],[f_655]) ).
tff(c_543,plain,
sdtasdt0(sdtsldt0(xn,xr),xm) = sdtasdt0(xp,sdtsldt0(xk,xr)),
inference(cnfTransformation,[status(thm)],[f_655]) ).
tff(c_555,plain,
! [W0_114] :
( ( sdtasdt0(xp,W0_114) != sdtasdt0(sdtsldt0(xn,xr),xm) )
| ~ aNaturalNumber0(W0_114) ),
inference(cnfTransformation,[status(thm)],[f_666]) ).
tff(c_563,plain,
! [W0_114] :
( ( sdtasdt0(xp,sdtsldt0(xk,xr)) != sdtasdt0(xp,W0_114) )
| ~ aNaturalNumber0(W0_114) ),
inference(demodulation,[status(thm),theory(equality)],[c_543,c_555]) ).
tff(c_587,plain,
~ aNaturalNumber0(sdtsldt0(xk,xr)),
inference(reflexivity,[status(thm),theory(equality)],[c_563]) ).
tff(c_611,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_551,c_587]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : NUM514+3 : TPTP v8.1.2. Released v4.0.0.
% 0.00/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.14/0.36 % Computer : n001.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Thu Aug 3 15:45:25 EDT 2023
% 0.14/0.36 % CPUTime :
% 6.97/2.61 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 6.97/2.61
% 6.97/2.61 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 6.97/2.63
% 6.97/2.63 Inference rules
% 6.97/2.63 ----------------------
% 6.97/2.63 #Ref : 1
% 6.97/2.63 #Sup : 12
% 6.97/2.63 #Fact : 0
% 6.97/2.63 #Define : 0
% 6.97/2.63 #Split : 1
% 6.97/2.63 #Chain : 0
% 6.97/2.63 #Close : 0
% 6.97/2.63
% 6.97/2.63 Ordering : KBO
% 6.97/2.63
% 6.97/2.63 Simplification rules
% 6.97/2.63 ----------------------
% 6.97/2.63 #Subsume : 7
% 6.97/2.63 #Demod : 21
% 6.97/2.63 #Tautology : 26
% 6.97/2.63 #SimpNegUnit : 0
% 6.97/2.63 #BackRed : 0
% 6.97/2.63
% 6.97/2.63 #Partial instantiations: 0
% 6.97/2.63 #Strategies tried : 1
% 6.97/2.63
% 6.97/2.63 Timing (in seconds)
% 6.97/2.63 ----------------------
% 6.97/2.64 Preprocessing : 0.86
% 6.97/2.64 Parsing : 0.39
% 6.97/2.64 CNF conversion : 0.07
% 6.97/2.64 Main loop : 0.72
% 6.97/2.64 Inferencing : 0.07
% 6.97/2.64 Reduction : 0.25
% 6.97/2.64 Demodulation : 0.17
% 6.97/2.64 BG Simplification : 0.09
% 6.97/2.64 Subsumption : 0.30
% 6.97/2.64 Abstraction : 0.03
% 6.97/2.64 MUC search : 0.00
% 6.97/2.64 Cooper : 0.00
% 6.97/2.64 Total : 1.62
% 6.97/2.64 Index Insertion : 0.00
% 6.97/2.64 Index Deletion : 0.00
% 6.97/2.64 Index Matching : 0.00
% 6.97/2.64 BG Taut test : 0.00
%------------------------------------------------------------------------------