TSTP Solution File: NUM843+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : NUM843+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/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% Computer : n023.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:52 EDT 2023
% Result : Theorem 6.79s 2.76s
% Output : CNFRefutation 6.79s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 20
% Syntax : Number of formulae : 38 ( 13 unt; 14 typ; 0 def)
% Number of atoms : 41 ( 10 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 29 ( 12 ~; 14 |; 0 &)
% ( 2 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 20 ( 11 >; 9 *; 0 +; 0 <<)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 3 con; 0-2 aty)
% Number of variables : 19 (; 19 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ less > leq > greater > geq > vplus > #nlpp > vsucc > vskolem2 > vd391 > vd390 > v1 > #skF_3 > #skF_2 > #skF_1 > #skF_4
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(greater,type,
greater: ( $i * $i ) > $o ).
tff(vplus,type,
vplus: ( $i * $i ) > $i ).
tff(vd390,type,
vd390: $i ).
tff('#skF_3',type,
'#skF_3': ( $i * $i ) > $i ).
tff(vd391,type,
vd391: $i ).
tff(less,type,
less: ( $i * $i ) > $o ).
tff(vskolem2,type,
vskolem2: $i > $i ).
tff(vsucc,type,
vsucc: $i > $i ).
tff(v1,type,
v1: $i ).
tff(geq,type,
geq: ( $i * $i ) > $o ).
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_127,axiom,
! [Vd244,Vd245] :
( geq(Vd245,Vd244)
<=> ( greater(Vd245,Vd244)
| ( Vd245 = Vd244 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',def(cond(conseq(axiom(3)),16),1)) ).
tff(f_28,negated_conjecture,
~ greater(vd390,vd391),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',holds(244,394,0)) ).
tff(f_141,axiom,
! [Vd203,Vd204] :
( ( Vd203 = Vd204 )
| greater(Vd203,Vd204)
| less(Vd203,Vd204) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ass(cond(goal(130),0),0)) ).
tff(f_121,axiom,
! [Vd249,Vd250] :
( leq(Vd250,Vd249)
<=> ( less(Vd250,Vd249)
| ( Vd250 = Vd249 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',def(cond(conseq(axiom(3)),17),1)) ).
tff(f_30,axiom,
~ leq(vd390,vd391),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',holds(conjunct2(243),393,0)) ).
tff(f_115,axiom,
! [Vd254,Vd255] :
( geq(Vd254,Vd255)
=> leq(Vd255,Vd254) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ass(cond(158,0),0)) ).
tff(c_55,plain,
! [Vd245_52] : geq(Vd245_52,Vd245_52),
inference(cnfTransformation,[status(thm)],[f_127]) ).
tff(c_2,plain,
~ greater(vd390,vd391),
inference(cnfTransformation,[status(thm)],[f_28]) ).
tff(c_868,plain,
! [Vd203_202,Vd204_203] :
( less(Vd203_202,Vd204_203)
| greater(Vd203_202,Vd204_203)
| ( Vd204_203 = Vd203_202 ) ),
inference(cnfTransformation,[status(thm)],[f_141]) ).
tff(c_51,plain,
! [Vd250_50,Vd249_49] :
( ~ less(Vd250_50,Vd249_49)
| leq(Vd250_50,Vd249_49) ),
inference(cnfTransformation,[status(thm)],[f_121]) ).
tff(c_4810,plain,
! [Vd203_363,Vd204_364] :
( leq(Vd203_363,Vd204_364)
| greater(Vd203_363,Vd204_364)
| ( Vd204_364 = Vd203_363 ) ),
inference(resolution,[status(thm)],[c_868,c_51]) ).
tff(c_4,plain,
~ leq(vd390,vd391),
inference(cnfTransformation,[status(thm)],[f_30]) ).
tff(c_4824,plain,
( greater(vd390,vd391)
| ( vd391 = vd390 ) ),
inference(resolution,[status(thm)],[c_4810,c_4]) ).
tff(c_4831,plain,
vd391 = vd390,
inference(negUnitSimplification,[status(thm)],[c_2,c_4824]) ).
tff(c_927,plain,
! [Vd245_208,Vd244_209] :
( ( Vd245_208 = Vd244_209 )
| greater(Vd245_208,Vd244_209)
| ~ geq(Vd245_208,Vd244_209) ),
inference(cnfTransformation,[status(thm)],[f_127]) ).
tff(c_982,plain,
( ( vd391 = vd390 )
| ~ geq(vd390,vd391) ),
inference(resolution,[status(thm)],[c_927,c_2]) ).
tff(c_1016,plain,
~ geq(vd390,vd391),
inference(splitLeft,[status(thm)],[c_982]) ).
tff(c_4849,plain,
~ geq(vd390,vd390),
inference(demodulation,[status(thm),theory(equality)],[c_4831,c_1016]) ).
tff(c_4869,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_55,c_4849]) ).
tff(c_4870,plain,
vd391 = vd390,
inference(splitRight,[status(thm)],[c_982]) ).
tff(c_276,plain,
! [Vd255_147,Vd254_148] :
( leq(Vd255_147,Vd254_148)
| ~ geq(Vd254_148,Vd255_147) ),
inference(cnfTransformation,[status(thm)],[f_115]) ).
tff(c_284,plain,
~ geq(vd391,vd390),
inference(resolution,[status(thm)],[c_276,c_4]) ).
tff(c_4875,plain,
~ geq(vd390,vd390),
inference(demodulation,[status(thm),theory(equality)],[c_4870,c_284]) ).
tff(c_4884,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_55,c_4875]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : NUM843+1 : TPTP v8.1.2. Released v4.1.0.
% 0.07/0.14 % Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.14/0.36 % Computer : n023.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:27:52 EDT 2023
% 0.14/0.36 % CPUTime :
% 6.79/2.76 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 6.79/2.77
% 6.79/2.77 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 6.79/2.79
% 6.79/2.79 Inference rules
% 6.79/2.79 ----------------------
% 6.79/2.79 #Ref : 3
% 6.79/2.79 #Sup : 1262
% 6.79/2.79 #Fact : 0
% 6.79/2.79 #Define : 0
% 6.79/2.79 #Split : 1
% 6.79/2.79 #Chain : 0
% 6.79/2.79 #Close : 0
% 6.79/2.79
% 6.79/2.79 Ordering : KBO
% 6.79/2.79
% 6.79/2.79 Simplification rules
% 6.79/2.79 ----------------------
% 6.79/2.79 #Subsume : 233
% 6.79/2.79 #Demod : 267
% 6.79/2.79 #Tautology : 219
% 6.79/2.79 #SimpNegUnit : 25
% 6.79/2.79 #BackRed : 36
% 6.79/2.79
% 6.79/2.79 #Partial instantiations: 0
% 6.79/2.79 #Strategies tried : 1
% 6.79/2.79
% 6.79/2.79 Timing (in seconds)
% 6.79/2.79 ----------------------
% 6.79/2.80 Preprocessing : 0.61
% 6.79/2.80 Parsing : 0.32
% 6.79/2.80 CNF conversion : 0.04
% 6.79/2.80 Main loop : 1.09
% 6.79/2.80 Inferencing : 0.32
% 6.79/2.80 Reduction : 0.40
% 6.79/2.80 Demodulation : 0.27
% 6.79/2.80 BG Simplification : 0.05
% 6.79/2.80 Subsumption : 0.25
% 6.79/2.80 Abstraction : 0.04
% 6.79/2.80 MUC search : 0.00
% 6.79/2.80 Cooper : 0.00
% 6.79/2.80 Total : 1.75
% 6.79/2.80 Index Insertion : 0.00
% 6.79/2.80 Index Deletion : 0.00
% 6.79/2.80 Index Matching : 0.00
% 6.79/2.80 BG Taut test : 0.00
%------------------------------------------------------------------------------