TSTP Solution File: NUM845+2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : NUM845+2 : 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 : n032.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:53 EDT 2023
% Result : Theorem 5.57s 2.36s
% Output : CNFRefutation 5.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 11
% Syntax : Number of formulae : 28 ( 19 unt; 6 typ; 0 def)
% Number of atoms : 25 ( 24 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 6 ( 3 ~; 0 |; 2 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 5 ( 3 >; 2 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 32 (; 32 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ vplus > vmul > #nlpp > vsucc > vd411 > v1 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(vplus,type,
vplus: ( $i * $i ) > $i ).
tff(vsucc,type,
vsucc: $i > $i ).
tff('#skF_1',type,
'#skF_1': $i ).
tff(vd411,type,
vd411: $i ).
tff(v1,type,
v1: $i ).
tff(vmul,type,
vmul: ( $i * $i ) > $i ).
tff(f_71,axiom,
! [Vd78,Vd79] : ( vplus(Vd79,Vd78) = vplus(Vd78,Vd79) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ass(cond(61,0),0)) ).
tff(f_79,axiom,
! [Vd42,Vd43] :
( ( vplus(Vd42,vsucc(Vd43)) = vsucc(vplus(Vd42,Vd43)) )
& ( vplus(Vd42,v1) = vsucc(Vd42) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',qu(cond(conseq(axiom(3)),3),and(holds(definiens(29),45,0),holds(definiens(29),44,0)))) ).
tff(f_32,negated_conjecture,
~ ! [Vd416] :
( ( vmul(vsucc(vd411),Vd416) = vplus(vmul(vd411,Vd416),Vd416) )
=> ( vmul(vsucc(vd411),vsucc(Vd416)) = vplus(vmul(vd411,vsucc(Vd416)),vsucc(Vd416)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',qu(ind(267),imp(267))) ).
tff(f_69,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_75,axiom,
! [Vd46,Vd47,Vd48] : ( vplus(vplus(Vd46,Vd47),Vd48) = vplus(Vd46,vplus(Vd47,Vd48)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ass(cond(33,0),0)) ).
tff(c_28,plain,
! [Vd79_12,Vd78_11] : ( vplus(Vd79_12,Vd78_11) = vplus(Vd78_11,Vd79_12) ),
inference(cnfTransformation,[status(thm)],[f_71]) ).
tff(c_34,plain,
! [Vd42_17,Vd43_18] : ( vplus(Vd42_17,vsucc(Vd43_18)) = vsucc(vplus(Vd42_17,Vd43_18)) ),
inference(cnfTransformation,[status(thm)],[f_79]) ).
tff(c_2,plain,
vplus(vmul(vd411,vsucc('#skF_1')),vsucc('#skF_1')) != vmul(vsucc(vd411),vsucc('#skF_1')),
inference(cnfTransformation,[status(thm)],[f_32]) ).
tff(c_46,plain,
vsucc(vplus('#skF_1',vmul(vd411,vsucc('#skF_1')))) != vmul(vsucc(vd411),vsucc('#skF_1')),
inference(demodulation,[status(thm),theory(equality)],[c_28,c_34,c_2]) ).
tff(c_186,plain,
! [Vd396_26,Vd397_27] : ( vplus(vmul(Vd396_26,Vd397_27),Vd396_26) = vmul(Vd396_26,vsucc(Vd397_27)) ),
inference(cnfTransformation,[status(thm)],[f_69]) ).
tff(c_214,plain,
! [Vd79_12,Vd397_27] : ( vplus(Vd79_12,vmul(Vd79_12,Vd397_27)) = vmul(Vd79_12,vsucc(Vd397_27)) ),
inference(superposition,[status(thm),theory(equality)],[c_28,c_186]) ).
tff(c_153,plain,
! [Vd42_24,Vd43_25] : ( vplus(Vd42_24,vsucc(Vd43_25)) = vsucc(vplus(Vd42_24,Vd43_25)) ),
inference(cnfTransformation,[status(thm)],[f_79]) ).
tff(c_159,plain,
! [Vd43_25,Vd42_24] : ( vplus(vsucc(Vd43_25),Vd42_24) = vsucc(vplus(Vd42_24,Vd43_25)) ),
inference(superposition,[status(thm),theory(equality)],[c_153,c_28]) ).
tff(c_397,plain,
! [Vd46_34,Vd47_35,Vd48_36] : ( vplus(vplus(Vd46_34,Vd47_35),Vd48_36) = vplus(Vd46_34,vplus(Vd47_35,Vd48_36)) ),
inference(cnfTransformation,[status(thm)],[f_75]) ).
tff(c_468,plain,
! [Vd79_12,Vd46_34,Vd47_35] : ( vplus(Vd79_12,vplus(Vd46_34,Vd47_35)) = vplus(Vd46_34,vplus(Vd47_35,Vd79_12)) ),
inference(superposition,[status(thm),theory(equality)],[c_28,c_397]) ).
tff(c_4,plain,
vplus(vmul(vd411,'#skF_1'),'#skF_1') = vmul(vsucc(vd411),'#skF_1'),
inference(cnfTransformation,[status(thm)],[f_32]) ).
tff(c_441,plain,
! [Vd48_36] : ( vplus(vmul(vsucc(vd411),'#skF_1'),Vd48_36) = vplus(vmul(vd411,'#skF_1'),vplus('#skF_1',Vd48_36)) ),
inference(superposition,[status(thm),theory(equality)],[c_4,c_397]) ).
tff(c_2742,plain,
! [Vd48_59] : ( vplus(vmul(vsucc(vd411),'#skF_1'),Vd48_59) = vplus('#skF_1',vplus(Vd48_59,vmul(vd411,'#skF_1'))) ),
inference(demodulation,[status(thm),theory(equality)],[c_468,c_441]) ).
tff(c_24,plain,
! [Vd396_9,Vd397_10] : ( vplus(vmul(Vd396_9,Vd397_10),Vd396_9) = vmul(Vd396_9,vsucc(Vd397_10)) ),
inference(cnfTransformation,[status(thm)],[f_69]) ).
tff(c_2837,plain,
vplus('#skF_1',vplus(vsucc(vd411),vmul(vd411,'#skF_1'))) = vmul(vsucc(vd411),vsucc('#skF_1')),
inference(superposition,[status(thm),theory(equality)],[c_2742,c_24]) ).
tff(c_2930,plain,
vsucc(vplus('#skF_1',vmul(vd411,vsucc('#skF_1')))) = vmul(vsucc(vd411),vsucc('#skF_1')),
inference(demodulation,[status(thm),theory(equality)],[c_214,c_34,c_28,c_159,c_2837]) ).
tff(c_2932,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_46,c_2930]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUM845+2 : TPTP v8.1.2. Released v4.1.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.12/0.33 % Computer : n032.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Thu Aug 3 15:06:51 EDT 2023
% 0.12/0.33 % CPUTime :
% 5.57/2.36 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.57/2.37
% 5.57/2.37 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 5.57/2.40
% 5.57/2.40 Inference rules
% 5.57/2.40 ----------------------
% 5.57/2.40 #Ref : 0
% 5.57/2.40 #Sup : 726
% 5.57/2.40 #Fact : 0
% 5.57/2.40 #Define : 0
% 5.57/2.40 #Split : 0
% 5.57/2.40 #Chain : 0
% 5.57/2.40 #Close : 0
% 5.57/2.40
% 5.57/2.40 Ordering : KBO
% 5.57/2.40
% 5.57/2.40 Simplification rules
% 5.57/2.40 ----------------------
% 5.57/2.40 #Subsume : 78
% 5.57/2.40 #Demod : 709
% 5.57/2.40 #Tautology : 189
% 5.57/2.40 #SimpNegUnit : 1
% 5.57/2.40 #BackRed : 0
% 5.57/2.40
% 5.57/2.40 #Partial instantiations: 0
% 5.57/2.40 #Strategies tried : 1
% 5.57/2.40
% 5.57/2.40 Timing (in seconds)
% 5.57/2.40 ----------------------
% 5.57/2.40 Preprocessing : 0.51
% 5.57/2.40 Parsing : 0.28
% 5.57/2.40 CNF conversion : 0.03
% 5.57/2.40 Main loop : 0.86
% 5.57/2.40 Inferencing : 0.23
% 5.57/2.40 Reduction : 0.44
% 5.57/2.40 Demodulation : 0.38
% 5.57/2.40 BG Simplification : 0.04
% 5.57/2.40 Subsumption : 0.12
% 5.57/2.40 Abstraction : 0.04
% 5.57/2.40 MUC search : 0.00
% 5.57/2.40 Cooper : 0.00
% 5.57/2.40 Total : 1.43
% 5.57/2.40 Index Insertion : 0.00
% 5.57/2.40 Index Deletion : 0.00
% 5.57/2.40 Index Matching : 0.00
% 5.57/2.40 BG Taut test : 0.00
%------------------------------------------------------------------------------