TSTP Solution File: NUM848+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : NUM848+1 : TPTP v8.1.2. Released v4.1.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 : n026.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:52:54 EDT 2023
% Result : Theorem 54.40s 38.72s
% Output : CNFRefutation 54.51s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 21
% Syntax : Number of formulae : 32 ( 15 unt; 16 typ; 0 def)
% Number of atoms : 17 ( 16 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 5 ( 4 ~; 0 |; 1 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 22 ( 12 >; 10 *; 0 +; 0 <<)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 4 con; 0-2 aty)
% Number of variables : 10 (; 10 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ less > leq > greater > geq > vplus > vmul > #nlpp > vsucc > vskolem2 > vd439 > vd437 > vd436 > v1 > #skF_3 > #skF_2 > #skF_1 > #skF_4
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(greater,type,
greater: ( $i * $i ) > $o ).
tff(vd439,type,
vd439: $i ).
tff(vplus,type,
vplus: ( $i * $i ) > $i ).
tff(vd437,type,
vd437: $i ).
tff('#skF_3',type,
'#skF_3': ( $i * $i ) > $i ).
tff(less,type,
less: ( $i * $i ) > $o ).
tff(vskolem2,type,
vskolem2: $i > $i ).
tff(vsucc,type,
vsucc: $i > $i ).
tff(v1,type,
v1: $i ).
tff(geq,type,
geq: ( $i * $i ) > $o ).
tff(vmul,type,
vmul: ( $i * $i ) > $i ).
tff(leq,type,
leq: ( $i * $i ) > $o ).
tff('#skF_2',type,
'#skF_2': ( $i * $i ) > $i ).
tff(vd436,type,
vd436: $i ).
tff('#skF_1',type,
'#skF_1': ( $i * $i ) > $i ).
tff('#skF_4',type,
'#skF_4': ( $i * $i ) > $i ).
tff(f_230,axiom,
! [Vd78,Vd79] : ( vplus(Vd79,Vd78) = vplus(Vd78,Vd79) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ass(cond(61,0),0)) ).
tff(f_46,axiom,
! [Vd396,Vd397] :
( ( vmul(Vd396,vsucc(Vd397)) = vplus(vmul(Vd396,Vd397),Vd396) )
& ( vmul(Vd396,v1) = Vd396 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',qu(cond(conseq(axiom(3)),32),and(holds(definiens(249),399,0),holds(definiens(249),398,0)))) ).
tff(f_33,axiom,
vmul(vd436,vplus(vd437,vd439)) = vplus(vmul(vd436,vd437),vmul(vd436,vd439)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',holds(285,440,0)) ).
tff(f_29,axiom,
vplus(vplus(vmul(vd436,vd437),vmul(vd436,vd439)),vd436) = vplus(vmul(vd436,vd437),vplus(vmul(vd436,vd439),vd436)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',holds(286,441,3)) ).
tff(f_28,negated_conjecture,
vplus(vmul(vd436,vd437),vplus(vmul(vd436,vd439),vd436)) != vplus(vmul(vd436,vd437),vmul(vd436,vsucc(vd439))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',holds(286,441,4)) ).
tff(c_115,plain,
! [Vd79_109,Vd78_108] : ( vplus(Vd79_109,Vd78_108) = vplus(Vd78_108,Vd79_109) ),
inference(cnfTransformation,[status(thm)],[f_230]) ).
tff(c_1938,plain,
! [Vd396_271,Vd397_272] : ( vplus(vmul(Vd396_271,Vd397_272),Vd396_271) = vmul(Vd396_271,vsucc(Vd397_272)) ),
inference(cnfTransformation,[status(thm)],[f_46]) ).
tff(c_2062,plain,
! [Vd78_108,Vd397_272] : ( vplus(Vd78_108,vmul(Vd78_108,Vd397_272)) = vmul(Vd78_108,vsucc(Vd397_272)) ),
inference(superposition,[status(thm),theory(equality)],[c_115,c_1938]) ).
tff(c_12,plain,
vplus(vmul(vd436,vd437),vmul(vd436,vd439)) = vmul(vd436,vplus(vd437,vd439)),
inference(cnfTransformation,[status(thm)],[f_33]) ).
tff(c_4,plain,
vplus(vplus(vmul(vd436,vd437),vmul(vd436,vd439)),vd436) = vplus(vmul(vd436,vd437),vplus(vmul(vd436,vd439),vd436)),
inference(cnfTransformation,[status(thm)],[f_29]) ).
tff(c_146,plain,
vplus(vmul(vd436,vd437),vplus(vd436,vmul(vd436,vd439))) = vplus(vd436,vmul(vd436,vplus(vd437,vd439))),
inference(demodulation,[status(thm),theory(equality)],[c_12,c_115,c_115,c_4]) ).
tff(c_2,plain,
vplus(vmul(vd436,vd437),vplus(vmul(vd436,vd439),vd436)) != vplus(vmul(vd436,vd437),vmul(vd436,vsucc(vd439))),
inference(cnfTransformation,[status(thm)],[f_28]) ).
tff(c_147,plain,
vplus(vmul(vd436,vd437),vmul(vd436,vsucc(vd439))) != vplus(vd436,vmul(vd436,vplus(vd437,vd439))),
inference(demodulation,[status(thm),theory(equality)],[c_146,c_115,c_2]) ).
tff(c_28051,plain,
vplus(vmul(vd436,vd437),vmul(vd436,vsucc(vd439))) != vmul(vd436,vsucc(vplus(vd437,vd439))),
inference(demodulation,[status(thm),theory(equality)],[c_2062,c_147]) ).
tff(c_28050,plain,
vplus(vmul(vd436,vd437),vmul(vd436,vsucc(vd439))) = vmul(vd436,vsucc(vplus(vd437,vd439))),
inference(demodulation,[status(thm),theory(equality)],[c_2062,c_2062,c_146]) ).
tff(c_176623,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_28051,c_28050]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : NUM848+1 : TPTP v8.1.2. Released v4.1.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.35 % Computer : n026.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 15:27:31 EDT 2023
% 0.14/0.35 % CPUTime :
% 54.40/38.72 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 54.40/38.73
% 54.40/38.73 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 54.51/38.76
% 54.51/38.76 Inference rules
% 54.51/38.76 ----------------------
% 54.51/38.76 #Ref : 28
% 54.51/38.76 #Sup : 47311
% 54.51/38.76 #Fact : 8
% 54.51/38.76 #Define : 0
% 54.51/38.76 #Split : 3
% 54.51/38.76 #Chain : 0
% 54.51/38.76 #Close : 0
% 54.51/38.76
% 54.51/38.76 Ordering : KBO
% 54.51/38.76
% 54.51/38.76 Simplification rules
% 54.51/38.76 ----------------------
% 54.51/38.76 #Subsume : 12063
% 54.51/38.76 #Demod : 12294
% 54.51/38.76 #Tautology : 5819
% 54.51/38.76 #SimpNegUnit : 1666
% 54.51/38.76 #BackRed : 10
% 54.51/38.76
% 54.51/38.76 #Partial instantiations: 0
% 54.51/38.76 #Strategies tried : 1
% 54.51/38.76
% 54.51/38.76 Timing (in seconds)
% 54.51/38.76 ----------------------
% 54.55/38.76 Preprocessing : 0.65
% 54.55/38.76 Parsing : 0.34
% 54.55/38.76 CNF conversion : 0.04
% 54.55/38.76 Main loop : 37.02
% 54.55/38.76 Inferencing : 3.02
% 54.55/38.76 Reduction : 17.58
% 54.55/38.76 Demodulation : 11.88
% 54.55/38.76 BG Simplification : 0.26
% 54.55/38.76 Subsumption : 12.57
% 54.55/38.76 Abstraction : 0.31
% 54.55/38.76 MUC search : 0.00
% 54.55/38.76 Cooper : 0.00
% 54.55/38.76 Total : 37.71
% 54.55/38.76 Index Insertion : 0.00
% 54.55/38.76 Index Deletion : 0.00
% 54.55/38.76 Index Matching : 0.00
% 54.55/38.76 BG Taut test : 0.00
%------------------------------------------------------------------------------