TSTP Solution File: NUM837+2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : NUM837+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 : n020.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.07s 2.02s
% Output : CNFRefutation 4.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 18
% Syntax : Number of formulae : 25 ( 7 unt; 14 typ; 0 def)
% Number of atoms : 15 ( 4 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 9 ( 5 ~; 2 |; 0 &)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 19 ( 10 >; 9 *; 0 +; 0 <<)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 4 con; 0-2 aty)
% Number of variables : 11 (; 9 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ less > leq > greater > geq > vplus > #nlpp > vsucc > vd271 > vd269 > vd268 > v1 > #skF_3 > #skF_2 > #skF_1 > #skF_4
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(greater,type,
greater: ( $i * $i ) > $o ).
tff(vd269,type,
vd269: $i ).
tff(vplus,type,
vplus: ( $i * $i ) > $i ).
tff('#skF_3',type,
'#skF_3': ( $i * $i ) > $i ).
tff(less,type,
less: ( $i * $i ) > $o ).
tff(vsucc,type,
vsucc: $i > $i ).
tff(vd268,type,
vd268: $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(vd271,type,
vd271: $i ).
tff('#skF_4',type,
'#skF_4': ( $i * $i ) > $i ).
tff(f_94,axiom,
! [Vd193,Vd194] :
( greater(Vd194,Vd193)
<=> ? [Vd196] : ( Vd194 = vplus(Vd193,Vd196) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',def(cond(conseq(axiom(3)),11),1)) ).
tff(f_30,negated_conjecture,
~ ? [Vd273] : ( vd269 = vplus(vd268,Vd273) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',qe(171)) ).
tff(f_32,axiom,
less(vd268,vd269),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',holds(conjunct1(170),270,0)) ).
tff(f_56,axiom,
! [Vd226,Vd227] :
( less(Vd226,Vd227)
=> greater(Vd227,Vd226) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ass(cond(147,0),0)) ).
tff(c_602,plain,
! [Vd193_149,Vd194_150] :
( ( vplus(Vd193_149,'#skF_2'(Vd193_149,Vd194_150)) = Vd194_150 )
| ~ greater(Vd194_150,Vd193_149) ),
inference(cnfTransformation,[status(thm)],[f_94]) ).
tff(c_2,plain,
! [Vd273_1] : ( vplus(vd268,Vd273_1) != vd269 ),
inference(cnfTransformation,[status(thm)],[f_30]) ).
tff(c_689,plain,
~ greater(vd269,vd268),
inference(superposition,[status(thm),theory(equality)],[c_602,c_2]) ).
tff(c_6,plain,
less(vd268,vd269),
inference(cnfTransformation,[status(thm)],[f_32]) ).
tff(c_93,plain,
! [Vd227_74,Vd226_75] :
( greater(Vd227_74,Vd226_75)
| ~ less(Vd226_75,Vd227_74) ),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_111,plain,
greater(vd269,vd268),
inference(resolution,[status(thm)],[c_6,c_93]) ).
tff(c_691,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_689,c_111]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : NUM837+2 : TPTP v8.1.2. Released v4.1.0.
% 0.00/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.19/0.37 % Computer : n020.cluster.edu
% 0.19/0.37 % Model : x86_64 x86_64
% 0.19/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.37 % Memory : 8042.1875MB
% 0.19/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.19/0.37 % CPULimit : 300
% 0.19/0.37 % WCLimit : 300
% 0.19/0.37 % DateTime : Thu Aug 3 14:52:52 EDT 2023
% 0.19/0.37 % CPUTime :
% 4.07/2.02 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.07/2.02
% 4.07/2.02 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 4.12/2.05
% 4.12/2.05 Inference rules
% 4.12/2.05 ----------------------
% 4.12/2.05 #Ref : 1
% 4.12/2.05 #Sup : 145
% 4.12/2.05 #Fact : 0
% 4.12/2.05 #Define : 0
% 4.12/2.05 #Split : 2
% 4.12/2.05 #Chain : 0
% 4.12/2.05 #Close : 0
% 4.12/2.05
% 4.12/2.05 Ordering : KBO
% 4.12/2.05
% 4.12/2.05 Simplification rules
% 4.12/2.05 ----------------------
% 4.12/2.05 #Subsume : 21
% 4.12/2.05 #Demod : 20
% 4.12/2.05 #Tautology : 34
% 4.12/2.05 #SimpNegUnit : 7
% 4.12/2.05 #BackRed : 1
% 4.12/2.05
% 4.12/2.05 #Partial instantiations: 0
% 4.12/2.05 #Strategies tried : 1
% 4.12/2.05
% 4.12/2.05 Timing (in seconds)
% 4.12/2.05 ----------------------
% 4.12/2.05 Preprocessing : 0.54
% 4.12/2.05 Parsing : 0.28
% 4.12/2.05 CNF conversion : 0.04
% 4.12/2.05 Main loop : 0.44
% 4.12/2.05 Inferencing : 0.17
% 4.12/2.05 Reduction : 0.13
% 4.12/2.05 Demodulation : 0.08
% 4.12/2.05 BG Simplification : 0.02
% 4.12/2.05 Subsumption : 0.10
% 4.12/2.05 Abstraction : 0.02
% 4.12/2.05 MUC search : 0.00
% 4.12/2.05 Cooper : 0.00
% 4.12/2.05 Total : 1.02
% 4.12/2.05 Index Insertion : 0.00
% 4.12/2.05 Index Deletion : 0.00
% 4.12/2.05 Index Matching : 0.00
% 4.12/2.05 BG Taut test : 0.00
%------------------------------------------------------------------------------