TSTP Solution File: NUM854+2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : NUM854+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 : n016.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 4.07s 2.15s
% Output : CNFRefutation 4.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 17
% Syntax : Number of formulae : 22 ( 6 unt; 14 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 : 17 ( 9 >; 8 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 5 con; 0-2 aty)
% Number of variables : 6 (; 6 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ less > greater > vplus > vmul > #nlpp > vsucc > 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(vsucc,type,
vsucc: $i > $i ).
tff(vd508,type,
vd508: $i ).
tff(v1,type,
v1: $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('#skF_4',type,
'#skF_4': ( $i * $i ) > $i ).
tff(f_31,axiom,
greater(vd508,vd509),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',holds(conjunct1(314),510,0)) ).
tff(f_55,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_29,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_31]) ).
tff(c_1023,plain,
! [Vd457_156,Vd456_157,Vd458_158] :
( greater(vmul(Vd457_156,Vd456_157),vmul(Vd458_158,Vd456_157))
| ~ greater(Vd457_156,Vd458_158) ),
inference(cnfTransformation,[status(thm)],[f_55]) ).
tff(c_2,plain,
~ greater(vmul(vd508,vd511),vmul(vd509,vd511)),
inference(cnfTransformation,[status(thm)],[f_29]) ).
tff(c_1034,plain,
~ greater(vd508,vd509),
inference(resolution,[status(thm)],[c_1023,c_2]) ).
tff(c_1081,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_6,c_1034]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : NUM854+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.14/0.35 % Computer : n016.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu Aug 3 15:32:23 EDT 2023
% 0.14/0.35 % CPUTime :
% 4.07/2.15 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.07/2.15
% 4.07/2.15 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 4.07/2.17
% 4.07/2.17 Inference rules
% 4.07/2.17 ----------------------
% 4.07/2.17 #Ref : 3
% 4.07/2.17 #Sup : 265
% 4.07/2.17 #Fact : 0
% 4.07/2.17 #Define : 0
% 4.07/2.17 #Split : 0
% 4.07/2.17 #Chain : 0
% 4.07/2.17 #Close : 0
% 4.07/2.17
% 4.07/2.17 Ordering : KBO
% 4.07/2.17
% 4.07/2.17 Simplification rules
% 4.07/2.17 ----------------------
% 4.07/2.17 #Subsume : 49
% 4.07/2.17 #Demod : 51
% 4.07/2.17 #Tautology : 78
% 4.07/2.17 #SimpNegUnit : 4
% 4.07/2.17 #BackRed : 0
% 4.07/2.17
% 4.07/2.17 #Partial instantiations: 0
% 4.07/2.17 #Strategies tried : 1
% 4.07/2.17
% 4.07/2.17 Timing (in seconds)
% 4.07/2.17 ----------------------
% 4.07/2.18 Preprocessing : 0.57
% 4.07/2.18 Parsing : 0.30
% 4.07/2.18 CNF conversion : 0.04
% 4.07/2.18 Main loop : 0.48
% 4.07/2.18 Inferencing : 0.18
% 4.07/2.18 Reduction : 0.15
% 4.07/2.18 Demodulation : 0.11
% 4.07/2.18 BG Simplification : 0.03
% 4.07/2.18 Subsumption : 0.09
% 4.07/2.18 Abstraction : 0.03
% 4.07/2.18 MUC search : 0.00
% 4.07/2.18 Cooper : 0.00
% 4.07/2.18 Total : 1.10
% 4.07/2.18 Index Insertion : 0.00
% 4.07/2.18 Index Deletion : 0.00
% 4.07/2.18 Index Matching : 0.00
% 4.07/2.18 BG Taut test : 0.00
%------------------------------------------------------------------------------