TSTP Solution File: NUM854+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : NUM854+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 : n010.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:56 EDT 2023
% Result : Theorem 6.03s 2.48s
% Output : CNFRefutation 6.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 20
% Syntax : Number of formulae : 25 ( 6 unt; 17 typ; 0 def)
% Number of atoms : 10 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 6 ( 4 ~; 1 |; 0 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 22 ( 12 >; 10 *; 0 +; 0 <<)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 5 con; 0-2 aty)
% Number of variables : 6 (; 6 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ less > leq > greater > geq > vplus > vmul > #nlpp > vsucc > vskolem2 > vd512 > vd511 > vd509 > vd508 > v1 > #skF_3 > #skF_2 > #skF_1 > #skF_4
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(greater,type,
greater: ( $i * $i ) > $o ).
tff(vd512,type,
vd512: $i ).
tff(vd509,type,
vd509: $i ).
tff(vd511,type,
vd511: $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(vd508,type,
vd508: $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('#skF_1',type,
'#skF_1': ( $i * $i ) > $i ).
tff('#skF_4',type,
'#skF_4': ( $i * $i ) > $i ).
tff(f_30,axiom,
greater(vd508,vd509),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',holds(conjunct1(314),510,0)) ).
tff(f_54,axiom,
! [Vd456,Vd457,Vd458] :
( greater(Vd457,Vd458)
=> greater(vmul(Vd457,Vd456),vmul(Vd458,Vd456)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ass(cond(299,0),2)) ).
tff(f_28,negated_conjecture,
~ greater(vmul(vd508,vd511),vmul(vd509,vd511)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',holds(conjunct1(315),514,0)) ).
tff(c_6,plain,
greater(vd508,vd509),
inference(cnfTransformation,[status(thm)],[f_30]) ).
tff(c_3261,plain,
! [Vd457_358,Vd456_359,Vd458_360] :
( greater(vmul(Vd457_358,Vd456_359),vmul(Vd458_360,Vd456_359))
| ~ greater(Vd457_358,Vd458_360) ),
inference(cnfTransformation,[status(thm)],[f_54]) ).
tff(c_2,plain,
~ greater(vmul(vd508,vd511),vmul(vd509,vd511)),
inference(cnfTransformation,[status(thm)],[f_28]) ).
tff(c_3276,plain,
~ greater(vd508,vd509),
inference(resolution,[status(thm)],[c_3261,c_2]) ).
tff(c_3318,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_6,c_3276]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : NUM854+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.15/0.35 % Computer : n010.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Thu Aug 3 14:56:29 EDT 2023
% 0.15/0.35 % CPUTime :
% 6.03/2.48 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.03/2.48
% 6.03/2.48 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 6.35/2.50
% 6.35/2.50 Inference rules
% 6.35/2.50 ----------------------
% 6.35/2.50 #Ref : 4
% 6.35/2.50 #Sup : 831
% 6.35/2.50 #Fact : 0
% 6.35/2.50 #Define : 0
% 6.35/2.50 #Split : 3
% 6.35/2.50 #Chain : 0
% 6.35/2.50 #Close : 0
% 6.35/2.50
% 6.35/2.50 Ordering : KBO
% 6.35/2.50
% 6.35/2.50 Simplification rules
% 6.35/2.50 ----------------------
% 6.35/2.50 #Subsume : 120
% 6.35/2.50 #Demod : 179
% 6.35/2.50 #Tautology : 224
% 6.35/2.50 #SimpNegUnit : 19
% 6.35/2.50 #BackRed : 0
% 6.35/2.50
% 6.35/2.50 #Partial instantiations: 0
% 6.35/2.50 #Strategies tried : 1
% 6.35/2.50
% 6.35/2.50 Timing (in seconds)
% 6.35/2.50 ----------------------
% 6.35/2.51 Preprocessing : 0.63
% 6.35/2.51 Parsing : 0.33
% 6.35/2.51 CNF conversion : 0.05
% 6.35/2.51 Main loop : 0.83
% 6.35/2.51 Inferencing : 0.27
% 6.35/2.51 Reduction : 0.28
% 6.35/2.51 Demodulation : 0.20
% 6.35/2.51 BG Simplification : 0.04
% 6.35/2.51 Subsumption : 0.19
% 6.35/2.51 Abstraction : 0.03
% 6.35/2.51 MUC search : 0.00
% 6.35/2.51 Cooper : 0.00
% 6.35/2.51 Total : 1.50
% 6.35/2.51 Index Insertion : 0.00
% 6.35/2.51 Index Deletion : 0.00
% 6.35/2.51 Index Matching : 0.00
% 6.35/2.51 BG Taut test : 0.00
%------------------------------------------------------------------------------