TSTP Solution File: NUM840+2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : NUM840+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 : n003.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 4.97s 2.22s
% Output : CNFRefutation 4.97s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 19
% Syntax : Number of formulae : 37 ( 15 unt; 12 typ; 0 def)
% Number of atoms : 37 ( 11 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 26 ( 14 ~; 10 |; 0 &)
% ( 0 <=>; 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 : 15 ( 8 >; 7 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 4 con; 0-2 aty)
% Number of variables : 17 (; 17 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ less > greater > vplus > #nlpp > vsucc > 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(vd328,type,
vd328: $i ).
tff(vsucc,type,
vsucc: $i > $i ).
tff(v1,type,
v1: $i ).
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_68,axiom,
! [Vd203,Vd204] :
( ( Vd203 != Vd204 )
| ~ less(Vd203,Vd204) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ass(cond(goal(130),0),1)) ).
tff(f_62,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_29,negated_conjecture,
~ less(vd328,vd329),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',holds(conseq(conjunct2(conjunct2(204))),336,0)) ).
tff(f_33,axiom,
( ( vplus(vd328,vd330) = vplus(vd329,vd330) )
=> ( vd328 = vd329 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ass(cond(conjunct1(conjunct2(204)),0),0)) ).
tff(f_48,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_30,axiom,
less(vplus(vd328,vd330),vplus(vd329,vd330)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',holds(antec(conjunct2(conjunct2(204))),335,0)) ).
tff(f_74,axiom,
! [Vd203,Vd204] :
( ~ greater(Vd203,Vd204)
| ~ less(Vd203,Vd204) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ass(cond(goal(130),0),2)) ).
tff(c_23,plain,
! [Vd204_17] : ~ less(Vd204_17,Vd204_17),
inference(cnfTransformation,[status(thm)],[f_68]) ).
tff(c_411,plain,
! [Vd203_111,Vd204_112] :
( less(Vd203_111,Vd204_112)
| greater(Vd203_111,Vd204_112)
| ( Vd204_112 = Vd203_111 ) ),
inference(cnfTransformation,[status(thm)],[f_62]) ).
tff(c_2,plain,
~ less(vd328,vd329),
inference(cnfTransformation,[status(thm)],[f_29]) ).
tff(c_427,plain,
( greater(vd328,vd329)
| ( vd329 = vd328 ) ),
inference(resolution,[status(thm)],[c_411,c_2]) ).
tff(c_432,plain,
vd329 = vd328,
inference(splitLeft,[status(thm)],[c_427]) ).
tff(c_6,plain,
( ( vd329 = vd328 )
| ( vplus(vd329,vd330) != vplus(vd328,vd330) ) ),
inference(cnfTransformation,[status(thm)],[f_33]) ).
tff(c_345,plain,
vplus(vd329,vd330) != vplus(vd328,vd330),
inference(splitLeft,[status(thm)],[c_6]) ).
tff(c_438,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_432,c_345]) ).
tff(c_439,plain,
greater(vd328,vd329),
inference(splitRight,[status(thm)],[c_427]) ).
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_48]) ).
tff(c_4,plain,
less(vplus(vd328,vd330),vplus(vd329,vd330)),
inference(cnfTransformation,[status(thm)],[f_30]) ).
tff(c_25,plain,
! [Vd203_18,Vd204_19] :
( ~ less(Vd203_18,Vd204_19)
| ~ greater(Vd203_18,Vd204_19) ),
inference(cnfTransformation,[status(thm)],[f_74]) ).
tff(c_313,plain,
~ greater(vplus(vd328,vd330),vplus(vd329,vd330)),
inference(resolution,[status(thm)],[c_4,c_25]) ).
tff(c_1897,plain,
~ greater(vd328,vd329),
inference(resolution,[status(thm)],[c_15,c_313]) ).
tff(c_1901,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_439,c_1897]) ).
tff(c_1902,plain,
vd329 = vd328,
inference(splitRight,[status(thm)],[c_6]) ).
tff(c_1904,plain,
less(vplus(vd328,vd330),vplus(vd328,vd330)),
inference(demodulation,[status(thm),theory(equality)],[c_1902,c_4]) ).
tff(c_1908,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_23,c_1904]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : NUM840+2 : TPTP v8.1.2. Released v4.1.0.
% 0.12/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 : n003.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 14:29:53 EDT 2023
% 0.13/0.36 % CPUTime :
% 4.97/2.22 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.97/2.23
% 4.97/2.23 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 4.97/2.25
% 4.97/2.25 Inference rules
% 4.97/2.25 ----------------------
% 4.97/2.25 #Ref : 2
% 4.97/2.25 #Sup : 503
% 4.97/2.25 #Fact : 0
% 4.97/2.25 #Define : 0
% 4.97/2.25 #Split : 2
% 4.97/2.25 #Chain : 0
% 4.97/2.25 #Close : 0
% 4.97/2.25
% 4.97/2.25 Ordering : KBO
% 4.97/2.25
% 4.97/2.25 Simplification rules
% 4.97/2.25 ----------------------
% 4.97/2.25 #Subsume : 101
% 4.97/2.25 #Demod : 112
% 4.97/2.25 #Tautology : 96
% 4.97/2.25 #SimpNegUnit : 3
% 4.97/2.25 #BackRed : 7
% 4.97/2.25
% 4.97/2.25 #Partial instantiations: 0
% 4.97/2.25 #Strategies tried : 1
% 4.97/2.25
% 4.97/2.25 Timing (in seconds)
% 4.97/2.25 ----------------------
% 4.97/2.26 Preprocessing : 0.55
% 4.97/2.26 Parsing : 0.29
% 4.97/2.26 CNF conversion : 0.03
% 4.97/2.26 Main loop : 0.63
% 4.97/2.26 Inferencing : 0.21
% 4.97/2.26 Reduction : 0.22
% 4.97/2.26 Demodulation : 0.16
% 4.97/2.26 BG Simplification : 0.03
% 4.97/2.26 Subsumption : 0.13
% 4.97/2.26 Abstraction : 0.03
% 4.97/2.26 MUC search : 0.00
% 4.97/2.26 Cooper : 0.00
% 4.97/2.26 Total : 1.22
% 4.97/2.26 Index Insertion : 0.00
% 4.97/2.26 Index Deletion : 0.00
% 4.97/2.26 Index Matching : 0.00
% 4.97/2.26 BG Taut test : 0.00
%------------------------------------------------------------------------------