TSTP Solution File: NUM849+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : NUM849+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/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 : n019.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 16.97s 6.49s
% Output : CNFRefutation 16.97s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 21
% Syntax : Number of formulae : 35 ( 18 unt; 16 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 : 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 : 24 (; 24 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ less > leq > greater > geq > vplus > vmul > #nlpp > vsucc > vskolem2 > vd449 > vd448 > v1 > #skF_3 > #skF_1 > #skF_2 > #skF_5 > #skF_4
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(greater,type,
greater: ( $i * $i ) > $o ).
tff(vd449,type,
vd449: $i ).
tff(vplus,type,
vplus: ( $i * $i ) > $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('#skF_1',type,
'#skF_1': $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(vd448,type,
vd448: $i ).
tff('#skF_2',type,
'#skF_2': ( $i * $i ) > $i ).
tff('#skF_5',type,
'#skF_5': ( $i * $i ) > $i ).
tff('#skF_4',type,
'#skF_4': ( $i * $i ) > $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_31,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_245,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_20,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_31]) ).
tff(c_147,plain,
vmul(vsucc('#skF_1'),vmul(vd448,vd449)) != vmul(vd448,vmul(vd449,vsucc('#skF_1'))),
inference(demodulation,[status(thm),theory(equality)],[c_20,c_2]) ).
tff(c_3005,plain,
! [Vd408_325,Vd409_326] : ( vplus(vmul(Vd408_325,Vd409_326),Vd409_326) = vmul(vsucc(Vd408_325),Vd409_326) ),
inference(cnfTransformation,[status(thm)],[f_55]) ).
tff(c_115,plain,
! [Vd79_116,Vd78_115] : ( vplus(Vd79_116,Vd78_115) = vplus(Vd78_115,Vd79_116) ),
inference(cnfTransformation,[status(thm)],[f_245]) ).
tff(c_3107,plain,
! [Vd409_326,Vd408_325] : ( vplus(Vd409_326,vmul(Vd408_325,Vd409_326)) = vmul(vsucc(Vd408_325),Vd409_326) ),
inference(superposition,[status(thm),theory(equality)],[c_3005,c_115]) ).
tff(c_34098,plain,
! [Vd409_961,Vd408_962] : ( vplus(Vd409_961,vmul(Vd408_962,Vd409_961)) = vmul(vsucc(Vd408_962),Vd409_961) ),
inference(superposition,[status(thm),theory(equality)],[c_3005,c_115]) ).
tff(c_4,plain,
vmul(vmul(vd448,vd449),'#skF_1') = vmul(vd448,vmul(vd449,'#skF_1')),
inference(cnfTransformation,[status(thm)],[f_31]) ).
tff(c_146,plain,
vmul(vd448,vmul('#skF_1',vd449)) = vmul('#skF_1',vmul(vd448,vd449)),
inference(demodulation,[status(thm),theory(equality)],[c_20,c_20,c_4]) ).
tff(c_4625,plain,
! [Vd432_381,Vd433_382,Vd434_383] : ( vplus(vmul(Vd432_381,Vd433_382),vmul(Vd432_381,Vd434_383)) = vmul(Vd432_381,vplus(Vd433_382,Vd434_383)) ),
inference(cnfTransformation,[status(thm)],[f_51]) ).
tff(c_4825,plain,
! [Vd433_382] : ( vplus(vmul(vd448,Vd433_382),vmul('#skF_1',vmul(vd448,vd449))) = vmul(vd448,vplus(Vd433_382,vmul('#skF_1',vd449))) ),
inference(superposition,[status(thm),theory(equality)],[c_146,c_4625]) ).
tff(c_34434,plain,
vmul(vsucc('#skF_1'),vmul(vd448,vd449)) = vmul(vd448,vplus(vd449,vmul('#skF_1',vd449))),
inference(superposition,[status(thm),theory(equality)],[c_34098,c_4825]) ).
tff(c_34666,plain,
vmul(vsucc('#skF_1'),vmul(vd448,vd449)) = vmul(vd448,vmul(vd449,vsucc('#skF_1'))),
inference(demodulation,[status(thm),theory(equality)],[c_20,c_3107,c_34434]) ).
tff(c_34668,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_147,c_34666]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : NUM849+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/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.36 % Computer : n019.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Thu Aug 3 15:03:01 EDT 2023
% 0.14/0.36 % CPUTime :
% 16.97/6.49 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 16.97/6.49
% 16.97/6.49 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 16.97/6.52
% 16.97/6.52 Inference rules
% 16.97/6.52 ----------------------
% 16.97/6.52 #Ref : 10
% 16.97/6.52 #Sup : 9227
% 16.97/6.52 #Fact : 2
% 16.97/6.52 #Define : 0
% 16.97/6.52 #Split : 6
% 16.97/6.52 #Chain : 0
% 16.97/6.52 #Close : 0
% 16.97/6.52
% 16.97/6.52 Ordering : KBO
% 16.97/6.52
% 16.97/6.52 Simplification rules
% 16.97/6.52 ----------------------
% 16.97/6.52 #Subsume : 2062
% 16.97/6.52 #Demod : 2240
% 16.97/6.52 #Tautology : 1391
% 16.97/6.52 #SimpNegUnit : 193
% 16.97/6.52 #BackRed : 81
% 16.97/6.52
% 16.97/6.52 #Partial instantiations: 0
% 16.97/6.52 #Strategies tried : 1
% 16.97/6.52
% 16.97/6.52 Timing (in seconds)
% 16.97/6.52 ----------------------
% 16.97/6.52 Preprocessing : 0.64
% 16.97/6.52 Parsing : 0.33
% 16.97/6.52 CNF conversion : 0.05
% 16.97/6.52 Main loop : 4.72
% 16.97/6.52 Inferencing : 0.86
% 16.97/6.52 Reduction : 2.12
% 16.97/6.52 Demodulation : 1.50
% 16.97/6.52 BG Simplification : 0.09
% 16.97/6.52 Subsumption : 1.26
% 16.97/6.52 Abstraction : 0.08
% 16.97/6.52 MUC search : 0.00
% 16.97/6.52 Cooper : 0.00
% 16.97/6.52 Total : 5.40
% 16.97/6.52 Index Insertion : 0.00
% 16.97/6.52 Index Deletion : 0.00
% 16.97/6.52 Index Matching : 0.00
% 16.97/6.52 BG Taut test : 0.00
%------------------------------------------------------------------------------