TSTP Solution File: NUM838+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : NUM838+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 : n024.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 5.49s 2.37s
% Output : CNFRefutation 5.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 19
% Syntax : Number of formulae : 24 ( 6 unt; 16 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 : 12 ( 12 usr; 4 con; 0-2 aty)
% Number of variables : 6 (; 6 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ less > leq > greater > geq > vskolem7 > vplus > #nlpp > vsucc > vskolem2 > 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(vskolem2,type,
vskolem2: $i > $i ).
tff(vd303,type,
vd303: $i ).
tff(vsucc,type,
vsucc: $i > $i ).
tff(v1,type,
v1: $i ).
tff(geq,type,
geq: ( $i * $i ) > $o ).
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_29,axiom,
greater(vd301,vd302),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',holds(antec(195),304,0)) ).
tff(f_49,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_28,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_29]) ).
tff(c_2613,plain,
! [Vd311_286,Vd310_287,Vd312_288] :
( greater(vplus(Vd311_286,Vd310_287),vplus(Vd312_288,Vd310_287))
| ~ greater(Vd311_286,Vd312_288) ),
inference(cnfTransformation,[status(thm)],[f_49]) ).
tff(c_2,plain,
~ greater(vplus(vd301,vd303),vplus(vd302,vd303)),
inference(cnfTransformation,[status(thm)],[f_28]) ).
tff(c_2628,plain,
~ greater(vd301,vd302),
inference(resolution,[status(thm)],[c_2613,c_2]) ).
tff(c_2700,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_4,c_2628]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : NUM838+1 : TPTP v8.1.2. Released v4.1.0.
% 0.08/0.15 % 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.36 % Computer : n024.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Thu Aug 3 15:09:45 EDT 2023
% 0.15/0.36 % CPUTime :
% 5.49/2.37 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.49/2.37
% 5.49/2.37 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 5.49/2.39
% 5.49/2.39 Inference rules
% 5.49/2.39 ----------------------
% 5.49/2.39 #Ref : 2
% 5.49/2.39 #Sup : 697
% 5.49/2.39 #Fact : 0
% 5.49/2.39 #Define : 0
% 5.49/2.39 #Split : 2
% 5.49/2.39 #Chain : 0
% 5.49/2.39 #Close : 0
% 5.49/2.39
% 5.49/2.39 Ordering : KBO
% 5.49/2.39
% 5.49/2.39 Simplification rules
% 5.49/2.39 ----------------------
% 5.49/2.39 #Subsume : 130
% 5.49/2.39 #Demod : 144
% 5.49/2.39 #Tautology : 146
% 5.49/2.39 #SimpNegUnit : 8
% 5.49/2.39 #BackRed : 0
% 5.49/2.39
% 5.49/2.39 #Partial instantiations: 0
% 5.49/2.39 #Strategies tried : 1
% 5.49/2.39
% 5.49/2.39 Timing (in seconds)
% 5.49/2.39 ----------------------
% 5.99/2.40 Preprocessing : 0.59
% 5.99/2.40 Parsing : 0.30
% 5.99/2.40 CNF conversion : 0.04
% 5.99/2.40 Main loop : 0.73
% 5.99/2.40 Inferencing : 0.24
% 5.99/2.40 Reduction : 0.25
% 5.99/2.40 Demodulation : 0.18
% 5.99/2.40 BG Simplification : 0.04
% 5.99/2.40 Subsumption : 0.15
% 5.99/2.40 Abstraction : 0.03
% 5.99/2.40 MUC search : 0.00
% 5.99/2.40 Cooper : 0.00
% 5.99/2.40 Total : 1.36
% 5.99/2.40 Index Insertion : 0.00
% 5.99/2.40 Index Deletion : 0.00
% 5.99/2.40 Index Matching : 0.00
% 5.99/2.40 BG Taut test : 0.00
%------------------------------------------------------------------------------