TSTP Solution File: NUM430+3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : NUM430+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/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 : n012.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 3.35s 1.77s
% Output : CNFRefutation 3.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 18
% Syntax : Number of formulae : 23 ( 3 unt; 16 typ; 0 def)
% Number of atoms : 17 ( 6 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 15 ( 5 ~; 2 |; 8 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 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 : 13 ( 13 usr; 9 con; 0-2 aty)
% Number of variables : 5 (; 2 !; 3 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ sdteqdtlpzmzozddtrp0 > aDivisorOf0 > aInteger0 > sdtpldt0 > sdtasdt0 > #nlpp > smndt0 > xq > xn > 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(xn,type,
xn: $i ).
tff(sdteqdtlpzmzozddtrp0,type,
sdteqdtlpzmzozddtrp0: ( $i * $i * $i ) > $o ).
tff('#skF_1',type,
'#skF_1': ( $i * $i ) > $i ).
tff(f_202,hypothesis,
( ? [W0] :
( aInteger0(W0)
& ( sdtasdt0(xq,W0) = sdtpldt0(xa,smndt0(xb)) ) )
& aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))
& sdteqdtlpzmzozddtrp0(xa,xb,xq)
& ? [W0] :
( aInteger0(W0)
& ( sdtasdt0(xq,W0) = sdtpldt0(xb,smndt0(xc)) ) )
& aDivisorOf0(xq,sdtpldt0(xb,smndt0(xc)))
& sdteqdtlpzmzozddtrp0(xb,xc,xq) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__853) ).
tff(f_210,negated_conjecture,
~ ? [W0] :
( aInteger0(W0)
& ( sdtasdt0(xq,W0) = sdtpldt0(xb,smndt0(xc)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
tff(c_82,plain,
aInteger0('#skF_2'),
inference(cnfTransformation,[status(thm)],[f_202]) ).
tff(c_80,plain,
sdtpldt0(xb,smndt0(xc)) = sdtasdt0(xq,'#skF_2'),
inference(cnfTransformation,[status(thm)],[f_202]) ).
tff(c_96,plain,
! [W0_45] :
( ( sdtpldt0(xb,smndt0(xc)) != sdtasdt0(xq,W0_45) )
| ~ aInteger0(W0_45) ),
inference(cnfTransformation,[status(thm)],[f_210]) ).
tff(c_101,plain,
! [W0_46] :
( ( sdtasdt0(xq,W0_46) != sdtasdt0(xq,'#skF_2') )
| ~ aInteger0(W0_46) ),
inference(demodulation,[status(thm),theory(equality)],[c_80,c_96]) ).
tff(c_132,plain,
$false,
inference(resolution,[status(thm)],[c_82,c_101]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : NUM430+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/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.14/0.35 % Computer : n012.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu Aug 3 14:35:37 EDT 2023
% 0.14/0.35 % CPUTime :
% 3.35/1.77 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.52/1.78
% 3.52/1.78 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.52/1.80
% 3.52/1.80 Inference rules
% 3.52/1.80 ----------------------
% 3.52/1.80 #Ref : 0
% 3.52/1.80 #Sup : 8
% 3.52/1.80 #Fact : 0
% 3.52/1.80 #Define : 0
% 3.52/1.80 #Split : 0
% 3.52/1.80 #Chain : 0
% 3.52/1.80 #Close : 0
% 3.52/1.80
% 3.52/1.80 Ordering : KBO
% 3.52/1.80
% 3.52/1.80 Simplification rules
% 3.52/1.80 ----------------------
% 3.52/1.80 #Subsume : 0
% 3.52/1.80 #Demod : 4
% 3.52/1.80 #Tautology : 1
% 3.52/1.80 #SimpNegUnit : 0
% 3.52/1.80 #BackRed : 0
% 3.52/1.80
% 3.52/1.80 #Partial instantiations: 0
% 3.52/1.80 #Strategies tried : 1
% 3.52/1.80
% 3.52/1.80 Timing (in seconds)
% 3.52/1.80 ----------------------
% 3.52/1.80 Preprocessing : 0.57
% 3.52/1.80 Parsing : 0.29
% 3.52/1.80 CNF conversion : 0.04
% 3.52/1.80 Main loop : 0.20
% 3.52/1.80 Inferencing : 0.04
% 3.52/1.80 Reduction : 0.08
% 3.52/1.80 Demodulation : 0.06
% 3.52/1.80 BG Simplification : 0.02
% 3.52/1.80 Subsumption : 0.05
% 3.52/1.80 Abstraction : 0.01
% 3.52/1.80 MUC search : 0.00
% 3.52/1.80 Cooper : 0.00
% 3.52/1.80 Total : 0.81
% 3.52/1.80 Index Insertion : 0.00
% 3.52/1.80 Index Deletion : 0.00
% 3.52/1.80 Index Matching : 0.00
% 3.52/1.80 BG Taut test : 0.00
%------------------------------------------------------------------------------