TSTP Solution File: NUM849+2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : NUM849+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/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 : n006.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 4.40s 2.18s
% Output : CNFRefutation 4.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 12
% Syntax : Number of formulae : 26 ( 18 unt; 7 typ; 0 def)
% Number of atoms : 20 ( 19 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 4 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 4 ( 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 : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 24 (; 24 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ vplus > vmul > #nlpp > vsucc > vd449 > vd448 > v1 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(vd449,type,
vd449: $i ).
tff(vplus,type,
vplus: ( $i * $i ) > $i ).
tff(vsucc,type,
vsucc: $i > $i ).
tff('#skF_1',type,
'#skF_1': $i ).
tff(v1,type,
v1: $i ).
tff(vmul,type,
vmul: ( $i * $i ) > $i ).
tff(vd448,type,
vd448: $i ).
tff(f_53,axiom,
! [Vd418,Vd419] : ( vmul(Vd418,Vd419) = vmul(Vd419,Vd418) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ass(cond(270,0),0)) ).
tff(f_32,negated_conjecture,
~ ! [Vd454] :
( ( vmul(vmul(vd448,vd449),Vd454) = vmul(vd448,vmul(vd449,Vd454)) )
=> ( vmul(vmul(vd448,vd449),vsucc(Vd454)) = vmul(vd448,vmul(vd449,vsucc(Vd454))) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',qu(ind(296),imp(296))) ).
tff(f_55,axiom,
! [Vd408,Vd409] : ( vmul(vsucc(Vd408),Vd409) = vplus(vmul(Vd408,Vd409),Vd409) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ass(cond(261,0),0)) ).
tff(f_61,axiom,
! [Vd78,Vd79] : ( vplus(Vd79,Vd78) = vplus(Vd78,Vd79) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ass(cond(61,0),0)) ).
tff(f_51,axiom,
! [Vd432,Vd433,Vd434] : ( vmul(Vd432,vplus(Vd433,Vd434)) = vplus(vmul(Vd432,Vd433),vmul(Vd432,Vd434)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ass(cond(281,0),0)) ).
tff(c_18,plain,
! [Vd419_9,Vd418_8] : ( vmul(Vd419_9,Vd418_8) = vmul(Vd418_8,Vd419_9) ),
inference(cnfTransformation,[status(thm)],[f_53]) ).
tff(c_2,plain,
vmul(vmul(vd448,vd449),vsucc('#skF_1')) != vmul(vd448,vmul(vd449,vsucc('#skF_1'))),
inference(cnfTransformation,[status(thm)],[f_32]) ).
tff(c_37,plain,
vmul(vsucc('#skF_1'),vmul(vd448,vd449)) != vmul(vd448,vmul(vd449,vsucc('#skF_1'))),
inference(demodulation,[status(thm),theory(equality)],[c_18,c_2]) ).
tff(c_506,plain,
! [Vd408_34,Vd409_35] : ( vplus(vmul(Vd408_34,Vd409_35),Vd409_35) = vmul(vsucc(Vd408_34),Vd409_35) ),
inference(cnfTransformation,[status(thm)],[f_55]) ).
tff(c_26,plain,
! [Vd79_15,Vd78_14] : ( vplus(Vd79_15,Vd78_14) = vplus(Vd78_14,Vd79_15) ),
inference(cnfTransformation,[status(thm)],[f_61]) ).
tff(c_523,plain,
! [Vd409_35,Vd408_34] : ( vplus(Vd409_35,vmul(Vd408_34,Vd409_35)) = vmul(vsucc(Vd408_34),Vd409_35) ),
inference(superposition,[status(thm),theory(equality)],[c_506,c_26]) ).
tff(c_4,plain,
vmul(vmul(vd448,vd449),'#skF_1') = vmul(vd448,vmul(vd449,'#skF_1')),
inference(cnfTransformation,[status(thm)],[f_32]) ).
tff(c_36,plain,
vmul(vd448,vmul('#skF_1',vd449)) = vmul('#skF_1',vmul(vd448,vd449)),
inference(demodulation,[status(thm),theory(equality)],[c_18,c_18,c_4]) ).
tff(c_891,plain,
! [Vd432_44,Vd433_45,Vd434_46] : ( vplus(vmul(Vd432_44,Vd433_45),vmul(Vd432_44,Vd434_46)) = vmul(Vd432_44,vplus(Vd433_45,Vd434_46)) ),
inference(cnfTransformation,[status(thm)],[f_51]) ).
tff(c_2028,plain,
! [Vd434_59] : ( vplus(vmul('#skF_1',vmul(vd448,vd449)),vmul(vd448,Vd434_59)) = vmul(vd448,vplus(vmul('#skF_1',vd449),Vd434_59)) ),
inference(superposition,[status(thm),theory(equality)],[c_36,c_891]) ).
tff(c_20,plain,
! [Vd408_10,Vd409_11] : ( vplus(vmul(Vd408_10,Vd409_11),Vd409_11) = vmul(vsucc(Vd408_10),Vd409_11) ),
inference(cnfTransformation,[status(thm)],[f_55]) ).
tff(c_2053,plain,
vmul(vsucc('#skF_1'),vmul(vd448,vd449)) = vmul(vd448,vplus(vmul('#skF_1',vd449),vd449)),
inference(superposition,[status(thm),theory(equality)],[c_2028,c_20]) ).
tff(c_2116,plain,
vmul(vsucc('#skF_1'),vmul(vd448,vd449)) = vmul(vd448,vmul(vd449,vsucc('#skF_1'))),
inference(demodulation,[status(thm),theory(equality)],[c_18,c_523,c_26,c_2053]) ).
tff(c_2118,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_37,c_2116]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : NUM849+2 : TPTP v8.1.2. Released v4.1.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.15/0.36 % Computer : n006.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Thu Aug 3 15:17:13 EDT 2023
% 0.15/0.36 % CPUTime :
% 4.40/2.18 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.40/2.18
% 4.40/2.18 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 4.40/2.21
% 4.40/2.21 Inference rules
% 4.40/2.21 ----------------------
% 4.40/2.21 #Ref : 0
% 4.40/2.21 #Sup : 520
% 4.40/2.21 #Fact : 0
% 4.40/2.21 #Define : 0
% 4.40/2.21 #Split : 0
% 4.40/2.21 #Chain : 0
% 4.40/2.21 #Close : 0
% 4.40/2.21
% 4.40/2.21 Ordering : KBO
% 4.40/2.21
% 4.40/2.21 Simplification rules
% 4.40/2.21 ----------------------
% 4.40/2.21 #Subsume : 47
% 4.40/2.21 #Demod : 490
% 4.40/2.21 #Tautology : 230
% 4.40/2.21 #SimpNegUnit : 1
% 4.40/2.21 #BackRed : 0
% 4.40/2.21
% 4.40/2.21 #Partial instantiations: 0
% 4.40/2.21 #Strategies tried : 1
% 4.40/2.21
% 4.40/2.21 Timing (in seconds)
% 4.40/2.21 ----------------------
% 4.40/2.22 Preprocessing : 0.50
% 4.40/2.22 Parsing : 0.27
% 4.40/2.22 CNF conversion : 0.03
% 4.40/2.22 Main loop : 0.66
% 4.40/2.22 Inferencing : 0.20
% 4.40/2.22 Reduction : 0.29
% 4.40/2.22 Demodulation : 0.24
% 4.40/2.22 BG Simplification : 0.03
% 4.40/2.22 Subsumption : 0.11
% 4.40/2.22 Abstraction : 0.03
% 4.40/2.22 MUC search : 0.00
% 4.40/2.22 Cooper : 0.00
% 4.40/2.22 Total : 1.20
% 4.40/2.22 Index Insertion : 0.00
% 4.40/2.22 Index Deletion : 0.00
% 4.40/2.22 Index Matching : 0.00
% 4.40/2.22 BG Taut test : 0.00
%------------------------------------------------------------------------------