TSTP Solution File: NUM850+2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : NUM850+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/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 : n032.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:55 EDT 2023
% Result : Theorem 4.51s 2.15s
% Output : CNFRefutation 4.99s
% 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 : 22 ( 12 >; 10 *; 0 +; 0 <<)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 3 con; 0-2 aty)
% Number of variables : 7 (; 5 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ less > leq > greater > geq > vplus > vmul > #nlpp > vsucc > vskolem2 > vd471 > vd470 > 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(vd470,type,
vd470: $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(v1,type,
v1: $i ).
tff(vd471,type,
vd471: $i ).
tff(geq,type,
geq: ( $i * $i ) > $o ).
tff(vmul,type,
vmul: ( $i * $i ) > $i ).
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_183,axiom,
! [Vd193,Vd194] :
( greater(Vd194,Vd193)
<=> ? [Vd196] : ( Vd194 = vplus(Vd193,Vd196) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',def(cond(conseq(axiom(3)),11),1)) ).
tff(f_30,negated_conjecture,
~ ? [Vd473] : ( vd470 = vplus(vd471,Vd473) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',qe(conseq_conjunct1(conseq(302)))) ).
tff(f_31,axiom,
greater(vd470,vd471),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',holds(antec(302),472,0)) ).
tff(c_1709,plain,
! [Vd193_268,Vd194_269] :
( ( vplus(Vd193_268,'#skF_2'(Vd193_268,Vd194_269)) = Vd194_269 )
| ~ greater(Vd194_269,Vd193_268) ),
inference(cnfTransformation,[status(thm)],[f_183]) ).
tff(c_2,plain,
! [Vd473_1] : ( vplus(vd471,Vd473_1) != vd470 ),
inference(cnfTransformation,[status(thm)],[f_30]) ).
tff(c_1825,plain,
~ greater(vd470,vd471),
inference(superposition,[status(thm),theory(equality)],[c_1709,c_2]) ).
tff(c_4,plain,
greater(vd470,vd471),
inference(cnfTransformation,[status(thm)],[f_31]) ).
tff(c_1827,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_1825,c_4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUM850+2 : TPTP v8.1.2. Released v4.1.0.
% 0.00/0.13 % 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.13/0.33 % Computer : n032.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Thu Aug 3 14:43:51 EDT 2023
% 0.13/0.33 % CPUTime :
% 4.51/2.15 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.51/2.16
% 4.51/2.16 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.99/2.18
% 4.99/2.18 Inference rules
% 4.99/2.18 ----------------------
% 4.99/2.18 #Ref : 3
% 4.99/2.18 #Sup : 422
% 4.99/2.18 #Fact : 0
% 4.99/2.18 #Define : 0
% 4.99/2.18 #Split : 1
% 4.99/2.18 #Chain : 0
% 4.99/2.18 #Close : 0
% 4.99/2.18
% 4.99/2.18 Ordering : KBO
% 4.99/2.18
% 4.99/2.18 Simplification rules
% 4.99/2.18 ----------------------
% 4.99/2.18 #Subsume : 83
% 4.99/2.18 #Demod : 95
% 4.99/2.18 #Tautology : 141
% 4.99/2.18 #SimpNegUnit : 15
% 4.99/2.18 #BackRed : 1
% 4.99/2.18
% 4.99/2.18 #Partial instantiations: 0
% 4.99/2.18 #Strategies tried : 1
% 4.99/2.18
% 4.99/2.18 Timing (in seconds)
% 4.99/2.18 ----------------------
% 4.99/2.18 Preprocessing : 0.61
% 4.99/2.18 Parsing : 0.31
% 4.99/2.18 CNF conversion : 0.04
% 4.99/2.18 Main loop : 0.59
% 4.99/2.18 Inferencing : 0.19
% 4.99/2.18 Reduction : 0.20
% 4.99/2.18 Demodulation : 0.14
% 4.99/2.18 BG Simplification : 0.04
% 4.99/2.18 Subsumption : 0.13
% 4.99/2.18 Abstraction : 0.02
% 4.99/2.18 MUC search : 0.00
% 4.99/2.18 Cooper : 0.00
% 4.99/2.18 Total : 1.24
% 4.99/2.18 Index Insertion : 0.00
% 4.99/2.18 Index Deletion : 0.00
% 4.99/2.18 Index Matching : 0.00
% 4.99/2.18 BG Taut test : 0.00
%------------------------------------------------------------------------------