TSTP Solution File: NUM852+2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : NUM852+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 : n021.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:55 EDT 2023
% Result : Theorem 9.09s 3.24s
% Output : CNFRefutation 9.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 16
% Syntax : Number of formulae : 27 ( 13 unt; 11 typ; 0 def)
% Number of atoms : 19 ( 6 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 9 ( 6 ~; 2 |; 0 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 15 ( 8 >; 7 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-2 aty)
% Number of variables : 23 (; 22 !; 1 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ less > greater > vskolem9 > vplus > vmul > #nlpp > vsucc > vd481 > vd480 > vd469 > #skF_2 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(greater,type,
greater: ( $i * $i ) > $o ).
tff(vskolem9,type,
vskolem9: ( $i * $i ) > $i ).
tff(vd480,type,
vd480: $i ).
tff(vd481,type,
vd481: $i ).
tff(vplus,type,
vplus: ( $i * $i ) > $i ).
tff(vd469,type,
vd469: $i ).
tff(less,type,
less: ( $i * $i ) > $o ).
tff(vsucc,type,
vsucc: $i > $i ).
tff(vmul,type,
vmul: ( $i * $i ) > $i ).
tff('#skF_2',type,
'#skF_2': ( $i * $i ) > $i ).
tff('#skF_1',type,
'#skF_1': ( $i * $i ) > $i ).
tff(f_30,axiom,
greater(vd481,vd480),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',holds(conseq_conjunct1(conseq(304)),483,0)) ).
tff(f_101,axiom,
! [Vd193,Vd194] :
( greater(Vd194,Vd193)
<=> ? [Vd196] : ( Vd194 = vplus(Vd193,Vd196) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',def(cond(conseq(axiom(3)),11),1)) ).
tff(f_55,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(f_57,axiom,
! [Vd418,Vd419] : ( vmul(Vd418,Vd419) = vmul(Vd419,Vd418) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ass(cond(270,0),0)) ).
tff(f_29,negated_conjecture,
~ greater(vmul(vd481,vd469),vmul(vd480,vd469)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',holds(conseq_conjunct1(conseq_conjunct2(conseq(304))),484,0)) ).
tff(c_4,plain,
greater(vd481,vd480),
inference(cnfTransformation,[status(thm)],[f_30]) ).
tff(c_43,plain,
! [Vd193_38,Vd194_39] :
( ( vplus(Vd193_38,'#skF_2'(Vd193_38,Vd194_39)) = Vd194_39 )
| ~ greater(Vd194_39,Vd193_38) ),
inference(cnfTransformation,[status(thm)],[f_101]) ).
tff(c_7692,plain,
! [Vd432_223,Vd433_224,Vd434_225] : ( vplus(vmul(Vd432_223,Vd433_224),vmul(Vd432_223,Vd434_225)) = vmul(Vd432_223,vplus(Vd433_224,Vd434_225)) ),
inference(cnfTransformation,[status(thm)],[f_55]) ).
tff(c_45,plain,
! [Vd193_38,Vd196_42] : greater(vplus(Vd193_38,Vd196_42),Vd193_38),
inference(cnfTransformation,[status(thm)],[f_101]) ).
tff(c_7935,plain,
! [Vd432_235,Vd433_236,Vd434_237] : greater(vmul(Vd432_235,vplus(Vd433_236,Vd434_237)),vmul(Vd432_235,Vd433_236)),
inference(superposition,[status(thm),theory(equality)],[c_7692,c_45]) ).
tff(c_10654,plain,
! [Vd432_287,Vd194_288,Vd193_289] :
( greater(vmul(Vd432_287,Vd194_288),vmul(Vd432_287,Vd193_289))
| ~ greater(Vd194_288,Vd193_289) ),
inference(superposition,[status(thm),theory(equality)],[c_43,c_7935]) ).
tff(c_23,plain,
! [Vd419_18,Vd418_17] : ( vmul(Vd419_18,Vd418_17) = vmul(Vd418_17,Vd419_18) ),
inference(cnfTransformation,[status(thm)],[f_57]) ).
tff(c_2,plain,
~ greater(vmul(vd481,vd469),vmul(vd480,vd469)),
inference(cnfTransformation,[status(thm)],[f_29]) ).
tff(c_49,plain,
~ greater(vmul(vd469,vd481),vmul(vd469,vd480)),
inference(demodulation,[status(thm),theory(equality)],[c_23,c_23,c_2]) ).
tff(c_10683,plain,
~ greater(vd481,vd480),
inference(resolution,[status(thm)],[c_10654,c_49]) ).
tff(c_10764,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_4,c_10683]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUM852+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/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.34 % Computer : n021.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Thu Aug 3 14:40:06 EDT 2023
% 0.14/0.34 % CPUTime :
% 9.09/3.24 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 9.09/3.25
% 9.09/3.25 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 9.09/3.27
% 9.09/3.27 Inference rules
% 9.09/3.27 ----------------------
% 9.09/3.27 #Ref : 0
% 9.09/3.27 #Sup : 2861
% 9.09/3.27 #Fact : 2
% 9.09/3.27 #Define : 0
% 9.09/3.27 #Split : 2
% 9.09/3.27 #Chain : 0
% 9.09/3.27 #Close : 0
% 9.09/3.27
% 9.09/3.27 Ordering : KBO
% 9.09/3.27
% 9.09/3.27 Simplification rules
% 9.09/3.27 ----------------------
% 9.09/3.27 #Subsume : 246
% 9.09/3.27 #Demod : 1424
% 9.09/3.27 #Tautology : 409
% 9.09/3.27 #SimpNegUnit : 5
% 9.09/3.27 #BackRed : 4
% 9.09/3.27
% 9.09/3.27 #Partial instantiations: 0
% 9.09/3.27 #Strategies tried : 1
% 9.09/3.27
% 9.09/3.27 Timing (in seconds)
% 9.09/3.27 ----------------------
% 9.09/3.27 Preprocessing : 0.50
% 9.09/3.27 Parsing : 0.26
% 9.32/3.27 CNF conversion : 0.03
% 9.32/3.27 Main loop : 1.74
% 9.32/3.27 Inferencing : 0.43
% 9.32/3.27 Reduction : 0.92
% 9.32/3.28 Demodulation : 0.79
% 9.32/3.28 BG Simplification : 0.06
% 9.32/3.28 Subsumption : 0.25
% 9.32/3.28 Abstraction : 0.06
% 9.32/3.28 MUC search : 0.00
% 9.32/3.28 Cooper : 0.00
% 9.32/3.28 Total : 2.29
% 9.32/3.28 Index Insertion : 0.00
% 9.32/3.28 Index Deletion : 0.00
% 9.32/3.28 Index Matching : 0.00
% 9.32/3.28 BG Taut test : 0.00
%------------------------------------------------------------------------------