TSTP Solution File: NUM432+3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : NUM432+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 : n004.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:39 EDT 2023
% Result : Theorem 4.56s 2.15s
% Output : CNFRefutation 4.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 22
% Syntax : Number of formulae : 31 ( 6 unt; 17 typ; 0 def)
% Number of atoms : 26 ( 7 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 22 ( 10 ~; 7 |; 4 &)
% ( 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 : 13 ( 7 >; 6 *; 0 +; 0 <<)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 14 ( 14 usr; 10 con; 0-2 aty)
% Number of variables : 7 (; 6 !; 1 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ sdteqdtlpzmzozddtrp0 > aDivisorOf0 > aInteger0 > sdtpldt0 > sdtasdt0 > #nlpp > smndt0 > xq > xn > xm > xc > xb > xa > sz10 > sz00 > #skF_2 > #skF_3 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(aInteger0,type,
aInteger0: $i > $o ).
tff(xq,type,
xq: $i ).
tff(sdtasdt0,type,
sdtasdt0: ( $i * $i ) > $i ).
tff(xa,type,
xa: $i ).
tff(sz10,type,
sz10: $i ).
tff(sz00,type,
sz00: $i ).
tff(xc,type,
xc: $i ).
tff(sdtpldt0,type,
sdtpldt0: ( $i * $i ) > $i ).
tff(smndt0,type,
smndt0: $i > $i ).
tff('#skF_2',type,
'#skF_2': $i ).
tff('#skF_3',type,
'#skF_3': $i ).
tff(xb,type,
xb: $i ).
tff(aDivisorOf0,type,
aDivisorOf0: ( $i * $i ) > $o ).
tff(xm,type,
xm: $i ).
tff(xn,type,
xn: $i ).
tff(sdteqdtlpzmzozddtrp0,type,
sdteqdtlpzmzozddtrp0: ( $i * $i * $i ) > $o ).
tff('#skF_1',type,
'#skF_1': ( $i * $i ) > $i ).
tff(f_205,hypothesis,
( aInteger0(xn)
& ( sdtasdt0(xq,xn) = sdtpldt0(xa,smndt0(xb)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__876) ).
tff(f_208,hypothesis,
( aInteger0(xm)
& ( sdtasdt0(xq,xm) = sdtpldt0(xb,smndt0(xc)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__899) ).
tff(f_41,axiom,
! [W0,W1] :
( ( aInteger0(W0)
& aInteger0(W1) )
=> aInteger0(sdtpldt0(W0,W1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mIntPlus) ).
tff(f_209,hypothesis,
sdtasdt0(xq,sdtpldt0(xn,xm)) = sdtpldt0(xa,smndt0(xc)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__924) ).
tff(f_218,negated_conjecture,
~ ( ? [W0] :
( aInteger0(W0)
& ( sdtasdt0(xq,W0) = sdtpldt0(xa,smndt0(xc)) ) )
| aDivisorOf0(xq,sdtpldt0(xa,smndt0(xc)))
| sdteqdtlpzmzozddtrp0(xa,xc,xq) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
tff(c_94,plain,
aInteger0(xn),
inference(cnfTransformation,[status(thm)],[f_205]) ).
tff(c_98,plain,
aInteger0(xm),
inference(cnfTransformation,[status(thm)],[f_208]) ).
tff(c_1043,plain,
! [W0_64,W1_65] :
( aInteger0(sdtpldt0(W0_64,W1_65))
| ~ aInteger0(W1_65)
| ~ aInteger0(W0_64) ),
inference(cnfTransformation,[status(thm)],[f_41]) ).
tff(c_100,plain,
sdtpldt0(xa,smndt0(xc)) = sdtasdt0(xq,sdtpldt0(xn,xm)),
inference(cnfTransformation,[status(thm)],[f_209]) ).
tff(c_106,plain,
! [W0_45] :
( ( sdtpldt0(xa,smndt0(xc)) != sdtasdt0(xq,W0_45) )
| ~ aInteger0(W0_45) ),
inference(cnfTransformation,[status(thm)],[f_218]) ).
tff(c_107,plain,
! [W0_45] :
( ( sdtasdt0(xq,sdtpldt0(xn,xm)) != sdtasdt0(xq,W0_45) )
| ~ aInteger0(W0_45) ),
inference(demodulation,[status(thm),theory(equality)],[c_100,c_106]) ).
tff(c_239,plain,
~ aInteger0(sdtpldt0(xn,xm)),
inference(reflexivity,[status(thm),theory(equality)],[c_107]) ).
tff(c_1055,plain,
( ~ aInteger0(xm)
| ~ aInteger0(xn) ),
inference(resolution,[status(thm)],[c_1043,c_239]) ).
tff(c_1140,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_94,c_98,c_1055]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUM432+3 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.13 % 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.13/0.35 % Computer : n004.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu Aug 3 14:40:11 EDT 2023
% 0.13/0.35 % CPUTime :
% 4.56/2.15 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.56/2.15
% 4.56/2.15 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.56/2.18
% 4.56/2.18 Inference rules
% 4.56/2.18 ----------------------
% 4.56/2.18 #Ref : 1
% 4.56/2.18 #Sup : 307
% 4.56/2.18 #Fact : 0
% 4.56/2.18 #Define : 0
% 4.56/2.18 #Split : 0
% 4.56/2.18 #Chain : 0
% 4.56/2.18 #Close : 0
% 4.56/2.18
% 4.56/2.18 Ordering : KBO
% 4.56/2.18
% 4.56/2.18 Simplification rules
% 4.56/2.18 ----------------------
% 4.56/2.18 #Subsume : 2
% 4.56/2.18 #Demod : 154
% 4.56/2.18 #Tautology : 194
% 4.56/2.18 #SimpNegUnit : 0
% 4.56/2.18 #BackRed : 0
% 4.56/2.18
% 4.56/2.18 #Partial instantiations: 0
% 4.56/2.18 #Strategies tried : 1
% 4.56/2.18
% 4.56/2.18 Timing (in seconds)
% 4.56/2.18 ----------------------
% 4.56/2.18 Preprocessing : 0.60
% 4.56/2.18 Parsing : 0.31
% 4.56/2.18 CNF conversion : 0.04
% 4.56/2.18 Main loop : 0.52
% 4.56/2.18 Inferencing : 0.18
% 4.56/2.18 Reduction : 0.18
% 4.56/2.18 Demodulation : 0.12
% 4.56/2.18 BG Simplification : 0.03
% 4.56/2.18 Subsumption : 0.10
% 4.56/2.18 Abstraction : 0.02
% 4.56/2.18 MUC search : 0.00
% 4.56/2.18 Cooper : 0.00
% 4.56/2.18 Total : 1.17
% 4.56/2.18 Index Insertion : 0.00
% 4.56/2.18 Index Deletion : 0.00
% 4.56/2.18 Index Matching : 0.00
% 4.56/2.18 BG Taut test : 0.00
%------------------------------------------------------------------------------