TSTP Solution File: NUM840+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : NUM840+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 : n026.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.45s 2.69s
% Output : CNFRefutation 6.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 23
% Syntax : Number of formulae : 46 ( 18 unt; 15 typ; 0 def)
% Number of atoms : 48 ( 9 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 35 ( 18 ~; 14 |; 0 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 2 ( 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 : 11 ( 11 usr; 4 con; 0-2 aty)
% Number of variables : 26 (; 26 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ less > leq > greater > geq > vplus > #nlpp > vsucc > vskolem2 > vd330 > vd329 > vd328 > 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('#skF_3',type,
'#skF_3': ( $i * $i ) > $i ).
tff(vd329,type,
vd329: $i ).
tff(less,type,
less: ( $i * $i ) > $o ).
tff(vskolem2,type,
vskolem2: $i > $i ).
tff(vd328,type,
vd328: $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(vd330,type,
vd330: $i ).
tff('#skF_1',type,
'#skF_1': ( $i * $i ) > $i ).
tff('#skF_4',type,
'#skF_4': ( $i * $i ) > $i ).
tff(f_111,axiom,
! [Vd203,Vd204] :
( ( Vd203 != Vd204 )
| ~ less(Vd203,Vd204) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ass(cond(goal(130),0),1)) ).
tff(f_91,axiom,
! [Vd244,Vd245] :
( geq(Vd245,Vd244)
<=> ( greater(Vd245,Vd244)
| ( Vd245 = Vd244 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',def(cond(conseq(axiom(3)),16),1)) ).
tff(f_105,axiom,
! [Vd203,Vd204] :
( ( Vd203 = Vd204 )
| greater(Vd203,Vd204)
| less(Vd203,Vd204) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ass(cond(goal(130),0),0)) ).
tff(f_28,negated_conjecture,
~ less(vd328,vd329),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',holds(conseq(conjunct2(conjunct2(204))),336,0)) ).
tff(f_99,axiom,
! [Vd208,Vd209] :
( greater(Vd208,Vd209)
=> less(Vd209,Vd208) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ass(cond(140,0),0)) ).
tff(f_47,axiom,
! [Vd301,Vd302,Vd303] :
( greater(Vd301,Vd302)
=> greater(vplus(Vd301,Vd303),vplus(Vd302,Vd303)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ass(cond(goal(193),0),2)) ).
tff(f_29,axiom,
less(vplus(vd328,vd330),vplus(vd329,vd330)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',holds(antec(conjunct2(conjunct2(204))),335,0)) ).
tff(f_117,axiom,
! [Vd203,Vd204] :
( ~ greater(Vd203,Vd204)
| ~ less(Vd203,Vd204) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ass(cond(goal(130),0),2)) ).
tff(c_49,plain,
! [Vd204_36] : ~ less(Vd204_36,Vd204_36),
inference(cnfTransformation,[status(thm)],[f_111]) ).
tff(c_39,plain,
! [Vd245_28] : geq(Vd245_28,Vd245_28),
inference(cnfTransformation,[status(thm)],[f_91]) ).
tff(c_869,plain,
! [Vd203_179,Vd204_180] :
( less(Vd203_179,Vd204_180)
| greater(Vd203_179,Vd204_180)
| ( Vd204_180 = Vd203_179 ) ),
inference(cnfTransformation,[status(thm)],[f_105]) ).
tff(c_2,plain,
~ less(vd328,vd329),
inference(cnfTransformation,[status(thm)],[f_28]) ).
tff(c_889,plain,
( greater(vd328,vd329)
| ( vd329 = vd328 ) ),
inference(resolution,[status(thm)],[c_869,c_2]) ).
tff(c_894,plain,
vd329 = vd328,
inference(splitLeft,[status(thm)],[c_889]) ).
tff(c_788,plain,
! [Vd245_173,Vd244_174] :
( ( Vd245_173 = Vd244_174 )
| greater(Vd245_173,Vd244_174)
| ~ geq(Vd245_173,Vd244_174) ),
inference(cnfTransformation,[status(thm)],[f_91]) ).
tff(c_456,plain,
! [Vd209_140,Vd208_141] :
( less(Vd209_140,Vd208_141)
| ~ greater(Vd208_141,Vd209_140) ),
inference(cnfTransformation,[status(thm)],[f_99]) ).
tff(c_472,plain,
~ greater(vd329,vd328),
inference(resolution,[status(thm)],[c_456,c_2]) ).
tff(c_839,plain,
( ( vd329 = vd328 )
| ~ geq(vd329,vd328) ),
inference(resolution,[status(thm)],[c_788,c_472]) ).
tff(c_868,plain,
~ geq(vd329,vd328),
inference(splitLeft,[status(thm)],[c_839]) ).
tff(c_895,plain,
~ geq(vd328,vd328),
inference(demodulation,[status(thm),theory(equality)],[c_894,c_868]) ).
tff(c_901,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_39,c_895]) ).
tff(c_902,plain,
greater(vd328,vd329),
inference(splitRight,[status(thm)],[c_889]) ).
tff(c_15,plain,
! [Vd301_7,Vd303_9,Vd302_8] :
( greater(vplus(Vd301_7,Vd303_9),vplus(Vd302_8,Vd303_9))
| ~ greater(Vd301_7,Vd302_8) ),
inference(cnfTransformation,[status(thm)],[f_47]) ).
tff(c_4,plain,
less(vplus(vd328,vd330),vplus(vd329,vd330)),
inference(cnfTransformation,[status(thm)],[f_29]) ).
tff(c_51,plain,
! [Vd203_37,Vd204_38] :
( ~ less(Vd203_37,Vd204_38)
| ~ greater(Vd203_37,Vd204_38) ),
inference(cnfTransformation,[status(thm)],[f_117]) ).
tff(c_622,plain,
~ greater(vplus(vd328,vd330),vplus(vd329,vd330)),
inference(resolution,[status(thm)],[c_4,c_51]) ).
tff(c_3488,plain,
~ greater(vd328,vd329),
inference(resolution,[status(thm)],[c_15,c_622]) ).
tff(c_3495,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_902,c_3488]) ).
tff(c_3496,plain,
vd329 = vd328,
inference(splitRight,[status(thm)],[c_839]) ).
tff(c_3523,plain,
less(vplus(vd328,vd330),vplus(vd328,vd330)),
inference(demodulation,[status(thm),theory(equality)],[c_3496,c_4]) ).
tff(c_3527,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_49,c_3523]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : NUM840+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.13/0.35 % Computer : n026.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu Aug 3 15:19:01 EDT 2023
% 0.20/0.35 % CPUTime :
% 6.45/2.69 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.45/2.69
% 6.45/2.69 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 6.45/2.72
% 6.45/2.72 Inference rules
% 6.45/2.72 ----------------------
% 6.45/2.72 #Ref : 2
% 6.45/2.72 #Sup : 919
% 6.45/2.72 #Fact : 0
% 6.45/2.72 #Define : 0
% 6.45/2.72 #Split : 2
% 6.45/2.72 #Chain : 0
% 6.45/2.72 #Close : 0
% 6.45/2.72
% 6.45/2.72 Ordering : KBO
% 6.45/2.72
% 6.45/2.72 Simplification rules
% 6.45/2.72 ----------------------
% 6.45/2.72 #Subsume : 176
% 6.45/2.72 #Demod : 172
% 6.45/2.72 #Tautology : 174
% 6.45/2.72 #SimpNegUnit : 14
% 6.45/2.72 #BackRed : 7
% 6.45/2.72
% 6.45/2.72 #Partial instantiations: 0
% 6.45/2.72 #Strategies tried : 1
% 6.45/2.72
% 6.45/2.72 Timing (in seconds)
% 6.45/2.72 ----------------------
% 6.45/2.72 Preprocessing : 0.59
% 6.45/2.72 Parsing : 0.32
% 6.45/2.72 CNF conversion : 0.04
% 6.45/2.72 Main loop : 0.96
% 6.45/2.72 Inferencing : 0.32
% 6.45/2.72 Reduction : 0.34
% 6.45/2.72 Demodulation : 0.24
% 6.45/2.72 BG Simplification : 0.04
% 6.45/2.72 Subsumption : 0.20
% 6.45/2.73 Abstraction : 0.04
% 6.45/2.73 MUC search : 0.00
% 6.45/2.73 Cooper : 0.00
% 6.45/2.73 Total : 1.60
% 6.45/2.73 Index Insertion : 0.00
% 6.45/2.73 Index Deletion : 0.00
% 6.45/2.73 Index Matching : 0.00
% 6.45/2.73 BG Taut test : 0.00
%------------------------------------------------------------------------------