TSTP Solution File: NUM837+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : NUM837+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 4.55s 2.12s
% Output : CNFRefutation 4.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 18
% Syntax : Number of formulae : 23 ( 6 unt; 15 typ; 0 def)
% Number of atoms : 10 ( 4 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 6 ( 4 ~; 1 |; 0 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 3 ( 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 : 7 (; 5 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ less > leq > greater > geq > vplus > #nlpp > vsucc > vskolem2 > 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(vskolem2,type,
vskolem2: $i > $i ).
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_88,axiom,
! [Vd198,Vd199] :
( less(Vd199,Vd198)
<=> ? [Vd201] : ( Vd198 = vplus(Vd199,Vd201) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',def(cond(conseq(axiom(3)),12),1)) ).
tff(f_29,negated_conjecture,
~ ? [Vd273] : ( vd269 = vplus(vd268,Vd273) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',qe(171)) ).
tff(f_31,axiom,
less(vd268,vd269),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',holds(conjunct1(170),270,0)) ).
tff(c_1243,plain,
! [Vd199_183,Vd198_184] :
( ( vplus(Vd199_183,'#skF_1'(Vd198_184,Vd199_183)) = Vd198_184 )
| ~ less(Vd199_183,Vd198_184) ),
inference(cnfTransformation,[status(thm)],[f_88]) ).
tff(c_2,plain,
! [Vd273_1] : ( vplus(vd268,Vd273_1) != vd269 ),
inference(cnfTransformation,[status(thm)],[f_29]) ).
tff(c_1341,plain,
~ less(vd268,vd269),
inference(superposition,[status(thm),theory(equality)],[c_1243,c_2]) ).
tff(c_6,plain,
less(vd268,vd269),
inference(cnfTransformation,[status(thm)],[f_31]) ).
tff(c_1343,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_1341,c_6]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.14 % Problem : NUM837+1 : TPTP v8.1.2. Released v4.1.0.
% 0.12/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:15:00 EDT 2023
% 0.15/0.36 % CPUTime :
% 4.55/2.12 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.55/2.12
% 4.55/2.12 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 4.67/2.14
% 4.67/2.14 Inference rules
% 4.67/2.14 ----------------------
% 4.67/2.14 #Ref : 2
% 4.67/2.14 #Sup : 314
% 4.67/2.14 #Fact : 0
% 4.67/2.14 #Define : 0
% 4.67/2.14 #Split : 2
% 4.67/2.14 #Chain : 0
% 4.67/2.14 #Close : 0
% 4.67/2.14
% 4.67/2.14 Ordering : KBO
% 4.67/2.14
% 4.67/2.14 Simplification rules
% 4.67/2.14 ----------------------
% 4.67/2.14 #Subsume : 62
% 4.67/2.14 #Demod : 64
% 4.67/2.14 #Tautology : 94
% 4.67/2.15 #SimpNegUnit : 7
% 4.67/2.15 #BackRed : 1
% 4.67/2.15
% 4.67/2.15 #Partial instantiations: 0
% 4.67/2.15 #Strategies tried : 1
% 4.67/2.15
% 4.67/2.15 Timing (in seconds)
% 4.67/2.15 ----------------------
% 4.67/2.15 Preprocessing : 0.55
% 4.67/2.15 Parsing : 0.28
% 4.67/2.15 CNF conversion : 0.04
% 4.67/2.15 Main loop : 0.53
% 4.67/2.15 Inferencing : 0.19
% 4.67/2.15 Reduction : 0.18
% 4.67/2.15 Demodulation : 0.12
% 4.67/2.15 BG Simplification : 0.03
% 4.67/2.15 Subsumption : 0.11
% 4.67/2.15 Abstraction : 0.02
% 4.67/2.15 MUC search : 0.00
% 4.67/2.15 Cooper : 0.00
% 4.67/2.15 Total : 1.12
% 4.67/2.15 Index Insertion : 0.00
% 4.67/2.15 Index Deletion : 0.00
% 4.67/2.15 Index Matching : 0.00
% 4.67/2.15 BG Taut test : 0.00
%------------------------------------------------------------------------------