TSTP Solution File: NUM838+2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : NUM838+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 : n025.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:51 EDT 2023
% Result : Theorem 4.43s 2.13s
% Output : CNFRefutation 4.43s
% 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 : 19 ( 10 >; 9 *; 0 +; 0 <<)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 4 con; 0-2 aty)
% Number of variables : 6 (; 6 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ less > leq > greater > vskolem7 > vplus > #nlpp > vsucc > vd303 > vd302 > vd301 > v1 > #skF_3 > #skF_2 > #skF_1 > #skF_4
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(greater,type,
greater: ( $i * $i ) > $o ).
tff(vd302,type,
vd302: $i ).
tff(vplus,type,
vplus: ( $i * $i ) > $i ).
tff(vd301,type,
vd301: $i ).
tff('#skF_3',type,
'#skF_3': ( $i * $i ) > $i ).
tff(less,type,
less: ( $i * $i ) > $o ).
tff(vd303,type,
vd303: $i ).
tff(vsucc,type,
vsucc: $i > $i ).
tff(v1,type,
v1: $i ).
tff(vskolem7,type,
vskolem7: ( $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(vd301,vd302),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',holds(antec(195),304,0)) ).
tff(f_50,axiom,
! [Vd310,Vd311,Vd312] :
( greater(Vd311,Vd312)
=> greater(vplus(Vd311,Vd310),vplus(Vd312,Vd310)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ass(cond(proof(196),0),4)) ).
tff(f_29,negated_conjecture,
~ greater(vplus(vd301,vd303),vplus(vd302,vd303)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',holds(conseq(195),305,0)) ).
tff(c_4,plain,
greater(vd301,vd302),
inference(cnfTransformation,[status(thm)],[f_30]) ).
tff(c_1179,plain,
! [Vd311_166,Vd310_167,Vd312_168] :
( greater(vplus(Vd311_166,Vd310_167),vplus(Vd312_168,Vd310_167))
| ~ greater(Vd311_166,Vd312_168) ),
inference(cnfTransformation,[status(thm)],[f_50]) ).
tff(c_2,plain,
~ greater(vplus(vd301,vd303),vplus(vd302,vd303)),
inference(cnfTransformation,[status(thm)],[f_29]) ).
tff(c_1188,plain,
~ greater(vd301,vd302),
inference(resolution,[status(thm)],[c_1179,c_2]) ).
tff(c_1258,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_4,c_1188]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : NUM838+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.36 % Computer : n025.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:00:19 EDT 2023
% 0.14/0.36 % CPUTime :
% 4.43/2.13 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.43/2.13
% 4.43/2.13 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 4.43/2.15
% 4.43/2.15 Inference rules
% 4.43/2.15 ----------------------
% 4.43/2.15 #Ref : 0
% 4.43/2.15 #Sup : 324
% 4.43/2.15 #Fact : 0
% 4.43/2.15 #Define : 0
% 4.43/2.15 #Split : 0
% 4.43/2.15 #Chain : 0
% 4.43/2.15 #Close : 0
% 4.43/2.15
% 4.43/2.15 Ordering : KBO
% 4.43/2.15
% 4.43/2.15 Simplification rules
% 4.43/2.15 ----------------------
% 4.43/2.15 #Subsume : 44
% 4.43/2.15 #Demod : 83
% 4.43/2.15 #Tautology : 80
% 4.43/2.15 #SimpNegUnit : 1
% 4.43/2.15 #BackRed : 0
% 4.43/2.15
% 4.43/2.15 #Partial instantiations: 0
% 4.43/2.16 #Strategies tried : 1
% 4.43/2.16
% 4.43/2.16 Timing (in seconds)
% 4.43/2.16 ----------------------
% 4.43/2.16 Preprocessing : 0.58
% 4.43/2.16 Parsing : 0.30
% 4.43/2.16 CNF conversion : 0.04
% 4.43/2.16 Main loop : 0.47
% 4.43/2.16 Inferencing : 0.17
% 4.43/2.16 Reduction : 0.16
% 4.43/2.16 Demodulation : 0.12
% 4.43/2.16 BG Simplification : 0.03
% 4.43/2.16 Subsumption : 0.09
% 4.43/2.16 Abstraction : 0.02
% 4.43/2.16 MUC search : 0.00
% 4.43/2.16 Cooper : 0.00
% 4.43/2.16 Total : 1.10
% 4.43/2.16 Index Insertion : 0.00
% 4.43/2.16 Index Deletion : 0.00
% 4.43/2.16 Index Matching : 0.00
% 4.43/2.16 BG Taut test : 0.00
%------------------------------------------------------------------------------